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

• Biased skip lists
  Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
  Lecture Notes in Computer Science 2518, 2002, pp. 1-13
• Space-efficient data structures for flexible text retrieval systems
  Kunihiko Sadakane
  Lecture Notes in Computer Science 2518, 2002, pp. 14-24
• Key independent optimality
  John Iacono
  Lecture Notes in Computer Science 2518, 2002, pp. 25-31
• On the comparison-addition complexity of all-pairs shortest paths
  Seth Pettie
  Lecture Notes in Computer Science 2518, 2002, pp. 32-43
• On the clique-width of graphs in hereditary classes
  Rodica Boliac, Vadim Lozin
  Lecture Notes in Computer Science 2518, 2002, pp. 44-54
• The probability of a rendezvous is minimal in complete graphs
  Martin Dietzfelbinger
  Lecture Notes in Computer Science 2518, 2002, pp. 55-66
• On the minimum volume of a perturbed unit cube
  Jin-Yi Cai
  Lecture Notes in Computer Science 2518, 2002, pp. 67-78
• Non-Delaunay-based curve reconstruction
  Sumanta Guha, Paula Josiah, Anoop Mittal, Son Dinh Tran
  Lecture Notes in Computer Science 2518, 2002, pp. 79-90
• Cutting a country for smallest square fit
  Marc van Kreveld, Bettina Speckmann
  Lecture Notes in Computer Science 2518, 2002, pp. 91-102
• On the emptiness problem for two-way NFA with one reversal-bounded counter
  Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
  Lecture Notes in Computer Science 2518, 2002, pp. 103-114
• Quantum multi-prover interactive proof systems with limited prior entanglement
  Hirotada Kobayashi, Keiji Matsumoto
  Lecture Notes in Computer Science 2518, 2002, pp. 115-127
• Some remarks on the L-conjecture
  Qi Cheng
  Lecture Notes in Computer Science 2518, 2002, pp. 128-136
• A framework for network reliability problems on graphs of bounded treewidth
  Thomas Wolle
  Lecture Notes in Computer Science 2518, 2002, pp. 137-149
• A faster approximation algorithm for 2-edge-connectivity augmentation
  Anna Galluccio, Guido Proietti
  Lecture Notes in Computer Science 2518, 2002, pp. 150-162
• Tree spanners on chordal graphs: Complexity, algorithms, open problems
  A. Brandstädt, F.F. Dragan, H.-O. Le, V.B. Le
  Lecture Notes in Computer Science 2518, 2002, pp. 163-174
• An asymptotic fully polynomial time approximation scheme for bin covering
  Klaus Jansen, Roberto Solis-Oba
  Lecture Notes in Computer Science 2518, 2002, pp. 175-186
• Improved approximation algorithms for Max-2SAT with cardinality constraint
  Markus Bläser, Bodo Manthey
  Lecture Notes in Computer Science 2518, 2002, pp. 187-198
• A better approximation for the two-stage assembly scheduling problem with two machines at the first stage
  Yoshiyuki Karuno, Hiroshi Nagamochi
  Lecture Notes in Computer Science 2518, 2002, pp. 199-210
• Queaps
  John Iacono, Stefan Langerman
  Lecture Notes in Computer Science 2518, 2002, pp. 211-218
• Funnel heap - A cache oblivious priority queue
  Gerth Stlting Brodal, Rolf Fagerberg
  Lecture Notes in Computer Science 2518, 2002, pp. 219-228
• Characterizing history independent data structures
  Jason D. Hartline, Edwin S. Hong, Alexander E. Mohr, William R. Pentney, Emily C. Rocke
  Lecture Notes in Computer Science 2518, 2002, pp. 229-240
• Faster fixed parameter tractable algorithms for undirected feedback vertex set
  Venkatesh Raman, Saket Saurabh, C.R. Subramanian
  Lecture Notes in Computer Science 2518, 2002, pp. 241-248
• An O(pn + 1.151^p)-algorithm for p-profit cover and its practical implications for vertex cover
  Ulrike Stege, Iris van Rooij, Alex Hertel, Philipp Hertel
  Lecture Notes in Computer Science 2518, 2002, pp. 249-261
• Exponential speedup of fixed-parameter algorithms on K_{3,3}-minor-free or K_5-minor-free graphs
  Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2518, 2002, pp. 262-273
• Casting a polyhedron with directional uncertainty
  Hee-Kap Ahn, Otfried Cheong, René van Oostrum
  Lecture Notes in Computer Science 2518, 2002, pp. 274-285