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: Series=LNCS AND Volume=8871

• Trade-offs in planar polyline drawings
  Stephane Durocher, Debajyoti Mondal
  Lecture Notes in Computer Science 8871, 2014, pp. 306-318
• Stress-minimizing orthogonal layout of data flow diagrams with ports
  Ulf Rüegg, Steve Kieffer, Tim Dwyer, Kim Marriott, Michael Wybrow
  Lecture Notes in Computer Science 8871, 2014, pp. 319-330
• Planar octilinear drawings with one bend per edge
  Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug
  Lecture Notes in Computer Science 8871, 2014, pp. 331-342
• On the complexity of HV-rectilinear planarity testing
  Walter Didimo, Giuseppe Liotta, Maurizio Patrignani
  Lecture Notes in Computer Science 8871, 2014, pp. 343-354
• Embedding four-directional paths on convex point sets
  Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Birgit Vogtenhuber
  Lecture Notes in Computer Science 8871, 2014, pp. 355-366
• Drawing graphs within restricted area
  Maximilian Aulbach, Martin Fink, Julian Schuhmann, Alexander Wolff
  Lecture Notes in Computer Science 8871, 2014, pp. 367-379
• Height-preserving transformations of planar graph drawings
  Therese Biedl
  Lecture Notes in Computer Science 8871, 2014, pp. 380-391
• Drawing planar graphs with reduced height
  Stephane Durocher, Debajyoti Mondal
  Lecture Notes in Computer Science 8871, 2014, pp. 392-403
• Anchored drawings of planar graphs
  Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli
  Lecture Notes in Computer Science 8871, 2014, pp. 404-415
• Advances on testing c-planarity of embedded flat clustered graphs
  Markus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein
  Lecture Notes in Computer Science 8871, 2014, pp. 416-427
• Clustered planarity testing revisited
  Radoslav Fulek, Jan Kync̑l, Igor Malinović, Dömötör Pálvölgyi
  Lecture Notes in Computer Science 8871, 2014, pp. 428-439
• A new perspective on clustered planarity as a combinatorial embedding problem
  Thomas Bläsius, Ignaz Rutter
  Lecture Notes in Computer Science 8871, 2014, pp. 440-451
• MapSets: Visualizing embedded and clustered graphs
  Alon Efrat, Yifan Hu, Stephen G. Kobourov, Sergey Pupyrev
  Lecture Notes in Computer Science 8871, 2014, pp. 452-463
• Increasing-chord graphs on point sets
  Hooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson
  Lecture Notes in Computer Science 8871, 2014, pp. 464-475
• On self-approaching and increasing-chord drawings of 3-connected planar graphs
  Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
  Lecture Notes in Computer Science 8871, 2014, pp. 476-487
• On monotone drawings of trees
  Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff
  Lecture Notes in Computer Science 8871, 2014, pp. 488-500
• Graph drawing contest report
  Carsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter
  Lecture Notes in Computer Science 8871, 2014, pp. 501-506