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

• Flexible path planning using corridor maps
  Mark Overmars, Ioannis Karamouzas, Roland Geraerts
  Lecture Notes in Computer Science 5193, 2008, pp. 1-12
• A bridging model for multi-core computing
  Leslie G. Valiant
  Lecture Notes in Computer Science 5193, 2008, pp. 13-28
• Robust kinetic convex hulls in 3D
  Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkog̑lu
  Lecture Notes in Computer Science 5193, 2008, pp. 29-40
• On dominance reporting in 3D
  Peyman Afshani
  Lecture Notes in Computer Science 5193, 2008, pp. 41-51
• Stabbing convex polygons with a segment or a polygon
  Pankaj K. Agarwal, Danny Z. Chen, Shashidhara Ganjugunte, Ewa Misioƚek, Micha Sharir, Kai Tang
  Lecture Notes in Computer Science 5193, 2008, pp. 52-63
• An efficient algorithm for 2D Euclidean 2-center with outliers
  Pankaj K. Agarwal, Jeff M. Phillips
  Lecture Notes in Computer Science 5193, 2008, pp. 64-75
• A near-tight bound for the online Steiner tree problem in graphs of bounded asymmetry
  Spyros Angelopoulos
  Lecture Notes in Computer Science 5193, 2008, pp. 76-87
• Cache-oblivious red-blue line segment intersection
  Lars Arge, Thomas Mlhave, Norbert Zeh
  Lecture Notes in Computer Science 5193, 2008, pp. 88-99
• The complexity of bisectors and Voronoi diagrams on realistic terrains
  Boris Aronov, Mark de Berg, Shripad Thite
  Lecture Notes in Computer Science 5193, 2008, pp. 100-111
• Space-time tradeoffs for proximity searching in doubling spaces
  Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia
  Lecture Notes in Computer Science 5193, 2008, pp. 112-123
• A scaling algorithm for the maximum node-capacitated multiflow problem
  Maxim A. Babenko, Alexander V. Karzanov
  Lecture Notes in Computer Science 5193, 2008, pp. 124-135
• Linear time planarity testing and embedding of strongly connected cyclic level graphs
  Christian Bachmaier, Wolfgang Brunner
  Lecture Notes in Computer Science 5193, 2008, pp. 136-147
• Straight skeletons of three-dimensional polyhedra
  Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman
  Lecture Notes in Computer Science 5193, 2008, pp. 148-160
• Randomized competitive analysis for two-server problems
  Wolfgang Bein, Kazuo Iwama, Jun Kawahara
  Lecture Notes in Computer Science 5193, 2008, pp. 161-172
• Decompositions and boundary coverings of non-convex fat polyhedra
  Mark de Berg, Chris Gray
  Lecture Notes in Computer Science 5193, 2008, pp. 173-184
• Approximating multi-criteria MAX-TSP
  Markus Bläser, Bodo Manthey, Oliver Putz
  Lecture Notes in Computer Science 5193, 2008, pp. 185-197
• An integer programming algorithm for routing optimization in IP networks
  Andreas Bley
  Lecture Notes in Computer Science 5193, 2008, pp. 198-209
• A constant-approximate feasibility test for multiprocessor real-time scheduling
  Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller
  Lecture Notes in Computer Science 5193, 2008, pp. 210-221
• Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
  Paul Bonsma, Frederic Dorn
  Lecture Notes in Computer Science 5193, 2008, pp. 222-233
• Engineering tree labeling schemes: A case study on least common ancestors
  Saverio Caminiti, Irene Finocchi, Rossella Petreschi
  Lecture Notes in Computer Science 5193, 2008, pp. 234-245
• A practical Quicksort algorithm for graphics processors
  Daniel Cederman, Philippas Tsigas
  Lecture Notes in Computer Science 5193, 2008, pp. 246-258
• Bloomier filters: A second look
  Denis Charles, Kumar Chellapilla
  Lecture Notes in Computer Science 5193, 2008, pp. 259-270
• Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy
  Danny Z. Chen, Shuang Luan, Chao Wang
  Lecture Notes in Computer Science 5193, 2008, pp. 271-283
• A new approach to exact crossing minimization
  Markus Chimani, Petra Mutzel, Immanuel Bomze
  Lecture Notes in Computer Science 5193, 2008, pp. 284-296
• A characterization of 2-player mechanisms for scheduling
  George Christodoulou, Elias Koutsoupias, Angelina Vidali
  Lecture Notes in Computer Science 5193, 2008, pp. 297-307