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

• A 1.5-approximation of the minimal Manhattan network problem
  Sebastian Seibert, Walter Unger
  Lecture Notes in Computer Science 3827, 2005, pp. 246-255
• Hardness and approximation of octilinear Steiner trees
  Matthias Müller-Hannemann, Anna Schulze
  Lecture Notes in Computer Science 3827, 2005, pp. 256-265
• Dense subgraph problems with output-density conditions
  Akiko Suzuki, Takeshi Tokuyama
  Lecture Notes in Computer Science 3827, 2005, pp. 266-276
• A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedback
  Yvo Desmedt, Yongge Wang, Mike Burmester
  Lecture Notes in Computer Science 3827, 2005, pp. 277-287
• Network game with attacker and protector entities
  Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul Spirakis
  Lecture Notes in Computer Science 3827, 2005, pp. 288-297
• SkipTree: A scalable range-queryable distributed data structure for multidimensional data
  Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
  Lecture Notes in Computer Science 3827, 2005, pp. 298-307
• The phase matrix
  Peter Hyer
  Lecture Notes in Computer Science 3827, 2005, pp. 308-317
• ISB-tree: A new indexing scheme with efficient expected behaviour
  Alexis Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas, Christos Zaroliagis
  Lecture Notes in Computer Science 3827, 2005, pp. 318-327
• External data structures for shortest path queries on planar digraphs
  Lars Arge, Laura Toma
  Lecture Notes in Computer Science 3827, 2005, pp. 328-338
• Improved approximate string matching using compressed suffix data structures
  Tak-Wah Lam, Wing-Kin Sung, Swee-Seong Wong
  Lecture Notes in Computer Science 3827, 2005, pp. 339-348
• Monitoring continuous band-join queries over dynamic data
  Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu
  Lecture Notes in Computer Science 3827, 2005, pp. 349-359
• Approximate colored range queries
  Ying Kit Lai, Chung Keung Poon, Benyun Shi
  Lecture Notes in Computer Science 3827, 2005, pp. 360-369
• Complexity and approximation of the minimum recombination haplotype configuration problem
  Lan Liu, Xi Chen, Jing Xiao, Tao Jiang
  Lecture Notes in Computer Science 3827, 2005, pp. 370-379
• Space efficient algorithms for ordered tree comparison
  Lusheng Wang, Kaizhong Zhang
  Lecture Notes in Computer Science 3827, 2005, pp. 380-391
• A 1.75-approximation algorithm for unsigned translocation distance
  Yun Cui, Lusheng Wang, Daming Zhu
  Lecture Notes in Computer Science 3827, 2005, pp. 392-401
• Fast algorithms for computing the tripartition-based distance between phylogenetic networks
  Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung
  Lecture Notes in Computer Science 3827, 2005, pp. 402-411
• Improved algorithms for largest cardinality 2-interval pattern problem
  Hao Yuan, Linji Yang, Erdong Chen
  Lecture Notes in Computer Science 3827, 2005, pp. 412-421
• Preemptive semi-online scheduling on parallel machines with inexact partial information
  Yong He, Yiwei Jiang
  Lecture Notes in Computer Science 3827, 2005, pp. 422-432
• On-line computation and maximum-weighted hereditary subgraph problems
  Marc Demange, Bernard Kouakou, Éric Soutif
  Lecture Notes in Computer Science 3827, 2005, pp. 433-442
• A novel adaptive learning algorithm for stock market prediction
  Lean Yu, Shouyang Wang, Kin Keung Lai
  Lecture Notes in Computer Science 3827, 2005, pp. 443-452
• Uniformization of discrete data
  Lei Yang
  Lecture Notes in Computer Science 3827, 2005, pp. 453-462
• A practical algorithm for the computation of market equilibrium with logarithmic utility functions
  Li-Sha Huang
  Lecture Notes in Computer Science 3827, 2005, pp. 463-472
• Boosting spectral partitioning by sampling and iteration
  Joachim Giesen, Dieter Mitsche
  Lecture Notes in Computer Science 3827, 2005, pp. 473-482
• Smoothed analysis of binary search trees
  Bodo Manthey, Rüdiger Reischuk
  Lecture Notes in Computer Science 3827, 2005, pp. 483-492
• Simple and efficient greedy algorithms for Hamilton cycles in random intersection graphs
  C. Raptopoulos, P. Spirakis
  Lecture Notes in Computer Science 3827, 2005, pp. 493-504