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

• An algorithm for computing DNA walks
  Ankur Bhargava, S. Rao Kosaraju
  Lecture Notes in Computer Science 3221, 2004, pp. 110-121
• Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich
  Lecture Notes in Computer Science 3221, 2004, pp. 122-133
• Direct routing: Algorithms and complexity
  Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul Spirakis
  Lecture Notes in Computer Science 3221, 2004, pp. 134-145
• Lower bounds for embedding into distributions over excluded minor graph families
  Douglas E. Carroll, Ashish Goel
  Lecture Notes in Computer Science 3221, 2004, pp. 146-156
• A parameterized algorithm for upward planarity testing
  Hubert Chan
  Lecture Notes in Computer Science 3221, 2004, pp. 157-168
• Fisher equilibrium price with a class of concave utility functions
  Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
  Lecture Notes in Computer Science 3221, 2004, pp. 169-179
• Hardness and approximation results for packing Steiner trees
  Joseph Cheriyan, Mohammad R. Salavatipour
  Lecture Notes in Computer Science 3221, 2004, pp. 180-191
• Approximation hardness of dominating set problems
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 3221, 2004, pp. 192-203
• Improved online algorithms for buffer management in QOS switches
  Marek Chrobak, Wojciech Jawor, Jiȓí Sgall, Tomás̑ Tichý
  Lecture Notes in Computer Science 3221, 2004, pp. 204-215
• Time dependent multi scheduling of multicast
  Rami Cohen, Dror Rawitz, Danny Raz
  Lecture Notes in Computer Science 3221, 2004, pp. 216-227
• Convergence properties of the gravitational algorithm in asynchronous robot systems
  Reuven Cohen, David Peleg
  Lecture Notes in Computer Science 3221, 2004, pp. 228-239
• The average case analysis of partition sorts
  Richard Cole, David C. Kandathil
  Lecture Notes in Computer Science 3221, 2004, pp. 240-251
• A fast distributed algorithm for approximating the maximum matching
  Andrzej Czygrinow, Michaƚ Hańćkowiak, Edyta Szymańska
  Lecture Notes in Computer Science 3221, 2004, pp. 252-263
• Extreme points under random noise
  Valentina Damerow, Christian Sohler
  Lecture Notes in Computer Science 3221, 2004, pp. 264-274
• Fixed parameter algorithms for counting and deciding bounded restrictive list H-colorings
  Josep Díaz, Maria Serna, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 3221, 2004, pp. 275-286
• An experimental study of random knapsack problems
  Rene Beier, Berthold Vöcking
  Lecture Notes in Computer Science 3221, 2004, pp. 616-627
• Contraction and treewidth lower bounds
  Hans L. Bodlaender, Arie M.C.A. Koster, Thomas Wolle
  Lecture Notes in Computer Science 3221, 2004, pp. 628-639
• Some recent progress in algorithmic randomness
  Rod Downey
  Lecture Notes in Computer Science 3153, 2004, pp. 42-83
• Theory and applied computing: Observations and anecdotes
  Matthew Brand, Sarah Frisken, Neal Lesh, Joe Marks, Daniel Nikovski, Ron Perry, Jonathan Yedidia
  Lecture Notes in Computer Science 3153, 2004, pp. 106-118
• Boxed ambients with communication interfaces
  Eduardo Bonelli, Adriana Compagnoni, Mariangiola Dezani-Ciancaglini, Pablo Garralda
  Lecture Notes in Computer Science 3153, 2004, pp. 119-148
• Equitable colorings of bounded treewidth graphs
  Hans L. Bodlaender, Fedor V. Fomin
  Lecture Notes in Computer Science 3153, 2004, pp. 180-190
• The bidimensional theory of bounded-genus graphs
  Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 3153, 2004, pp. 191-203
• Parallel knock-out schemes in networks
  Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
  Lecture Notes in Computer Science 3153, 2004, pp. 204-214
• Online algorithms for disk graphs
  Ioannis Caragiannis, Aleksei Fishkin, Christos Kaklamanis, Evi Papaioannou
  Lecture Notes in Computer Science 3153, 2004, pp. 215-226
• Protein folding in the HP model on grid lattices with diagonals
  Hans-Joachim Böckenhauer, Dirk Bongartz
  Lecture Notes in Computer Science 3153, 2004, pp. 227-238