Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Booktitle=Proceedings of the 21st International Symposium on Graph Drawing, GD'2013 (Bordeaux, France, September 23-25, 2013)

• On the upward planarity of mixed plane graphs
  Fabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood
  Lecture Notes in Computer Science 8242, 2013, pp. 1-12
• Upward planarity testing: A computational study
  Markus Chimani, Robert Zeranski
  Lecture Notes in Computer Science 8242, 2013, pp. 13-24
• Characterizing planarity by the splittable deque
  Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
  Lecture Notes in Computer Science 8242, 2013, pp. 25-36
• Strip planarity testing
  Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati
  Lecture Notes in Computer Science 8242, 2013, pp. 37-48
• Morphing planar graph drawings efficiently
  Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
  Lecture Notes in Computer Science 8242, 2013, pp. 49-60
• Graph drawing through the lens of a framework for analyzing visualization methods
  Tamara Munzner
  Lecture Notes in Computer Science 8242, 2013, pp. 61-70
• A linear-time algorithm for testing outer-1-planarity
  Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
  Lecture Notes in Computer Science 8242, 2013, pp. 71-82
• Straight-line grid drawings of 3-connected 1-planar graphs
  Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov
  Lecture Notes in Computer Science 8242, 2013, pp. 83-94
• New bounds on the maximum number of edges in k-quasi-planar graphs
  Andrew Suk, Bartosz Walczak
  Lecture Notes in Computer Science 8242, 2013, pp. 95-106
• Recognizing outer 1-planar graphs in linear time
  Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber
  Lecture Notes in Computer Science 8242, 2013, pp. 107-118
• Straight line triangle representations
  Nieke Aerts, Stefan Felsner
  Lecture Notes in Computer Science 8242, 2013, pp. 119-130
• Extending partial representations of circle graphs
  Steven Chaplick, Radoslav Fulek, Pavel Klavík
  Lecture Notes in Computer Science 8242, 2013, pp. 131-142
• On balanced +-contact representations
  Stephane Durocher, Debajyoti Mondal
  Lecture Notes in Computer Science 8242, 2013, pp. 143-154
• Strongly-connected outerplanar graphs with proper touching triangle representations
  J. Joseph Fowler
  Lecture Notes in Computer Science 8242, 2013, pp. 155-160
• Achieving good angular resolution in 3 arc diagrams
  Michael T. Goodrich, Paweƚ Pszona
  Lecture Notes in Computer Science 8242, 2013, pp. 161-172
• A duality transform for constructing small grid embeddings of 3D polytopes
  Alexander Igamberdiev, André Schulz
  Lecture Notes in Computer Science 8242, 2013, pp. 173-184
• Block additivity of \mathbb Z_2-embeddings
  Marcus Schaefer, Daniel S̑tefankovic̑
  Lecture Notes in Computer Science 8242, 2013, pp. 185-195
• Exploiting air-pressure to map floorplans on point sets
  Stefan Felsner
  Lecture Notes in Computer Science 8242, 2013, pp. 196-207
• Superpatterns and universal point sets
  Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
  Lecture Notes in Computer Science 8242, 2013, pp. 208-219
• Simultaneous embedding: Edge orderings, relative positions, cutvertices
  Thomas Bläsius, Annette Karrer, Ignaz Rutter
  Lecture Notes in Computer Science 8242, 2013, pp. 220-231
• Sketched graph drawing: A lesson in empirical studies
  Helen C. Purchase
  Lecture Notes in Computer Science 8242, 2013, pp. 232-243
• Many-to-one boundary labeling with backbones
  Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
  Lecture Notes in Computer Science 8242, 2013, pp. 244-255
• Streamed graph drawing and the file maintenance problem
  Michael T. Goodrich, Paweƚ Pszona
  Lecture Notes in Computer Science 8242, 2013, pp. 256-267
• COAST: A convex optimization approach to stress-based embedding
  Emden R. Gansner, Yifan Hu, Shankar Krishnan
  Lecture Notes in Computer Science 8242, 2013, pp. 268-279
• Colored spanning graphs for set visualization
  Ferran Hurtado, Matias Korman, Marc van Kreveld, Maarten Löffler, Vera Sacristán, Rodrigo I. Silveira, Bettina Speckmann
  Lecture Notes in Computer Science 8242, 2013, pp. 280-291