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=2009

• An algorithm to construct greedy drawings of triangulations
  Patrizio Angelini, Fabrizio Frati, Luca Grilli
  Lecture Notes in Computer Science 5417, 2009, pp. 26-37
• Crossing and weighted crossing number of near-planar graphs
  Sergio Cabello, Bojan Mohar
  Lecture Notes in Computer Science 5417, 2009, pp. 38-49
• Visibility representations of four-connected plane graphs with near optimal heights
  Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
  Lecture Notes in Computer Science 5417, 2009, pp. 67-77
• The topology of bendless three-dimensional orthogonal graph drawing
  David Eppstein
  Lecture Notes in Computer Science 5417, 2009, pp. 78-89
• Computing maximum C-planar subgraphs
  Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel
  Lecture Notes in Computer Science 5417, 2009, pp. 114-120
• Visual analysis of one-to-many matched graphs
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino
  Lecture Notes in Computer Science 5417, 2009, pp. 133-144
• Topological morphing of planar graphs
  Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani
  Lecture Notes in Computer Science 5417, 2009, pp. 145-156
• Graph Simultaneous Embedding Tool, GraphSET
  Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
  Lecture Notes in Computer Science 5417, 2009, pp. 169-180
• Hamiltonian alternating paths on bicolored double-chains
  Josef Cibulka, Jan Kync̑l, Viola Mészáros, Rudolf Stolaȓ, Pavel Valtr
  Lecture Notes in Computer Science 5417, 2009, pp. 181-192
• An experimental study on distance-based graph drawing
  Ulrik Brandes, Christian Pich
  Lecture Notes in Computer Science 5417, 2009, pp. 218-229
• Topology preserving constrained graph layout
  Tim Dwyer, Kim Marriott, Michael Wybrow
  Lecture Notes in Computer Science 5417, 2009, pp. 230-241
• On the hardness of orthogonal-order preserving graph drawing
  Ulrik Brandes, Barbara Pampel
  Lecture Notes in Computer Science 5417, 2009, pp. 266-277
• Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability
  Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
  Lecture Notes in Computer Science 5417, 2009, pp. 324-335
• Two polynomial time algorithms for the metro-line crossing minimization problem
  Evmorfia Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
  Lecture Notes in Computer Science 5417, 2009, pp. 336-347
• Cyclic leveling of directed graphs
  Christian Bachmaier, Franz Brandenburg, Wolfgang Brunner, Gergö Lovász
  Lecture Notes in Computer Science 5417, 2009, pp. 348-359
• Constrained point-set embeddability of planar graphs
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
  Lecture Notes in Computer Science 5417, 2009, pp. 360-371
• Tree drawings on the hexagonal grid
  Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried
  Lecture Notes in Computer Science 5417, 2009, pp. 372-383
• Isometric diamond subgraphs
  David Eppstein
  Lecture Notes in Computer Science 5417, 2009, pp. 384-389
• Non-convex representations of graphs
  Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
  Lecture Notes in Computer Science 5417, 2009, pp. 390-395
• Dunnart: A constraint-based network diagram authoring tool
  Tim Dwyer, Kim Marriott, Michael Wybrow
  Lecture Notes in Computer Science 5417, 2009, pp. 420-431
• Approximating the crossing number of apex graphs
  Markus Chimani, Petr Hlinȇný, Petra Mutzel
  Lecture Notes in Computer Science 5417, 2009, pp. 432-434
• Policy-aware visualization of Internet dynamics
  Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso
  Lecture Notes in Computer Science 5417, 2009, pp. 435-436
• Enhancing visualizations of business processes
  Philip Effinger, Michael Kaufmann, Martin Siebenhaller
  Lecture Notes in Computer Science 5417, 2009, pp. 437-438
• A robust biclustering method based on crossing minimization in bipartite graphs
  Cesim Erten, Melih Sözdinler
  Lecture Notes in Computer Science 5417, 2009, pp. 439-440
• Graph Drawing Contest report
  Ugur Dogrusoz, Christian A. Duncan, Carsten Gutwenger, Georg Sander
  Lecture Notes in Computer Science 5417, 2009, pp. 453-458