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

• Dot product representations of planar graphs
  Ross J. Kang, Tobias Müller
  Lecture Notes in Computer Science 6502, 2011, pp. 287-292
• Drawing planar graphs of bounded degree with few slopes
  Balázs Keszegh, János Pach, Dömötör Pálvölgyi
  Lecture Notes in Computer Science 6502, 2011, pp. 293-304
• Complexity of finding non-planar rectilinear drawings of graphs
  Ján Man̑uch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk
  Lecture Notes in Computer Science 6502, 2011, pp. 305-316
• Point-set embeddings of plane 3-tree
  Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman
  Lecture Notes in Computer Science 6502, 2011, pp. 317-328
• Improving layered graph layouts with edge bundling
  Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann
  Lecture Notes in Computer Science 6502, 2011, pp. 329-340
• Confluent drawing algorithms using rectangular dualization
  Gianluca Quercini, Massimo Ancona
  Lecture Notes in Computer Science 6502, 2011, pp. 341-352
• How to draw a Tait-colorable graph
  David A. Richter
  Lecture Notes in Computer Science 6502, 2011, pp. 353-364
• Universal pointsets for 2-coloured trees
  Mereke van Garderen, Giuseppe Liotta, Henk Meijer
  Lecture Notes in Computer Science 6502, 2011, pp. 365-370
• The quality ratio of RAC drawings and planar drawings of planar graphs
  Marc van Kreveld
  Lecture Notes in Computer Science 6502, 2011, pp. 371-376
• Convex polygon intersection graphs
  Erik Jan van Leeuwen, Jan van Leeuwen
  Lecture Notes in Computer Science 6502, 2011, pp. 377-388
• GraphML-based exploration and evaluation of efficient parallelization alternatives for automation firmware
  Jürgen Bregenzer
  Lecture Notes in Computer Science 6502, 2011, pp. 389-390
• Automatic generation of route sketches
  Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
  Lecture Notes in Computer Science 6502, 2011, pp. 391-392
• Visualizing differences between two large graphs
  Markus Geyer, Michael Kaufmann, Robert Krug
  Lecture Notes in Computer Science 6502, 2011, pp. 393-394
• Placing edge labels by modifying an orthogonal graph drawing
  Konstantinos G. Kakoulis, Ioannis G. Tollis
  Lecture Notes in Computer Science 6502, 2011, pp. 395-396
• Large crossing angles in circular layouts
  Quan Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang
  Lecture Notes in Computer Science 6502, 2011, pp. 397-399
• GVSR: An on-line guide for choosing a graph visualization software
  Bruno Pinaud, Pascale Kuntz
  Lecture Notes in Computer Science 6502, 2011, pp. 400-401
• IBM ILOG multi-platform graph layout technology
  Georg Sander
  Lecture Notes in Computer Science 6502, 2011, pp. 402-403
• Comparative visualization of user flows in voice portals
  Björn Zimmer, Dennie Ackermann, Manfred Schröder, Andreas Kerren, Volker Ahlers
  Lecture Notes in Computer Science 6502, 2011, pp. 404-405
• Graph drawing contest report
  Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander
  Lecture Notes in Computer Science 6502, 2011, pp. 406-411