Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=2528

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Sketch-driven orthogonal graph drawing
Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner
Lecture Notes in Computer Science 2528, 2002, pp. 1-11
Maintaining the mental map for circular drawings
Michael Kaufmann, Roland Wiese
Lecture Notes in Computer Science 2528, 2002, pp. 12-22
Graphs, they are changing - Dynamic graph drawing for a sequence of graphs
Stephan Diehl, Carsten Görg
Lecture Notes in Computer Science 2528, 2002, pp. 23-30
Drawing graphs on two and three lines
Sabine Cornelsen, Thomas Schank, Dorothea Wagner
Lecture Notes in Computer Science 2528, 2002, pp. 31-41
Path-width and three-dimensional straight-line grid drawings of graphs
Vida Dujmović, Pat Morin, David R. Wood
Lecture Notes in Computer Science 2528, 2002, pp. 42-53
Drawing outer-planar graphs in O(n \log n) area
Therese Biedl
Lecture Notes in Computer Science 2528, 2002, pp. 54-65
Computing labeled orthogonal drawings
Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
Lecture Notes in Computer Science 2528, 2002, pp. 66-73
Computing and drawing isomorphic subgraphs
Sabine Bachl, Franz-Josef Brandenburg
Lecture Notes in Computer Science 2528, 2002, pp. 74-85
A group-theoretic method for drawing graphs symmetrically
David Abelson, Seok-Hee Hong, Donald E. Taylor
Lecture Notes in Computer Science 2528, 2002, pp. 86-97
A branch-and-cut approach to the directed acyclic graph layering problem
Patrick Healy, Nikola S. Nikolov
Lecture Notes in Computer Science 2528, 2002, pp. 98-109
Geometric systems of disjoint representatives
Jiȓí Fiala, Jan Kratochvíl, Andrzej Proskurowski
Lecture Notes in Computer Science 2528, 2002, pp. 110-117
An efficient fixed parameter tractable algorithm for 1-sided crossing minimization
Vida Dujmović, Sue Whitesides
Lecture Notes in Computer Science 2528, 2002, pp. 118-129
Simple and efficient bilayer cross counting
Wilhelm Barth, Michael Jünger, Petra Mutzel
Lecture Notes in Computer Science 2528, 2002, pp. 130-141
Orthogonal 3D shapes of theta graphs
Emilio di Giacomo, Giuseppe Liotta, Maurizio Patrignani
Lecture Notes in Computer Science 2528, 2002, pp. 142-149
Separating thickness from geometric thickness
David Eppstein
Lecture Notes in Computer Science 2528, 2002, pp. 150-161
Book embeddings and point-set embeddings of series-parallel digraphs
Emilio di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
Lecture Notes in Computer Science 2528, 2002, pp. 162-173
Compact encodings of planar orthogonal drawings
Amrita Chanda, Ashim Garg
Lecture Notes in Computer Science 2528, 2002, pp. 174-185
Fractional lengths and crossing numbers
Ondrej Sýkora, László A. Székely, Imrich Vrt'o
Lecture Notes in Computer Science 2528, 2002, pp. 186-192
Drawing directed graphs using one-dimensional optimization
Liran Carmel, David Harel, Yehuda Koren
Lecture Notes in Computer Science 2528, 2002, pp. 193-206
Graph drawing by high-dimensional embedding
David Harel, Yehuda Koren
Lecture Notes in Computer Science 2528, 2002, pp. 207-219
Advances in C-planarity testing of clustered graphs
Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
Lecture Notes in Computer Science 2528, 2002, pp. 220-235
HGV: A library for hierarchies, graphs, and views
Marcus Raitner
Lecture Notes in Computer Science 2528, 2002, pp. 236-243
Rectangular drawings of planar graphs
Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
Lecture Notes in Computer Science 2528, 2002, pp. 244-255
Extended rectangular drawings of plane graphs with designated corners
Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki
Lecture Notes in Computer Science 2528, 2002, pp. 256-267
RINGS: A technique for visualizing large hierarchies
Soon Tee Teoh, Kwan-Liu Ma
Lecture Notes in Computer Science 2528, 2002, pp. 268-275

Seiten 1 2 >