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 YEAR=2003

• Dynamic algorithms for approximating interdistances
  Sergei Bespamyatnikh, Michael Segal
  Lecture Notes in Computer Science 2719, 2003, pp. 1169-1180
• Solving the robots gathering problem
  Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
  Lecture Notes in Computer Science 2719, 2003, pp. 1181-1196
• Experiments for algorithm engineering
  Jon Bentley
  Lecture Notes in Computer Science 2697, 2003, pp. 3-4
• Empirical exploration of perfect phylogeny haplotyping and haplotypers
  Ren Hua Chung, Dan Gusfield
  Lecture Notes in Computer Science 2697, 2003, pp. 5-19
• Cylindrical hierarchy for deforming necklaces
  Sergei Bespamyatnikh
  Lecture Notes in Computer Science 2697, 2003, pp. 20-29
• Geometric algorithms for agglomerative hierarchical clustering
  Danny Z. Chen, Bin Xu
  Lecture Notes in Computer Science 2697, 2003, pp. 30-39
• On the similarity of sets of permutations and its applications to genome comparison
  Anne Bergeron, Jens Stoye
  Lecture Notes in Computer Science 2697, 2003, pp. 68-79
• On all-substrings alignment problems
  Wei Fu, Wing-Kai Hon, Wing-Kin Sung
  Lecture Notes in Computer Science 2697, 2003, pp. 80-89
• The Specker-Blatter theorem revisited
  E. Fischer, J.A. Makowsky
  Lecture Notes in Computer Science 2697, 2003, pp. 90-101
• On the full and bottleneck full Steiner tree problems
  Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang
  Lecture Notes in Computer Science 2697, 2003, pp. 122-129
• The structure and number of global roundings of a graph
  Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
  Lecture Notes in Computer Science 2697, 2003, pp. 130-138
• Finding hidden independent sets in interval graphs
  Therese Biedl, Bron̑a Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás̑ Vinaȓ
  Lecture Notes in Computer Science 2697, 2003, pp. 182-191
• On proving circuit lower bounds against the polynomial-time hierarchy: Positive and negative results
  Jin-Yi Cai, Osamu Watanabe
  Lecture Notes in Computer Science 2697, 2003, pp. 202-211
• Distributed algorithm for better approximation of the maximum matching
  A. Czygrinow, M. Hańćkowiak
  Lecture Notes in Computer Science 2697, 2003, pp. 242-251
• Approximate rank aggregation
  Xiaotie Deng, Qizhi Fang, Shanfeng Zhu
  Lecture Notes in Computer Science 2697, 2003, pp. 262-271
• Fast construction of generalized suffix trees over a very large alphabet
  Zhixiang Chen, Richard Fowler, Ada Wai-Chee Fu, Chunyue Wang
  Lecture Notes in Computer Science 2697, 2003, pp. 284-293
• Tetris is hard, even to approximate
  Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
  Lecture Notes in Computer Science 2697, 2003, pp. 351-363
• Isoperimetric inequalities and the width parameters of graphs
  L. Sunil Chandran, T. Kavitha, C.R. Subramanian
  Lecture Notes in Computer Science 2697, 2003, pp. 385-393
• Graph coloring and the immersion order
  Faisal N. Abu-Khzam, Michael A. Langston
  Lecture Notes in Computer Science 2697, 2003, pp. 394-403
• Optimal MST maintenance for transient deletion of every node in planar graphs
  Carlo Gaibisso, Guido Proietti, Richard B. Tan
  Lecture Notes in Computer Science 2697, 2003, pp. 404-414
• Improved competitive algorithms for online scheduling with partial job values
  Francis Y.L. Chin, Stanley P.Y. Fung
  Lecture Notes in Computer Science 2697, 2003, pp. 425-434
• Majority equilibrium for public facility allocation
  Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian
  Lecture Notes in Computer Science 2697, 2003, pp. 435-444
• Covering a set of points with a minimum number of turns
  Michael J. Collins
  Lecture Notes in Computer Science 2697, 2003, pp. 467-474
• On a conjecture on Wiener indices in combinatorial chemistry
  Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa
  Lecture Notes in Computer Science 2697, 2003, pp. 509-518
• Double digest revisited: Complexity and approximability in the presence of noisy data
  Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2697, 2003, pp. 519-527