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 YEAR=2002

• Casting a polyhedron with directional uncertainty
  Hee-Kap Ahn, Otfried Cheong, René van Oostrum
  Lecture Notes in Computer Science 2518, 2002, pp. 274-285
• Hierarchy of surface models and irreducible triangulation
  Siu-Wing Cheng, Tamal K. Dey, Sheung-Hung Poon
  Lecture Notes in Computer Science 2518, 2002, pp. 286-295
• Optimal F-reliable protocols for the do-all problem on single-hop wireless networks
  Andrea E.F. Clementi, Angelo Monti, Riccardo Silvestri
  Lecture Notes in Computer Science 2518, 2002, pp. 320-331
• New results for energy-efficient broadcasting in wireless networks
  Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
  Lecture Notes in Computer Science 2518, 2002, pp. 332-343
• Flat-state connectivity of linkages under dihedral motions
  Greg Aloupis, Erik D. Demaine, Vida Dujmović, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark Overmars, Michael Soss, Ileana Streinu, Godfried T. Toussaint
  Lecture Notes in Computer Science 2518, 2002, pp. 369-380
• Scheduling of independent dedicated multiprocessor tasks
  Evripidis Bampis, Massimiliano Caramia, Jiȓí Fiala, Aleksei V. Fishkin, Antonio Iovanella
  Lecture Notes in Computer Science 2518, 2002, pp. 391-402
• Bounded-degree independent sets in planar graphs
  Therese Biedl, Dana F. Wilkinson
  Lecture Notes in Computer Science 2518, 2002, pp. 416-427
• Approximation algorithms for some parameterized counting problems
  V. Arvind, Venkatesh Raman
  Lecture Notes in Computer Science 2518, 2002, pp. 453-464
• Approximating MIN k-SAT
  Adi Avidor, Uri Zwick
  Lecture Notes in Computer Science 2518, 2002, pp. 465-475
• On the clique problem in intersection graphs of ellipses
  Christoph Ambühl, Uli Wagner
  Lecture Notes in Computer Science 2518, 2002, pp. 489-500
• Improved distance oracles for avoiding link-failure
  Rezaul Alam Chowdhury, Vijaya Ramachandran
  Lecture Notes in Computer Science 2518, 2002, pp. 523-534
• Crossing minimization for symmetries
  Christoph Buchheim, Seok-Hee Hong
  Lecture Notes in Computer Science 2518, 2002, pp. 563-574
• Maximizing a Voronoi region: The convex case
  Frank Dehne, Rolf Klein, Raimund Seidel
  Lecture Notes in Computer Science 2518, 2002, pp. 624-634
• Random tries
  Luc Devroye
  Lecture Notes in Computer Science 2518, 2002, pp. 635-635
• Strictness of the modal \mu-calculus hierarchy
  Luca Alberucci
  Lecture Notes in Computer Science 2500, 2002, pp. 185-203
• The monadic theory of tree-like structures
  Dietmar Berwanger, Achim Blumensath
  Lecture Notes in Computer Science 2500, 2002, pp. 285-301
• Two-way tree automata solving pushdown games
  Thierry Cachat
  Lecture Notes in Computer Science 2500, 2002, pp. 303-317
• Aautomata for guarded fixed point logics
  Dietmar Berwanger, Achim Blumensath
  Lecture Notes in Computer Science 2500, 2002, pp. 343-355
• 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
• 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