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 [3]	Hilfe

Suche: Series=LNCS AND YEAR=2009

• Straight-line rectangular drawings of clustered graphs
  Patrizio Angelini, Fabrizio Frati, Michael Kaufmann
  Lecture Notes in Computer Science 5664, 2009, pp. 25-36
• Online priority Steiner tree problems
  Spyros Angelopoulos
  Lecture Notes in Computer Science 5664, 2009, pp. 37-48
• Connect the dot: Computing feed-links with minimum dilation
  Boris Aronov, Kevin Buchin, Maike Buchin, Marc van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann
  Lecture Notes in Computer Science 5664, 2009, pp. 49-60
• Minimal locked trees
  Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon
  Lecture Notes in Computer Science 5664, 2009, pp. 61-73
• Approximating transitive reductions for directed networks
  Piotr Berman, Bhaskar DasGupta, Marek Karpinski
  Lecture Notes in Computer Science 5664, 2009, pp. 74-85
• 1.25-approximation algorithm for Steiner tree problem with distances 1 and 2
  Piotr Berman, Marek Karpinski, Alexander Zelikovsky
  Lecture Notes in Computer Science 5664, 2009, pp. 86-97
• Succinct orthogonal range search structures on a grid with applications to text indexing
  Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
  Lecture Notes in Computer Science 5664, 2009, pp. 98-109
• A distribution-sensitive dictionary with low space overhead
  Prosenjit Bose, John Howat, Pat Morin
  Lecture Notes in Computer Science 5664, 2009, pp. 110-118
• A comparison of performance measures for online algorithms
  Joan Boyar, Sandy Irani, Kim S. Larsen
  Lecture Notes in Computer Science 5664, 2009, pp. 119-130
• Delaunay triangulation of imprecise points simplified and extended
  Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer
  Lecture Notes in Computer Science 5664, 2009, pp. 131-143
• An improved SAT algorithm in terms of formula length
  Jianer Chen, Yang Liu
  Lecture Notes in Computer Science 5664, 2009, pp. 144-155
• Shortest path problems on a polyhedral surface
  Atlas F. Cook IV, Carola Wenk
  Lecture Notes in Computer Science 5664, 2009, pp. 156-167
• Approximation algorithms for buy-at-bulk geometric network design
  Artur Czumaj, Jurek Czyzowicz, Leszek Ga̧sieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
  Lecture Notes in Computer Science 5664, 2009, pp. 168-180
• Rank-sensitive priority queues
  Brian C. Dean, Zachary H. Jones
  Lecture Notes in Computer Science 5664, 2009, pp. 181-192
• Algorithms meet art, puzzles, and magic
  Erik D. Demaine
  Lecture Notes in Computer Science 5664, 2009, pp. 193-193
• Skip-splay: Toward achieving the unified bound in the BST model
  Jonathan C. Derryberry, Daniel D. Sleator
  Lecture Notes in Computer Science 5664, 2009, pp. 194-205
• Drawing graphs with right angle crossings
  Walter Didimo, Peter Eades, Giuseppe Liotta
  Lecture Notes in Computer Science 5664, 2009, pp. 206-217
• Finding a Hausdorff core of a polygon: On convex polygon containment with bounded Hausdorff distance
  Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, Munro, J. Ian, Alejandro Salinger, Matthew Skala
  Lecture Notes in Computer Science 5664, 2009, pp. 218-229
• Efficient construction of near-optimal binary and multiway search trees
  Prosenjit Bose, Karim Douïeb
  Lecture Notes in Computer Science 5664, 2009, pp. 230-241
• On the approximability of geometric and geographic generalization and the min-max bin covering problem
  Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker
  Lecture Notes in Computer Science 5664, 2009, pp. 242-253
• On reconfiguration of disks in the plane and related problems
  Adrian Dumitrescu, Minghui Jiang
  Lecture Notes in Computer Science 5664, 2009, pp. 254-265
• Orientation-constrained rectangular layouts
  David Eppstein, Elena Mumford
  Lecture Notes in Computer Science 5664, 2009, pp. 266-277
• The h-index of a graph and its application to dynamic subgraph statistics
  David Eppstein, Emma S. Spiro
  Lecture Notes in Computer Science 5664, 2009, pp. 278-289
• Optimal embedding into star metrics
  David Eppstein, Kevin A. Wortman
  Lecture Notes in Computer Science 5664, 2009, pp. 290-301
• Online square packing
  Sándor P. Fekete, Tom Kamphans, Nils Schweer
  Lecture Notes in Computer Science 5664, 2009, pp. 302-314