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

• The combinatorics of sequencing the corn genome
  Srinivas Aluru
  Lecture Notes in Computer Science 4598, 2007, pp. 1-1
• Online frequency assignment in wireless communication networks
  Francis Y.L. Chin
  Lecture Notes in Computer Science 4598, 2007, pp. 2-2
• Information distance from a question to an answer
  Ming Li
  Lecture Notes in Computer Science 4598, 2007, pp. 3-3
• A new field splitting algorithm for intensity-modulated radiation therapy
  Danny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu
  Lecture Notes in Computer Science 4598, 2007, pp. 4-15
• A new recombination lower bound and the minimum perfect phylogenetic forest problem
  Yufeng Wu, Dan Gusfield
  Lecture Notes in Computer Science 4598, 2007, pp. 16-26
• Seed-based exclusion method for non-coding RNA gene search
  Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabrouk
  Lecture Notes in Computer Science 4598, 2007, pp. 27-39
• A new quartet approach for reconstructing phylogenetic trees: Quartet joining method
  Lei Xin, Bin Ma, Kaizhong Zhang
  Lecture Notes in Computer Science 4598, 2007, pp. 40-50
• Integer programming formulations and computations solving phylogenetic and population genetic problems with missing or genotypic data
  Dan Gusfield, Yelena Frid, Dan Brown
  Lecture Notes in Computer Science 4598, 2007, pp. 51-64
• Improved exact algorithms for counting 3- and 4-colorings
  Fedor V. Fomin, Serge Gaspers, Saket Saurabh
  Lecture Notes in Computer Science 4598, 2007, pp. 65-74
• Connected coloring completion for general graphs: Algorithms and complexity
  Benny Chor, Michael Fellows, Mark A. Ragan, Igor Razgon, Frances Rosamond, Sagi Snir
  Lecture Notes in Computer Science 4598, 2007, pp. 75-85
• Quadratic kernelization for convex recoloring of trees
  Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
  Lecture Notes in Computer Science 4598, 2007, pp. 86-96
• On the number of cycles in planar graphs
  Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
  Lecture Notes in Computer Science 4598, 2007, pp. 97-107
• An improved exact algorithm for cubic graph TSP
  Kazuo Iwama, Takuya Nakashima
  Lecture Notes in Computer Science 4598, 2007, pp. 108-117
• Geometric intersection graphs: Do short cycles help?
  Jan Kratochvíl, Martin Pergel
  Lecture Notes in Computer Science 4598, 2007, pp. 118-128
• Dimension, halfspaces, and the density of hard sets
  Ryan C. Harkins, John M. Hitchcock
  Lecture Notes in Computer Science 4598, 2007, pp. 129-139
• Isolation concepts for enumerating dense subgraphs
  Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
  Lecture Notes in Computer Science 4598, 2007, pp. 140-150
• Alignments with non-overlapping moves, inversions and tandem duplications in O(n^4) time
  Christian Ledergerber, Christophe Dessimoz
  Lecture Notes in Computer Science 4598, 2007, pp. 151-164
• Counting minimum weighted dominating sets
  Fedor V. Fomin, Alexey A. Stepanov
  Lecture Notes in Computer Science 4598, 2007, pp. 165-175
• Online interval scheduling: Randomized and multiprocessor cases
  Stanley P.Y. Fung, Chung Keung Poon, Feifeng Zheng
  Lecture Notes in Computer Science 4598, 2007, pp. 176-186
• Scheduling selfish tasks: About the performance of truthful algorithms
  George Christodoulou, Laurent Gourvès, Fanny Pascual
  Lecture Notes in Computer Science 4598, 2007, pp. 187-197
• Volume computation using a direct Monte Carlo method
  Sheng Liu, Jian Zhang, Binhai Zhu
  Lecture Notes in Computer Science 4598, 2007, pp. 198-209
• Improved throughput bounds for interference-aware routing in wireless networks
  Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
  Lecture Notes in Computer Science 4598, 2007, pp. 210-221
• Generating minimal k-vertex connected spanning subgraphs
  Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gabor Rudolf
  Lecture Notes in Computer Science 4598, 2007, pp. 222-231
• Finding many optimal paths without growing any optimal path trees
  Danny Z. Chen, Ewa Misioƚek
  Lecture Notes in Computer Science 4598, 2007, pp. 232-242
• Enumerating constrained non-crossing geometric spanning trees
  Naoki Katoh, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 4598, 2007, pp. 243-253