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 YEAR=2005

• Casting an object with a core
  Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
  Lecture Notes in Computer Science 3827, 2005, pp. 40-49
• Sparse geometric graphs with small dilation
  Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman Haverkort, Antoine Vigneron
  Lecture Notes in Computer Science 3827, 2005, pp. 50-59
• A min-max relation on packing feedback vertex sets
  Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
  Lecture Notes in Computer Science 3827, 2005, pp. 126-135
• On the complexity of Rocchio's similarity-based relevance feedback algorithm
  Zhixiang Chen, Bin Fu
  Lecture Notes in Computer Science 3827, 2005, pp. 216-225
• Correlation clustering and consensus clustering
  Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang
  Lecture Notes in Computer Science 3827, 2005, pp. 226-235
• 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
• 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
• External data structures for shortest path queries on planar digraphs
  Lars Arge, Laura Toma
  Lecture Notes in Computer Science 3827, 2005, pp. 328-338
• 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
• 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
• 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
• Basic computations in wireless networks
  Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
  Lecture Notes in Computer Science 3827, 2005, pp. 533-542
• Sampling unlabeled biconnected planar graphs
  Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
  Lecture Notes in Computer Science 3827, 2005, pp. 593-603
• On the complexity of global constraint satisfaction
  Cristina Bazgan, Marek Karpinski
  Lecture Notes in Computer Science 3827, 2005, pp. 624-633
• Polynomial space suffices for deciding Nash equilibria properties for extensive games with large trees
  Carme Àlvarez, Joaquim Gabarró, Maria Serna
  Lecture Notes in Computer Science 3827, 2005, pp. 634-643
• Efficient algorithms for finding a longest common increasing subsequence
  Wun-Tat Chan, Yong Zhang, Stanley P.Y. Fung, Deshi Ye, Hong Zhu
  Lecture Notes in Computer Science 3827, 2005, pp. 665-674
• Decision making based on approximate and smoothed Pareto curves
  Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
  Lecture Notes in Computer Science 3827, 2005, pp. 675-684
• Computing optimal solutions for the MIN 3-SET COVERING problem
  Federico Della Croce, Vangelis Th. Paschos
  Lecture Notes in Computer Science 3827, 2005, pp. 685-692
• Efficient algorithms for the weighted 2-center problem in a cactus graph
  Boaz Ben-Moshe, Binay Bhattacharya, Qiaosheng Shi
  Lecture Notes in Computer Science 3827, 2005, pp. 693-703
• Fast algorithms for finding disjoint subsequences with extremal densities
  Anders Bergkvist, Peter Damaschke
  Lecture Notes in Computer Science 3827, 2005, pp. 714-723
• A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
  Hiroki Arimura, Takeaki Uno
  Lecture Notes in Computer Science 3827, 2005, pp. 724-737
• Complexity of the min-max (regret) versions of cut problems
  Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
  Lecture Notes in Computer Science 3827, 2005, pp. 789-798
• Improved algorithms for the k maximum-sums problems
  Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
  Lecture Notes in Computer Science 3827, 2005, pp. 799-808
• Network load games
  Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
  Lecture Notes in Computer Science 3827, 2005, pp. 809-818
• Minimum entropy coloring
  Jean Cardinal, Samuel Fiorini, Gwenaël Joret
  Lecture Notes in Computer Science 3827, 2005, pp. 819-828