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

• Labeling points with weights
  Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff
  Lecture Notes in Computer Science 2223, 2001, pp. 610-622
• Small convex quadrangulations of point sets
  David Bremner, Ferran Hurtado
  Lecture Notes in Computer Science 2223, 2001, pp. 623-635
• How to color a checkerboard with a given distribution - Matrix rounding achieving low 2\times 2-discrepancy
  Tetsuo Asano, Takeshi Tokuyama
  Lecture Notes in Computer Science 2223, 2001, pp. 636-648
• Labeling subway lines
  Mari Ángeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff
  Lecture Notes in Computer Science 2223, 2001, pp. 649-659
• Complexity study on two clustering problems
  Louxin Zhang, Song Zhu
  Lecture Notes in Computer Science 2223, 2001, pp. 660-669
• A modified greedy algorithm for the set cover problem with weights 1 and 2
  Toshihiro Fujito, Tsuyoshi Okumura
  Lecture Notes in Computer Science 2223, 2001, pp. 670-681
• A unified framework for approximating multiway partition problems
  Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 2223, 2001, pp. 682-694
• On-line algorithms for cardinality constrained bin packing problems
  Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
  Lecture Notes in Computer Science 2223, 2001, pp. 695-706
• Suffix vector: A space-efficient suffix tree representation
  Krisztián Monostori, Arkady Zaslavsky, István Vajk
  Lecture Notes in Computer Science 2223, 2001, pp. 707-718
• Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works
  Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara
  Lecture Notes in Computer Science 2223, 2001, pp. 719-730
• Computing the quartet distance between evolutionary trees in time \O(n \log^2 n)
  Gerth Stlting Brodal, Rolf Fagerberg, Christian N.S. Pedersen
  Lecture Notes in Computer Science 2223, 2001, pp. 731-742
• The Cent-dian path problem on tree networks
  Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari
  Lecture Notes in Computer Science 2223, 2001, pp. 743-755
• Approximate hotlink assignment
  Evangelos Kranakis, Danny Krizanc, Sunil Shende
  Lecture Notes in Computer Science 2223, 2001, pp. 756-767
• Efficient algorithms for two generalized 2-median problems on trees
  Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin
  Lecture Notes in Computer Science 2223, 2001, pp. 768-778