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

• On rectilinear partitions with minimum stabbing number
  Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele
  Lecture Notes in Computer Science 6844, 2011, pp. 302-313
• Flattening fixed-angle chains is strongly NP-hard
  Erik D. Demaine, Sarah Eisenstat
  Lecture Notes in Computer Science 6844, 2011, pp. 314-325
• An O(n\log n) algorithm for a load balancing problem on paths
  Nikhil R. Devanur, Uriel Feige
  Lecture Notes in Computer Science 6844, 2011, pp. 326-337
• Fully-dynamic hierarchical graph clustering using cut trees
  Christof Doll, Tanja Hartmann, Dorothea Wagner
  Lecture Notes in Computer Science 6844, 2011, pp. 338-349
• Flow computations on imprecise terrains
  Anne Driemel, Herman Haverkort, Maarten Löffler, Rodrigo I. Silveira
  Lecture Notes in Computer Science 6844, 2011, pp. 350-361
• Tracking moving objects with few handovers
  David Eppstein, Michael T. Goodrich, Maarten Löffler
  Lecture Notes in Computer Science 6844, 2011, pp. 362-373
• Inducing the LCP-array
  Johannes Fischer
  Lecture Notes in Computer Science 6844, 2011, pp. 374-385
• Horoball hulls and extents in positive definite space
  P. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian
  Lecture Notes in Computer Science 6844, 2011, pp. 386-398
• Enumerating minimal subset feedback vertex sets
  Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
  Lecture Notes in Computer Science 6844, 2011, pp. 399-410
• Upper bounds for maximally greedy binary search trees
  Kyle Fox
  Lecture Notes in Computer Science 6844, 2011, pp. 411-422
• On the matter of dynamic optimality in an extended model for tree access operations
  Michael L. Fredman
  Lecture Notes in Computer Science 6844, 2011, pp. 423-437
• Resilient and low stretch routing through embedding into tree metrics
  Jie Gao, Dengpan Zhou
  Lecture Notes in Computer Science 6844, 2011, pp. 438-450
• Consistent labeling of rotating maps
  Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
  Lecture Notes in Computer Science 6844, 2011, pp. 451-462
• Finding longest approximate periodic patterns
  Beat Gfeller
  Lecture Notes in Computer Science 6844, 2011, pp. 463-474
• A (5/3+\epsilon)-approximation for strip packing
  Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
  Lecture Notes in Computer Science 6844, 2011, pp. 475-487
• Reversing longest previous factor tables is hard
  Jing He, Hongyu Liang, Guang Yang
  Lecture Notes in Computer Science 6844, 2011, pp. 488-499
• Space efficient data structures for dynamic orthogonal range counting
  Meng He, J. Ian Munro
  Lecture Notes in Computer Science 6844, 2011, pp. 500-511
• Searching in dynamic tree-like partial orders
  Brent Heeringa, Marius Cȃtȃlin Iordan, Louis Theran
  Lecture Notes in Computer Science 6844, 2011, pp. 512-523
• Counting plane graphs: Flippability and its applications
  Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
  Lecture Notes in Computer Science 6844, 2011, pp. 524-535
• Geometric computations on indecisive points
  Allan Jrgensen, Maarten Löffler, Jeff M. Phillips
  Lecture Notes in Computer Science 6844, 2011, pp. 536-547
• Closest pair and the post office problem for stochastic points
  Pegah Kamousi, Timothy M. Chan, Subhash Suri
  Lecture Notes in Computer Science 6844, 2011, pp. 548-559
• Competitive search in symmetric trees
  David Kirkpatrick, Sandra Zilles
  Lecture Notes in Computer Science 6844, 2011, pp. 560-570
• Multiple-source single-sink maximum flow in directed planar graphs in O(\mbox{diameter}\cdot n \log n) time
  Philip N. Klein, Shay Mozes
  Lecture Notes in Computer Science 6844, 2011, pp. 571-582
• Planar subgraphs without low-degree nodes
  Evangelos Kranakis, Oscar Morales Ponce, Jukka Suomela
  Lecture Notes in Computer Science 6844, 2011, pp. 583-594
• Constructing orthogonal de Bruijn sequences
  Yaw-Ling Lin, Charles Ward, Bharat Jain, Steven Skiena
  Lecture Notes in Computer Science 6844, 2011, pp. 595-606