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

• Generalizing the shift method for rectangular shaped vertices with visibility constraints
  Seok-Hee Hong, Martin Mader
  Lecture Notes in Computer Science 5417, 2009, pp. 278-283
• Placing text boxes on graphs: A fast approximation algorithm for maximizing overlap of a square and a simple polygon
  Sjoerd van Hagen, Marc van Kreveld
  Lecture Notes in Computer Science 5417, 2009, pp. 284-295
• Removing node overlaps using multi-sphere scheme
  Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi
  Lecture Notes in Computer Science 5417, 2009, pp. 296-301
• Minimal obstructions for 1-immersions and hardness of 1-planarity testing
  Vladimir P. Korzhik, Bojan Mohar
  Lecture Notes in Computer Science 5417, 2009, pp. 302-312
• Connected rectilinear graphs on point sets
  Maarten Löffler, Elena Mumford
  Lecture Notes in Computer Science 5417, 2009, pp. 313-318
• 3-regular non 3-edge-colorable graphs with polyhedral embeddings in orientable surfaces
  Martin Kochol
  Lecture Notes in Computer Science 5417, 2009, pp. 319-323
• 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
• Subdivision drawings of hypergraphs
  Michael Kaufmann, Marc van Kreveld, Bettina Speckmann
  Lecture Notes in Computer Science 5417, 2009, pp. 396-407
• Minimum segment drawings of series-parallel graphs with the maximum degree three
  Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman
  Lecture Notes in Computer Science 5417, 2009, pp. 408-419
• 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
• Visualizing the results of metabolic pathway queries
  Allison P. Heath, George N. Bennett, Lydia E. Kavraki
  Lecture Notes in Computer Science 5417, 2009, pp. 441-442
• Visual specification of layout
  Sonja Maier, Steffen Mazanek, Mark Minas
  Lecture Notes in Computer Science 5417, 2009, pp. 443-444
• Spine crossing minimization in upward topological book embeddings
  Tamara Mchedlidze, Antonios Symvonis
  Lecture Notes in Computer Science 5417, 2009, pp. 445-446
• ILOG Elixir
  Georg Sander, The ILOG Elixir team
  Lecture Notes in Computer Science 5417, 2009, pp. 447-448
• DAGmap view
  Vassilis Tsiaras, Ioannis G. Tollis
  Lecture Notes in Computer Science 5417, 2009, pp. 449-450