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

Suche: Series=LNCS AND YEAR=2001

• On the rank of mixed 0,1 polyhedra
  Gérard Cornuéjols, Yanjun Li
  Lecture Notes in Computer Science 2081, 2001, pp. 71-77
• Fast 2-variable integer programming
  Friedrich Eisenbrand, Günter Rote
  Lecture Notes in Computer Science 2081, 2001, pp. 78-89
• Approximating k-spanner problems for k>2
  Michael Elkin, David Peleg
  Lecture Notes in Computer Science 2081, 2001, pp. 90-104
• A matroid generalization of the stable matching polytope
  Tamás Fleiner
  Lecture Notes in Computer Science 2081, 2001, pp. 105-114
• A 2-approximation for minimum cost 0,1,2 vertex connectivity
  Lisa Fleischer
  Lecture Notes in Computer Science 2081, 2001, pp. 115-129
• Combined connectivity augmentation and orientation problems
  András Frank, Tamás Király
  Lecture Notes in Computer Science 2081, 2001, pp. 130-144
• An extension of a theorem of Henneberg and Laman
  András Frank, László Szegŏ
  Lecture Notes in Computer Science 2081, 2001, pp. 145-159
• Bisubmodular function minimization
  Satoru Fujishige, Satoru Iwata
  Lecture Notes in Computer Science 2081, 2001, pp. 160-169
• On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
  Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F.S. Salman, Amitabh Sinha
  Lecture Notes in Computer Science 2081, 2001, pp. 170-184
• Languages, rewriting systems, and verification of infinite-state systems
  Ahmed Bouajjani
  Lecture Notes in Computer Science 2076, 2001, pp. 24-39
• Improvements of the Alder-Strassen bound: Algebras with nonzero radical
  Markus Bläser
  Lecture Notes in Computer Science 2076, 2001, pp. 79-91
• On generating all minimal integer solutions for a monotone system of linear inequalities
  E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino
  Lecture Notes in Computer Science 2076, 2001, pp. 92-103
• A framework for index bulk loading and dynamization
  Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 2076, 2001, pp. 115-127
• A characterization of temporal locality and its portability across memory hierarchies
  Gianfranco Bilardi, Enoch Peserico
  Lecture Notes in Computer Science 2076, 2001, pp. 128-139
• The complexity of constructing evolutionary trees using experiments
  Gerth Stlting Brodal, Rolf Fagerberg, Christian N.S. Pedersen, Anna Östlin
  Lecture Notes in Computer Science 2076, 2001, pp. 140-151
• Hidden pattern statistics
  Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée
  Lecture Notes in Computer Science 2076, 2001, pp. 152-165
• Approximating the minimum spanning tree weight in sublinear time
  Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
  Lecture Notes in Computer Science 2076, 2001, pp. 190-200
• Approximation hardness of TSP with bounded metrics
  Lars Engebretsen, Marek Karpinski
  Lecture Notes in Computer Science 2076, 2001, pp. 201-212
• The RPR^2 rounding technique for semidefinite programs
  Uriel Feige, Michael Langberg
  Lecture Notes in Computer Science 2076, 2001, pp. 213-224
• Approximation algorithms for partial covering problems
  Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
  Lecture Notes in Computer Science 2076, 2001, pp. 225-236
• Parameterized complexity: Exponential speed-up for planar graph problems
  Jochen Alber, Henning Fernau, Rolf Niedermeier
  Lecture Notes in Computer Science 2076, 2001, pp. 261-272
• Subexponential parameterized algorithms collapse the W-hierarchy
  Liming Cai, David Juedes
  Lecture Notes in Computer Science 2076, 2001, pp. 273-284
• Improved lower bounds on the randomized complexity of graph properties
  Amit Chakrabarti, Subhash Khot
  Lecture Notes in Computer Science 2076, 2001, pp. 285-296
• New imperfect random source with applications to coin-flipping
  Yevgeniy Dodis
  Lecture Notes in Computer Science 2076, 2001, pp. 297-309
• Recognizing more unsatisfiable random 3-SAT instances efficiently
  Joel Friedman, Andreas Goerdt
  Lecture Notes in Computer Science 2076, 2001, pp. 310-321