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 [1]	Hilfe

Suche: Series=LNCS AND YEAR=2013

• Disconnectivity and relative positions in simultaneous embeddings
  Thomas Bläsius, Ignaz Rutter
  Lecture Notes in Computer Science 7704, 2013, pp. 31-42
• Progress on partial edge drawings
  Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
  Lecture Notes in Computer Science 7704, 2013, pp. 67-78
• Implementing a partitioned 2-page book embedding testing algorithm
  Patrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista
  Lecture Notes in Computer Science 7704, 2013, pp. 79-89
• Shrinking the search space for clustered planarity
  Markus Chimani, Karsten Klein
  Lecture Notes in Computer Science 7704, 2013, pp. 90-101
• Open rectangle-of-influence drawings of non-triangulated planar graphs
  Soroush Alamdari, Therese Biedl
  Lecture Notes in Computer Science 7704, 2013, pp. 102-113
• The approximate rectangle of influence drawability problem
  Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer
  Lecture Notes in Computer Science 7704, 2013, pp. 114-125
• Circle-representations of simple 4-regular planar graphs
  Michael A. Bekos, Chrysanthi N. Raftopoulou
  Lecture Notes in Computer Science 7704, 2013, pp. 138-149
• Smooth orthogonal layouts
  Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis
  Lecture Notes in Computer Science 7704, 2013, pp. 150-161
• Planar graphs as VPG-graphs
  Steven Chaplick, Torsten Ueckerdt
  Lecture Notes in Computer Science 7704, 2013, pp. 174-186
• On representing graphs by touching cuboids
  David Bremner, William Evans, Fabrizio Frati, Laurie Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue H. Whitesides
  Lecture Notes in Computer Science 7704, 2013, pp. 187-198
• Proportional contact representations of 4-connected planar graphs
  Md. Jawaherul Alam, Stephen G. Kobourov
  Lecture Notes in Computer Science 7704, 2013, pp. 211-223
• Column-based graph layouts
  Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner
  Lecture Notes in Computer Science 7704, 2013, pp. 236-247
• Upward planarity testing via SAT
  Markus Chimani, Robert Zeranski
  Lecture Notes in Computer Science 7704, 2013, pp. 248-259
• Self-approaching graphs
  Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak
  Lecture Notes in Computer Science 7704, 2013, pp. 260-271
• Grid drawings and the chromatic number
  Martin Balko
  Lecture Notes in Computer Science 7704, 2013, pp. 315-326
• On the density of maximal 1-planar graphs
  Franz J. Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber
  Lecture Notes in Computer Science 7704, 2013, pp. 327-338
• Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings
  Luca Castelli Aleardi, Olivier Devillers, Éric Fusy
  Lecture Notes in Computer Science 7704, 2013, pp. 376-387
• Force-directed graph drawing using social gravity and scaling
  Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott
  Lecture Notes in Computer Science 7704, 2013, pp. 414-425
• Mental map preservation helps user orientation in dynamic graphs
  Daniel Archambault, Helen C. Purchase
  Lecture Notes in Computer Science 7704, 2013, pp. 475-486
• Time-space maps from triangulations
  Sandra Bies, Marc van Kreveld
  Lecture Notes in Computer Science 7704, 2013, pp. 511-516
• Optical graph recognition
  Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber
  Lecture Notes in Computer Science 7704, 2013, pp. 529-540
• Interactive random graph generation with evolutionary algorithms
  Benjamin Bach, Andre Spritzer, Evelyne Lutton, Jean-Daniel Fekete
  Lecture Notes in Computer Science 7704, 2013, pp. 541-552
• Visualizing large hierarchically clustered graphs with a landscape metaphor
  Jan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg
  Lecture Notes in Computer Science 7704, 2013, pp. 553-554
• On sparse maximal 2-planar graphs
  Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
  Lecture Notes in Computer Science 7704, 2013, pp. 555-556
• Testing planarity by switching trains
  Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter
  Lecture Notes in Computer Science 7704, 2013, pp. 557-558