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

• Counting distinct items over update streams
  Sumit Ganguly
  Lecture Notes in Computer Science 3827, 2005, pp. 505-514
• Randomized algorithm for the sum selection problem
  Tien-Ching Lin, D.T. Lee
  Lecture Notes in Computer Science 3827, 2005, pp. 515-523
• An improved interval routing scheme for almost all networks based on dominating cliques
  Martin Nehéz, Daniel Olejár
  Lecture Notes in Computer Science 3827, 2005, pp. 524-532
• Basic computations in wireless networks
  Ioannis Caragiannis, Clemente Galdi, Christos Kaklamanis
  Lecture Notes in Computer Science 3827, 2005, pp. 533-542
• A simple optimal randomized algorithm for sorting on the PDM
  Sanguthevar Rajasekaran, Sandeep Sen
  Lecture Notes in Computer Science 3827, 2005, pp. 543-552
• Efficient parallel algorithms for constructing a k-tree center and a k-tree core of a tree network
  Yan Wang, Deqiang Wang, Wei Liu, Baoyu Tian
  Lecture Notes in Computer Science 3827, 2005, pp. 553-562
• A tight bound on the number of mobile servers to guarantee the mutual transferability among dominating configurations
  Satoshi Fujita
  Lecture Notes in Computer Science 3827, 2005, pp. 563-572
• Bounding the number of minimal dominating sets: A measure and conquer approach
  Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
  Lecture Notes in Computer Science 3827, 2005, pp. 573-582
• Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width
  Feodor F. Dragan, Chenyu Yan
  Lecture Notes in Computer Science 3827, 2005, pp. 583-592
• Sampling unlabeled biconnected planar graphs
  Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
  Lecture Notes in Computer Science 3827, 2005, pp. 593-603
• Configurations with few crossings in topological graphs
  Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
  Lecture Notes in Computer Science 3827, 2005, pp. 604-613
• On bounded load routings for modeling k-regular connection topologies
  Adrian Kosowski, Michaƚ Maƚafiejski, Paweƚ Żyliński
  Lecture Notes in Computer Science 3827, 2005, pp. 614-623
• 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
• An improved An improved ${\~O}(1.234^m)-time deterministic algorithm for SAT
  Masaki Yamamoto
  Lecture Notes in Computer Science 3827, 2005, pp. 644-653
• Solving minimum weight exact satisfiability in time O(2^{0.2441n})
  Stefan Porschen
  Lecture Notes in Computer Science 3827, 2005, pp. 654-664
• 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
• Algorithms for local forest similarity
  Zeshan Peng
  Lecture Notes in Computer Science 3827, 2005, pp. 704-713
• 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
• 5-th phylogenetic root construction for strictly chordal graphs
  William Kennedy, Guohui Lin
  Lecture Notes in Computer Science 3827, 2005, pp. 738-747
• Recursion theoretic operators for function complexity classes
  Kenya Ueno
  Lecture Notes in Computer Science 3827, 2005, pp. 748-756