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

• The randomized coloring procedure with symmetry-breaking
  Sriram Pemmaraju, Aravind Srinivasan
  Lecture Notes in Computer Science 5125, 2008, pp. 306-319
• The local nature of list colorings for graphs of high girth
  Flavio Chierichetti, Andrea Vattani
  Lecture Notes in Computer Science 5125, 2008, pp. 320-332
• Approximating list-coloring on a fixed surface
  Ken-ichi Kawarabayashi
  Lecture Notes in Computer Science 5125, 2008, pp. 333-344
• Asymptotically optimal hitting sets against polynomials
  Markus Bläser, Moritz Hardt, David Steurer
  Lecture Notes in Computer Science 5125, 2008, pp. 345-356
• The smoothed complexity of edit distance
  Alexandr Andoni, Robert Krauthgamer
  Lecture Notes in Computer Science 5125, 2008, pp. 357-369
• Randomized self-assembly for approximate shapes
  Ming-Yang Kao, Robert Schweller
  Lecture Notes in Computer Science 5125, 2008, pp. 370-384
• Succinct data structures for retrieval and approximate membership
  Martin Dietzfelbinger, Rasmus Pagh
  Lecture Notes in Computer Science 5125, 2008, pp. 385-396
• Competitive weighted matching in transversal matroids
  Nedialko B. Dimitrov, C. Greg Plaxton
  Lecture Notes in Computer Science 5125, 2008, pp. 397-408
• Scheduling for speed bounded processors
  Nikhil Bansal, Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee
  Lecture Notes in Computer Science 5125, 2008, pp. 409-420
• Faster algorithms for incremental topological ordering
  Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert E. Tarjan
  Lecture Notes in Computer Science 5125, 2008, pp. 421-433
• Dynamic normal forms and dynamic characteristic polynomial
  Gudmund Skovbjerg Frandsen, Piotr Sankowski
  Lecture Notes in Computer Science 5125, 2008, pp. 434-446
• Algorithms for \epsilon-approximations of terrains
  Jeff M. Phillips
  Lecture Notes in Computer Science 5125, 2008, pp. 447-458
• An approximation algorithm for binary searching in trees
  Eduardo Laber, Marco Molinaro
  Lecture Notes in Computer Science 5125, 2008, pp. 459-471
• Algorithms for 2-route cut problems
  Chandra Chekuri, Sanjeev Khanna
  Lecture Notes in Computer Science 5125, 2008, pp. 472-484
• The two-edge connectivity survivable network problem in planar graphs
  Glencora Borradaile, Philip Klein
  Lecture Notes in Computer Science 5125, 2008, pp. 485-501
• Efficiently testing sparse GF(2) polynomials
  Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan
  Lecture Notes in Computer Science 5125, 2008, pp. 502-514
• Testing properties of sets of points in metric spaces
  Krzysztof Onak
  Lecture Notes in Computer Science 5125, 2008, pp. 515-526
• An expansion tester for bounded degree graphs
  Satyen Kale, C. Seshadhri
  Lecture Notes in Computer Science 5125, 2008, pp. 527-538
• Property testing on k-vertex-connectivity of graphs
  Yuichi Yoshida, Hiro Ito
  Lecture Notes in Computer Science 5125, 2008, pp. 539-550
• Almost 2-SAT is fixed-parameter tractable
  Igor Razgon, Barry O'Sullivan
  Lecture Notes in Computer Science 5125, 2008, pp. 551-562
• On problems without polynomial kernels
  Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
  Lecture Notes in Computer Science 5125, 2008, pp. 563-574
• Faster algebraic algorithms for path and packing problems
  Ioannis Koutis
  Lecture Notes in Computer Science 5125, 2008, pp. 575-586
• Understanding the complexity of induced subgraph isomorphisms
  Yijia Chen, Marc Thurley, Mark Weyer
  Lecture Notes in Computer Science 5125, 2008, pp. 587-596
• Spanners in sparse graphs
  Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
  Lecture Notes in Computer Science 5125, 2008, pp. 597-608
• Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error
  Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay
  Lecture Notes in Computer Science 5125, 2008, pp. 609-621