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

• LIAR!
  Joel Spencer
  Lecture Notes in Computer Science 2697, 2003, pp. 1-2
• 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
• Traveling salesman problem of segments
  Jinhui Xu, Yang Yang, Zhiyong Lin
  Lecture Notes in Computer Science 2697, 2003, pp. 40-49
• Subexponential-time algorithms for maximum independent set and related problems on box graphs
  Andrzej Lingas, Martin Wahlen
  Lecture Notes in Computer Science 2697, 2003, pp. 50-56
• A space efficient algorithm for sequence alignment with inversions
  Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin
  Lecture Notes in Computer Science 2697, 2003, pp. 57-67
• 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 divergence bounded computable real numbers
  Xizhong Zheng
  Lecture Notes in Computer Science 2697, 2003, pp. 102-111
• Sparse parity-check matrices over finite fields
  Hanno Lefmann
  Lecture Notes in Computer Science 2697, 2003, pp. 112-121
• 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
• On even triangulations of 2-connected embedded graphs
  Huaming Zhang, Xin He
  Lecture Notes in Computer Science 2697, 2003, pp. 139-148
• Petri nets with simple circuits
  Hsu-Chun Yen, Lien-Po Yu
  Lecture Notes in Computer Science 2697, 2003, pp. 149-158
• Automatic verification of multi-queue discrete timed automata
  Pierluigi San Pietro, Zhe Dang
  Lecture Notes in Computer Science 2697, 2003, pp. 159-171
• List total colorings of series-parallel graphs
  Xiao Zhou, Yuki Matsuo, Takao Nishizeki
  Lecture Notes in Computer Science 2697, 2003, pp. 172-181
• 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
• Matroid representation of clique complexes
  Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno
  Lecture Notes in Computer Science 2697, 2003, pp. 192-201
• 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
• The complexity of Boolean matrix root computation
  Martin Kutz
  Lecture Notes in Computer Science 2697, 2003, pp. 212-221
• A fast bit-parallel algorithm for matching extended regular expressions
  Hiroaki Yamamoto, Takashi Miyazaki
  Lecture Notes in Computer Science 2697, 2003, pp. 222-231
• Group mutual exclusion algorithms based on ticket orders
  Masataka Takamura, Yoshihide Igarashi
  Lecture Notes in Computer Science 2697, 2003, pp. 232-241