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 Volume=7704

• Flips
  Prosenjit Bose
  Lecture Notes in Computer Science 7704, 2013, pp. 1-1
• Interactive network exploration to derive insights: Filtering, clustering, grouping, and simplification
  Ben Shneiderman, Cody Dunne
  Lecture Notes in Computer Science 7704, 2013, pp. 2-18
• Counting plane graphs: Cross-graph charging schemes
  Micha Sharir, Adam Sheffer
  Lecture Notes in Computer Science 7704, 2013, pp. 19-30
• Disconnectivity and relative positions in simultaneous embeddings
  Thomas Bläsius, Ignaz Rutter
  Lecture Notes in Computer Science 7704, 2013, pp. 31-42
• Graph drawing in the cloud: Privately visualizing relational data using small working storage
  Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia
  Lecture Notes in Computer Science 7704, 2013, pp. 43-54
• Graph drawing by classical multidimensional scaling: New perspectives
  Mirza Klimenta, Ulrik Brandes
  Lecture Notes in Computer Science 7704, 2013, pp. 55-66
• 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
• Planar Lombardi drawings for subcubic graphs
  David Eppstein
  Lecture Notes in Computer Science 7704, 2013, pp. 126-137
• 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
• Toward a theory of planarity: Hanani-Tutte and planarity variants
  Marcus Schaefer
  Lecture Notes in Computer Science 7704, 2013, pp. 162-173
• 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
• Touching triangle representations for 3-connected planar graphs
  Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat
  Lecture Notes in Computer Science 7704, 2013, pp. 199-210
• Proportional contact representations of 4-connected planar graphs
  Md. Jawaherul Alam, Stephen G. Kobourov
  Lecture Notes in Computer Science 7704, 2013, pp. 211-223
• Edge-weighted contact representations of planar graphs
  Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
  Lecture Notes in Computer Science 7704, 2013, pp. 224-235
• 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
• Homotopic \mathcal{C}-oriented routing
  Kevin Verbeek
  Lecture Notes in Computer Science 7704, 2013, pp. 272-278
• Kinetic and stationary point-set embeddability for plane graphs
  Zahed Rahmati, Sue H. Whitesides, Valerie King
  Lecture Notes in Computer Science 7704, 2013, pp. 279-290