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: Booktitle=Proceedings of the 22nd International Symposium on Graph Drawing, GD'2014 (W{\"u}rzburg, Germany, September 24-26, 2014)

• Planar induced subgraphs of sparse graphs
  Glencora Borradaile, David Eppstein, Pingan Zhu
  Lecture Notes in Computer Science 8871, 2014, pp. 1-12
• Picking planar edges; or, drawing a graph with a planar subgraph
  Marcus Schaefer
  Lecture Notes in Computer Science 8871, 2014, pp. 13-24
• Drawing partially embedded and simultaneously planar graphs
  Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer
  Lecture Notes in Computer Science 8871, 2014, pp. 25-39
• Drawing simultaneously embedded graphs with few bends
  Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
  Lecture Notes in Computer Science 8871, 2014, pp. 40-51
• Planar and quasi planar simultaneous geometric embedding
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
  Lecture Notes in Computer Science 8871, 2014, pp. 52-63
• Simultaneous embeddability of two partitions
  Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg
  Lecture Notes in Computer Science 8871, 2014, pp. 64-75
• Luatodonotes: Boundary labeling for annotations in texts
  Philipp Kindermann, Fabian Lipp, Alexander Wolff
  Lecture Notes in Computer Science 8871, 2014, pp. 76-88
• A coloring algorithm for disambiguating graph and map drawings
  Yifan Hu, Lei Shi
  Lecture Notes in Computer Science 8871, 2014, pp. 89-100
• Untangling hairballs: From 3 to 14 degrees of separation
  Arlind Nocaj, Mark Ortmann, Ulrik Brandes
  Lecture Notes in Computer Science 8871, 2014, pp. 101-112
• GION: Interactively untangling large graphs on wall-sized displays
  Michael R. Marner, Ross T. Smith, Bruce H. Thomas, Karsten Klein, Peter Eades, Seok-Hee Hong
  Lecture Notes in Computer Science 8871, 2014, pp. 113-124
• Balanced circle packings for planar graphs
  Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev
  Lecture Notes in Computer Science 8871, 2014, pp. 125-136
• Unit contact representations of grid subgraphs with regular polytopes in 2D and 3D
  Linda Kleist, Benjamin Rahman
  Lecture Notes in Computer Science 8871, 2014, pp. 137-148
• The Galois complexity of graph drawing: Why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
  Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
  Lecture Notes in Computer Science 8871, 2014, pp. 149-161
• Bitonic st-orderings of biconnected planar graphs
  Martin Gronemann
  Lecture Notes in Computer Science 8871, 2014, pp. 162-173
• Drawing outer 1-planar graphs with few slopes
  Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
  Lecture Notes in Computer Science 8871, 2014, pp. 174-185
• Fan-planar graphs: Combinatorial properties and complexity results
  Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
  Lecture Notes in Computer Science 8871, 2014, pp. 186-197
• On the recognition of fan-planar and maximal outer-fan-planar graphs
  Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann
  Lecture Notes in Computer Science 8871, 2014, pp. 198-209
• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
  Michael J. Bannister, David Eppstein
  Lecture Notes in Computer Science 8871, 2014, pp. 210-221
• A crossing lemma for the pair-crossing number
  Eyal Ackerman, Marcus Schaefer
  Lecture Notes in Computer Science 8871, 2014, pp. 222-233
• Are crossings important for drawing large graphs?
  Stephen G. Kobourov, Sergey Pupyrev, Bahador Saket
  Lecture Notes in Computer Science 8871, 2014, pp. 234-245
• The importance of being proper (in clustered-level planarity and T-level planarity)
  Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli
  Lecture Notes in Computer Science 8871, 2014, pp. 246-258
• Column planarity and partial simultaneous geometric embedding
  William Evans, Vincent Kusters, Maria Saumell, Bettina Speckmann
  Lecture Notes in Computer Science 8871, 2014, pp. 259-271
• Flat foldings of plane graphs with prescribed angles and edge lengths
  Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
  Lecture Notes in Computer Science 8871, 2014, pp. 272-283
• Disjoint edges in topological graphs and the tangled-thrackle conjecture
  Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth
  Lecture Notes in Computer Science 8871, 2014, pp. 284-293
• Morphing Schnyder drawings of planar triangulations
  Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw
  Lecture Notes in Computer Science 8871, 2014, pp. 294-305