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 [1]	Hilfe

Suche: Series=LNCS AND Volume=5878

• Finding fullerene patches in polynomial time
  Paul Bonsma, Felix Breuer
  Lecture Notes in Computer Science 5878, 2009, pp. 750-759
• Convex drawings of internally triconnected plane graphs on O(n^2) grids
  Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 5878, 2009, pp. 760-770
• A self-stabilizing and local Delaunay graph construction
  Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid
  Lecture Notes in Computer Science 5878, 2009, pp. 771-780
• Succinct greedy geometric routing in the Euclidean plane
  Michael T. Goodrich, Darren Strash
  Lecture Notes in Computer Science 5878, 2009, pp. 781-791
• Electric routing and concurrent flow cutting
  Jonathan Kelner, Petar Maymounkov
  Lecture Notes in Computer Science 5878, 2009, pp. 792-801
• A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
  Naoyuki Kamiyama, Naoki Katoh
  Lecture Notes in Computer Science 5878, 2009, pp. 802-811
• Strong robustness of randomized rumor spreading protocols
  Benjamin Doerr, Anna Huber, Ariel Levavi
  Lecture Notes in Computer Science 5878, 2009, pp. 812-821
• Data structures for range median queries
  Gerth Stlting Brodal, Allan Grnlund Jrgensen
  Lecture Notes in Computer Science 5878, 2009, pp. 822-831
• Deletion without rebalancing in multiway search trees
  Siddhartha Sen, Robert E. Tarjan
  Lecture Notes in Computer Science 5878, 2009, pp. 832-841
• Counting in the presence of memory faults
  Gerth Stlting Brodal, Allan Grnlund Jrgensen, Gabriel Moruz, Thomas Mlhave
  Lecture Notes in Computer Science 5878, 2009, pp. 842-851
• A simple, fast, and compact static dictionary
  Scott Schneider, Michael Spertus
  Lecture Notes in Computer Science 5878, 2009, pp. 852-861
• Reconstructing polygons from scanner data
  Therese Biedl, Stephane Durocher, Jack Snoeyink
  Lecture Notes in Computer Science 5878, 2009, pp. 862-871
• Computing large matchings in planar graphs with fixed minimum degree
  Robert Franke, Ignaz Rutter, Dorothea Wagner
  Lecture Notes in Computer Science 5878, 2009, pp. 872-881
• Crossing-free acyclic Hamiltonian path completion for planar st-digraphs
  Tamara Mchedlidze, Antonios Symvonis
  Lecture Notes in Computer Science 5878, 2009, pp. 882-891
• Covering a graph with a constrained forest
  Cristina Bazgan, Basile Couëtoux, Zsolt Tuza
  Lecture Notes in Computer Science 5878, 2009, pp. 892-901
• Tri-edge-connectivity augmentation for planar straight line graphs
  Marwan Al-Jubeh, Mashhood Ishaque, Kristóf Rédei, Diane L. Souvaine, Csaba D. Tóth
  Lecture Notes in Computer Science 5878, 2009, pp. 902-912
• Upward star-shaped polyhedral graphs
  Seok-Hee Hong, Hiroshi Nagamochi
  Lecture Notes in Computer Science 5878, 2009, pp. 913-922
• Conditional hardness of approximating satisfiable Max 3CSP-q
  Linqing Tang
  Lecture Notes in Computer Science 5878, 2009, pp. 923-932
• The roles of advice to one-tape linear-time Turing machines and finite automata
  Tomoyuki Yamakami
  Lecture Notes in Computer Science 5878, 2009, pp. 933-942
• Of choices, failures and asynchrony: The many faces of set agreement
  Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
  Lecture Notes in Computer Science 5878, 2009, pp. 943-953
• Step-assembly with a constant number of tile types
  Ján Man̑uch, Ladislav Stacho, Christine Stoll
  Lecture Notes in Computer Science 5878, 2009, pp. 954-963
• Lower bounds on fast searching
  Donald Stanley, Boting Yang
  Lecture Notes in Computer Science 5878, 2009, pp. 964-973
• Approximation algorithms for the Firefighter problem: Cuts over time and submodularity
  Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy
  Lecture Notes in Computer Science 5878, 2009, pp. 974-983
• Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n^{1+\epsilon}) time
  Qian-Ping Gu, Hisao Tamaki
  Lecture Notes in Computer Science 5878, 2009, pp. 984-993
• PTAS for k-tour cover problem on the plane for moderately large values of k
  Anna Adamaszek, Artur Czumaj, Andrzej Lingas
  Lecture Notes in Computer Science 5878, 2009, pp. 994-1003