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

• Approximation algorithms for computing the Earth Mover's Distance under transformations
  Oliver Klein, Remco C. Veltkamp
  Lecture Notes in Computer Science 3827, 2005, pp. 1019-1028
• Fast k-means algorithms with constant approximation
  Mingjun Song, Sanguthevar Rajasekaran
  Lecture Notes in Computer Science 3827, 2005, pp. 1029-1038
• On efficient weighted rectangle packing with large resources
  Aleksei V. Fishkin, Olga Gerber, Klaus Jansen
  Lecture Notes in Computer Science 3827, 2005, pp. 1039-1050
• On routing in VLSI design and communication networks
  Tamás Terlaky, Anthony Vannelli, Hu Zhang
  Lecture Notes in Computer Science 3827, 2005, pp. 1051-1060
• The capacitated Traveling Salesman Problem with pickups and deliveries on a tree
  Andrew Lim, Fan Wang, Zhou Xu
  Lecture Notes in Computer Science 3827, 2005, pp. 1061-1070
• Distance labeling in hyperbolic graphs
  Cyril Gavoille, Olivier Ly
  Lecture Notes in Computer Science 3827, 2005, pp. 1071-1079
• Multi-source trees: Algorithms for minimizing eccentricity cost metrics
  Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios
  Lecture Notes in Computer Science 3827, 2005, pp. 1080-1089
• Edge-pancyclicity of twisted cubes
  Jianxi Fan, Xiaola Lin, Xiaohua Jia, Rynson W.H. Lau
  Lecture Notes in Computer Science 3827, 2005, pp. 1090-1099
• Combinatorial network abstraction by trees and distances
  Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
  Lecture Notes in Computer Science 3827, 2005, pp. 1100-1109
• Drawing phylogenetic trees
  Christian Bachmaier, Ulrik Brandes, Barbara Schlieper
  Lecture Notes in Computer Science 3827, 2005, pp. 1110-1121
• Localized and compact data-structure for comparability graphs
  Fabrice Bazzaro, Cyril Gavoille
  Lecture Notes in Computer Science 3827, 2005, pp. 1122-1131
• Representation of graphs by OBDDs
  Robin Nunkesser, Philipp Woelfel
  Lecture Notes in Computer Science 3827, 2005, pp. 1132-1142
• Space-efficient construction of LZ-index
  Diego Arroyuelo, Gonzalo Navarro
  Lecture Notes in Computer Science 3827, 2005, pp. 1143-1152
• Longest increasing subsequences in windows based on canonical antichain partition
  Erdong Chen, Hao Yuan, Linji Yang
  Lecture Notes in Computer Science 3827, 2005, pp. 1153-1162
• Pareto optimality in house allocation problems
  David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn
  Lecture Notes in Computer Science 3827, 2005, pp. 1163-1175
• Generalized geometric approaches for leaf sequencing problems in radiation therapy
  Danny Z. Chen, Xiaobo S. Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu
  Lecture Notes in Computer Science 3827, 2005, pp. 1176-1186