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

• A fast algorithm for three-dimensional layers of maxima problem
  Yakov Nekrich
  Lecture Notes in Computer Science 6844, 2011, pp. 607-618
• Succinct 2D dictionary matching with no slowdown
  Shoshana Neuburger, Dina Sokol
  Lecture Notes in Computer Science 6844, 2011, pp. 619-630
• PTAS for densest k-subgraph in interval graphs
  Tim Nonner
  Lecture Notes in Computer Science 6844, 2011, pp. 631-641
• Improved distance queries in planar graphs
  Yahav Nussbaum
  Lecture Notes in Computer Science 6844, 2011, pp. 642-653
• Piercing quasi-rectangles: On a problem of Danzer and Rogers
  János Pach, Gábor Tardos
  Lecture Notes in Computer Science 6844, 2011, pp. 654-654
• Faster algorithms for minimum-link paths with restricted orientations
  Valentin Polishchuk, Mikko Sysikaski
  Lecture Notes in Computer Science 6844, 2011, pp. 655-666
• Streaming algorithms for 2-coloring uniform hypergraphs
  Jaikumar Radhakrishnan, Saswata Shannigrahi
  Lecture Notes in Computer Science 6844, 2011, pp. 667-678
• Density-constrained graph clustering
  Robert Görke, Andrea Schumm, Dorothea Wagner
  Lecture Notes in Computer Science 6844, 2011, pp. 679-690
• The MST of symmetric disk graphs (in arbitrary metric spaces) is light
  Shay Solomon
  Lecture Notes in Computer Science 6844, 2011, pp. 691-702
• Theory vs. practice in the design and analysis of algorithms
  Robert E. Tarjan
  Lecture Notes in Computer Science 6844, 2011, pp. 703-703
• A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint
  Zhou Xu, Xiaofan Lai
  Lecture Notes in Computer Science 6844, 2011, pp. 704-715