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

• Solving Traveling Salesman Problems
  William Cook
  Lecture Notes in Computer Science 2461, 2002, pp. 1-1
• Computing shapes from point cloud data
  Tamal K. Dey
  Lecture Notes in Computer Science 2461, 2002, pp. 2-2
• Mechanism design for fun and profit
  Anna R. Krlin
  Lecture Notes in Computer Science 2461, 2002, pp. 3-3
• On distance oracles and routing in graphs
  Mikkel Thorup
  Lecture Notes in Computer Science 2461, 2002, pp. 4-4
• Kinetic medians and kd-trees
  Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas
  Lecture Notes in Computer Science 2461, 2002, pp. 5-16
• Range searching in categorical data: Colored range searching on grid
  Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan
  Lecture Notes in Computer Science 2461, 2002, pp. 17-28
• Near-linear time approximation algorithms for curve simplification
  Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
  Lecture Notes in Computer Science 2461, 2002, pp. 29-41
• Translating a planar object to maximize point containment
  Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel Smid, Emo Welzl
  Lecture Notes in Computer Science 2461, 2002, pp. 42-53
• Approximation algorithms for k-line center
  Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
  Lecture Notes in Computer Science 2461, 2002, pp. 54-63
• New heuristics and lower bounds for the Min-Max k-Chinese Postman Problem
  Dino Ahr, Gerhard Reinelt
  Lecture Notes in Computer Science 2461, 2002, pp. 64-74
• SCIL - Symbolic constraints in integer linear programming
  Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
  Lecture Notes in Computer Science 2461, 2002, pp. 75-87
• Implementing I/O-efficient data structures using TPIE
  Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 2461, 2002, pp. 88-100
• On the k-splittable flow problem
  Georg Baier, Ekkehard Köhler, Martin Skutella
  Lecture Notes in Computer Science 2461, 2002, pp. 101-113
• Partial alphabetic trees
  Arye Barkan, Haim Kaplan
  Lecture Notes in Computer Science 2461, 2002, pp. 114-125
• Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router
  Chris Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, Madhav Marathe
  Lecture Notes in Computer Science 2461, 2002, pp. 126-138
• Scanning and traversing: Maintaining data for traversals in a memory hierarchy
  Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
  Lecture Notes in Computer Science 2461, 2002, pp. 139-151
• Two simplified algorithms for maintaining order in a list
  Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
  Lecture Notes in Computer Science 2461, 2002, pp. 152-164
• Efficient tree layout in a multilevel memory hierarchy
  Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
  Lecture Notes in Computer Science 2461, 2002, pp. 165-173
• A computational basis for conic arcs and Boolean operations on conic polygons
  Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Kurt Mehlhorn, Elmar Schömer
  Lecture Notes in Computer Science 2461, 2002, pp. 174-186
• TSP with neighborhoods of varying size
  Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
  Lecture Notes in Computer Science 2461, 2002, pp. 187-199
• 1.375-approximation algorithm for sorting by reversals
  Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
  Lecture Notes in Computer Science 2461, 2002, pp. 200-210
• Radio labeling with pre-assigned frequencies
  Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2461, 2002, pp. 211-222
• Branch-and-bound algorithms for the test cover problem
  Koen M.J. De Bontridder, B.J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie
  Lecture Notes in Computer Science 2461, 2002, pp. 223-233
• Constructing plane spanners of bounded degree and low weight
  Prosenjit Bose, Joachim Gudmundsson, Michiel Smid
  Lecture Notes in Computer Science 2461, 2002, pp. 234-246
• Eager st-ordering
  Ulrik Brandes
  Lecture Notes in Computer Science 2461, 2002, pp. 247-256