Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3383

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

Reconfiguring triangulations with edge flips and point moves
Greg Aloupis, Prosenjit Bose, Pat Morin
Lecture Notes in Computer Science 3383, 2004, pp. 1-11
Drawing power law graphs
Reid Andersen, Fan Chung, Lincoln Lu
Lecture Notes in Computer Science 3383, 2004, pp. 12-17
Hexagonal grid drawings: Algorithms and lower bounds
Shabnam Aziza, Therese Biedl
Lecture Notes in Computer Science 3383, 2004, pp. 18-24
Improved bounds for the number of (\le k)-sets, convex quadrilaterals, and the rectilinear crossing number of K_n
József Balogh, Gelasio Salazar
Lecture Notes in Computer Science 3383, 2004, pp. 25-35
On the realizable weaving patterns of polynomial curves in R^3
Saugata Basu, Raghavan Dhandapani, Richard Pollack
Lecture Notes in Computer Science 3383, 2004, pp. 36-42
Drawing the AS graph in 2.5 dimensions
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner
Lecture Notes in Computer Science 3383, 2004, pp. 43-48
Boundary labeling: Models and efficient algorithms for rectangular maps
Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
Lecture Notes in Computer Science 3383, 2004, pp. 49-59
Convex drawings of 3-connected plane graphs
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
Lecture Notes in Computer Science 3383, 2004, pp. 60-70
Partitions of complete geometric graphs into plane trees
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
Lecture Notes in Computer Science 3383, 2004, pp. 71-81
Additional PC-tree planarity conditions
John M. Boyer
Lecture Notes in Computer Science 3383, 2004, pp. 82-88
GraphML transformation
Ulrik Brandes, Christian Pich
Lecture Notes in Computer Science 3383, 2004, pp. 89-99
Clustering cycles into cycles of clusters
Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
Lecture Notes in Computer Science 3383, 2004, pp. 100-110
Unit bar-visibility layouts of triangulated polygons
Alice M. Dean, Ellen Gethner, Joan P. Hutchinson
Lecture Notes in Computer Science 3383, 2004, pp. 111-121
Really straight graph drawings
Vida Dujmović, Matthew Suderman, David R. Wood
Lecture Notes in Computer Science 3383, 2004, pp. 122-132
Layouts of graph subdivisions
Vida Dujmović, David R. Wood
Lecture Notes in Computer Science 3383, 2004, pp. 133-143
Label number maximization in the slider model
Dietmar Ebner, Gunnar W. Klau, René Weiskircher
Lecture Notes in Computer Science 3383, 2004, pp. 144-154
An efficient implementation of Sugiyama's algorithm for layered graph drawing
Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann
Lecture Notes in Computer Science 3383, 2004, pp. 155-166
Random geometric graph diameter in the unit disk with l_p metric
Robert B. Ellis, Jeremy L. Martin, Catherine Yan
Lecture Notes in Computer Science 3383, 2004, pp. 167-172
Algorithms for drawing media
David Eppstein
Lecture Notes in Computer Science 3383, 2004, pp. 173-183
Confluent layered drawings
David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
Lecture Notes in Computer Science 3383, 2004, pp. 184-194
Simultaneous embedding of planar graphs with few bends
Cesim Erten, Stephen G. Kobourov
Lecture Notes in Computer Science 3383, 2004, pp. 195-205
A fast and simple heuristic for constrained two-level crossing reduction
Michael Forster
Lecture Notes in Computer Science 3383, 2004, pp. 206-216
Contact and intersection representations
Hubert de Fraysseix, Patrice Ossona de Mendez
Lecture Notes in Computer Science 3383, 2004, pp. 217-227
Dynamic graph drawing of sequences of orthogonal and hierarchical graphs
Carsten Görg, Peter Birke, Mathias Pohl, Stephan Diehl
Lecture Notes in Computer Science 3383, 2004, pp. 228-238
Graph drawing by stress majorization
Emden R. Gansner, Yehuda Koren, Stephen North
Lecture Notes in Computer Science 3383, 2004, pp. 239-250

Seiten 1 2 3 >