Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4875

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

Computing symmetries of combinatorial objects
Brendan D. McKay
Lecture Notes in Computer Science 4875, 2008, pp. 1-1
Large-scale graphics: Digital nature and laser projection
Norishige Chiba
Lecture Notes in Computer Science 4875, 2008, pp. 2-2
Crossing number of graphs with rotation systems
Michael J. Pelsmajer, Marcus Schaefer, Daniel S̑tefankovic̑
Lecture Notes in Computer Science 4875, 2008, pp. 3-12
A bipartite strengthening of the crossing lemma
Jacob Fox, János Pach, Csaba D. Tóth
Lecture Notes in Computer Science 4875, 2008, pp. 13-24
Improvement on the decay of crossing numbers
Jakub C̑erný, Jan Kync̑l, Géza Tóth
Lecture Notes in Computer Science 4875, 2008, pp. 25-30
Crossing numbers and parameterized complexity
Michael J. Pelsmajer, Marcus Schaefer, Daniel S̑tefankovic̑
Lecture Notes in Computer Science 4875, 2008, pp. 31-36
Characterization of unlabeled level planar graphs
J. Joseph Fowler, Stephen G. Kobourov
Lecture Notes in Computer Science 4875, 2008, pp. 37-49
Cyclic level planarity testing and embedding
Christian Bachmaier, Wolfgang Brunner, Christof König
Lecture Notes in Computer Science 4875, 2008, pp. 50-61
Practical level planarity testing and layout with embedding constraints
Martin Harrigan, Patrick Healy
Lecture Notes in Computer Science 4875, 2008, pp. 62-68
Minimum level nonplanar patterns for trees
J. Joseph Fowler, Stephen Kobourov
Lecture Notes in Computer Science 4875, 2008, pp. 69-75
Straight-line orthogonal drawings of binary and ternary trees
Fabrizio Frati
Lecture Notes in Computer Science 4875, 2008, pp. 76-87
Polynomial area bounds for MST embeddings of trees
Michael Kaufmann
Lecture Notes in Computer Science 4875, 2008, pp. 88-100
Moving vertices to make drawings plane
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
Lecture Notes in Computer Science 4875, 2008, pp. 101-112
Point-set embedding of trees with edge constraints
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
Lecture Notes in Computer Science 4875, 2008, pp. 113-124
Representation of planar hypergraphs by contacts of triangles
Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl
Lecture Notes in Computer Science 4875, 2008, pp. 125-136
The complexity of several realizability problems for abstract topological graphs
Jan Kync̑l
Lecture Notes in Computer Science 4875, 2008, pp. 137-158
Efficient extraction of multiple Kuratowski subdivisions
Markus Chimani, Petra Mutzel, Jens M. Schmidt
Lecture Notes in Computer Science 4875, 2008, pp. 159-170
Cover contact graphs
Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, Alexander Wolff
Lecture Notes in Computer Science 4875, 2008, pp. 171-182
Matched drawings of planar graphs
Emilio Di Giacomo, Walter Didimo, Marc van Kreveld, Giuseppe Liotta, Bettina Speckmann
Lecture Notes in Computer Science 4875, 2008, pp. 183-194
Maximum upward planar subgraphs of embedded planar digraphs
Carla Binucci, Walter Didimo, Francesco Giordano
Lecture Notes in Computer Science 4875, 2008, pp. 195-206
Minimizing the area for planar straight-line grid drawings
Marcus Krug, Dorothea Wagner
Lecture Notes in Computer Science 4875, 2008, pp. 207-212
On planar polyline drawings
Huaming Zhang, Sadish Sadasivam
Lecture Notes in Computer Science 4875, 2008, pp. 213-218
Constrained stress majorization using diagonally scaled gradient projection
Tim Dwyer, Kim Marriott
Lecture Notes in Computer Science 4875, 2008, pp. 219-230
Line crossing minimization on metro maps
Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
Lecture Notes in Computer Science 4875, 2008, pp. 231-242
Algorithms for multi-criteria one-sided boundary labeling
Marc Benkert, Herman Haverkort, Moritz Kroll, Martin Nöllenburg
Lecture Notes in Computer Science 4875, 2008, pp. 243-254

Seiten 1 2 >