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

• A case study of genome evolution: From continuous to discrete time model
  Jerzy Tiuryn, Ryszard Rudnicki, Damian Wójtowicz
  Lecture Notes in Computer Science 3153, 2004, pp. 1-24
• Multicoloring: Problems and techniques
  Magnús M. Halldórsson, Guy Kortsarz
  Lecture Notes in Computer Science 3153, 2004, pp. 25-41
• Some recent progress in algorithmic randomness
  Rod Downey
  Lecture Notes in Computer Science 3153, 2004, pp. 42-83
• Ubiquitous parameterization - Invitation to fixed-parameter algorithms
  Rolf Niedermeier
  Lecture Notes in Computer Science 3153, 2004, pp. 84-103
• PRAM-On-Chip: A quest for not-so-obvious non-obviousness
  Uzi Vishkin
  Lecture Notes in Computer Science 3153, 2004, pp. 104-105
• 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
• Algebraic recognizability of languages
  Pascal Weil
  Lecture Notes in Computer Science 3153, 2004, pp. 149-175
• Geometric optimization and unique sink orientations of cubes
  Emo Welzl
  Lecture Notes in Computer Science 3153, 2004, pp. 176-176
• Congestion games and coordination mechanisms
  Elias Koutsoupias
  Lecture Notes in Computer Science 3153, 2004, pp. 177-179
• 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
• Optimization, games, and quantified constraint satisfaction
  Hubie Chen, Martin Pál
  Lecture Notes in Computer Science 3153, 2004, pp. 239-250
• Approximating Boolean functions by OBDDs
  Andre Gronemeier
  Lecture Notes in Computer Science 3153, 2004, pp. 251-262
• On approximation hardness of the minimum 2SAT-DELITION problem
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 3153, 2004, pp. 263-273
• Group coloring and list group coloring are \Pi^P_2-complete
  Daniel Král', Pavel Nejedlý
  Lecture Notes in Computer Science 3153, 2004, pp. 274-286
• Complexity results in graph reconstruction
  Edith Hemaspaandra, Lane A. Hemaspaandra, Stanisƚaw Radziszowski, Rahul Tripathi
  Lecture Notes in Computer Science 3153, 2004, pp. 287-297
• Generating paths and cuts in multi-pole (di)graphs
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
  Lecture Notes in Computer Science 3153, 2004, pp. 298-309
• Packing directed cycles efficiently
  Zeev Nutov, Raphael Yuster
  Lecture Notes in Computer Science 3153, 2004, pp. 310-321
• The complexity of membership problems for circuits over sets of integers
  Stephen D. Travers
  Lecture Notes in Computer Science 3153, 2004, pp. 322-333
• Some meet-in-the-middle circuit lower bounds
  Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
  Lecture Notes in Computer Science 3153, 2004, pp. 334-345
• The enumerability of collapses to NC
  Alina Beygelzimer, Mitsunori Ogihara
  Lecture Notes in Computer Science 3153, 2004, pp. 346-355