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

• Computing a minimum-depth planar graph embedding in O(n^4) time
  Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
  Lecture Notes in Computer Science 4619, 2007, pp. 287-299
• On a family of strong geometric spanners that admit local routing strategies
  Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel Smid, Daming Xu
  Lecture Notes in Computer Science 4619, 2007, pp. 300-311
• Spanners for geometric intersection graphs
  Martin Fürer, Shiva Kasiviswanathan
  Lecture Notes in Computer Science 4619, 2007, pp. 312-324
• On generalized diamond spanners
  Prosenjit Bose, Aaron Lee, Michiel Smid
  Lecture Notes in Computer Science 4619, 2007, pp. 325-336
• The k-resource problem on uniform and on uniformly decomposable metric spaces
  Marcin Bienkowski, Jarosƚaw Kutyƚowski
  Lecture Notes in Computer Science 4619, 2007, pp. 337-348
• On the robustness of Graham's algorithm for online scheduling
  Michael Gatto, Peter Widmayer
  Lecture Notes in Computer Science 4619, 2007, pp. 349-361
• Improved results for a memory allocation problem
  Leah Epstein, Rob van Stee
  Lecture Notes in Computer Science 4619, 2007, pp. 362-373
• Computational and structural advantages of circular boundary representation
  Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynȇk S̑ír
  Lecture Notes in Computer Science 4619, 2007, pp. 374-385
• Alpha-beta witness complexes
  Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko
  Lecture Notes in Computer Science 4619, 2007, pp. 386-397
• Cauchy's theorem and edge lengths of convex polyhedra
  Therese Biedl, Anna Lubiw, Michael Spriggs
  Lecture Notes in Computer Science 4619, 2007, pp. 398-409
• Fixed-parameter tractability for non-crossing spanning trees
  Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama
  Lecture Notes in Computer Science 4619, 2007, pp. 410-421
• Improved algorithms for the feedback vertex set problems
  Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
  Lecture Notes in Computer Science 4619, 2007, pp. 422-433
• Kernelization algorithms for d-Hitting Set problems
  Faisal N. Abu-Khzam
  Lecture Notes in Computer Science 4619, 2007, pp. 434-445
• Largest bounding box, smallest diameter, and related problems on imprecise points
  Maarten Löffler, Marc van Kreveld
  Lecture Notes in Computer Science 4619, 2007, pp. 446-457
• Maximizing maximal angles for plane straight-line graphs
  Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
  Lecture Notes in Computer Science 4619, 2007, pp. 458-469
• Cuttings for disks and axis-aligned rectangles
  Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth
  Lecture Notes in Computer Science 4619, 2007, pp. 470-482
• Kernelization and complexity results for connectivity augmentation problems
  Jiong Guo, Johannes Uhlmann
  Lecture Notes in Computer Science 4619, 2007, pp. 483-494
• An improved parameterized algorithm for the minimum node multiway cut problem
  Jianer Chen, Yang Liu, Songjian Lu
  Lecture Notes in Computer Science 4619, 2007, pp. 495-506
• Branch and recharge: Exact algorithms for generalized domination
  Fedor F. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
  Lecture Notes in Computer Science 4619, 2007, pp. 507-518
• On computing the centroid of the vertices of an arrangement and related problems
  Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
  Lecture Notes in Computer Science 4619, 2007, pp. 519-528
• Optimal algorithms for the weighted p-center problems on the real line for small p
  Binay Bhattacharya, Qiaosheng Shi
  Lecture Notes in Computer Science 4619, 2007, pp. 529-540
• Faster approximation of distances in graphs
  Piotr Berman, Shiva Prasad Kasiviswanathan
  Lecture Notes in Computer Science 4619, 2007, pp. 541-552
• Approximate shortest paths guided by a small index
  Jörg Derungs, Riko Jacob, Peter Widmayer
  Lecture Notes in Computer Science 4619, 2007, pp. 553-564
• Initializing sensor networks of non-uniform density in the weak sensor model
  Martín Farach-Colton, Miguel A. Mosteiro
  Lecture Notes in Computer Science 4619, 2007, pp. 565-576
• Computing best coverage path in the presence of obstacles in a sensor field
  Senjuti Basu Roy, Gautam Das, Sajal Das
  Lecture Notes in Computer Science 4619, 2007, pp. 577-588