IWPEC 2004: Bergen, Norway

• Peter Damaschke:
  Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. 1-12
  Electronic Edition (link) BibTeX
• Rodney G. Downey, Catherine McCartin:
  Online Problems, Pathwidth, and Persistence. 13-24
  Electronic Edition (link) BibTeX
• Robert Haas, Michael Hoffmann:
  Chordless Paths Through Three Vertices. 25-36
  Electronic Edition (link) BibTeX
• Hans L. Bodlaender, Dimitrios M. Thilikos:
  Computing Small Search Numbers in Linear Time. 37-48
  Electronic Edition (link) BibTeX
• Mark Weyer:
  Bounded Fixed-Parameter Tractability: The Case 2poly(k). 49-60
  Electronic Edition (link) BibTeX
• L. Sunil Chandran, Fabrizio Grandoni:
  Refined Memorisation for Vertex Cover. 61-70
  Electronic Edition (link) BibTeX
• Dániel Marx:
  Parameterized Graph Separation Problems. 71-82
  Electronic Edition (link) BibTeX
• Dániel Marx:
  Parameterized Coloring Problems on Chordal Graphs. 83-95
  Electronic Edition (link) BibTeX
• Petr Hlinený, Detlef Seese:
  On Decidability of MSO Theories of Representable Matroids. 96-107
  Electronic Edition (link) BibTeX
• Yijia Chen, Jörg Flum:
  On Miniaturized Problems in Parameterized Complexity Theory. 108-120
  Electronic Edition (link) BibTeX
• Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
  Smaller Kernels for Hitting Set Problems of Constant Arity. 121-126
  Electronic Edition (link) BibTeX
• Luke Mathieson, Elena Prieto, Peter Shaw:
  Packing Edge Disjoint Triangles: A Parameterized View. 127-137
  Electronic Edition (link) BibTeX
• Elena Prieto, Christian Sloper:
  Looking at the Stars. 138-148
  Electronic Edition (link) BibTeX
• Matthias Müller-Hannemann, Karsten Weihe:
  Moving Policies in Cyclic Assembly-Line Scheduling. 149-161
  Electronic Edition (link) BibTeX
• Jiong Guo, Falk Hüffner, Rolf Niedermeier:
  A Structural View on Parameterizing Problems: Distance from Triviality. 162-173
  Electronic Edition (link) BibTeX
• Jens Gramm, Till Nierhoff, Till Tantau:
  Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. 174-186
  Electronic Edition (link) BibTeX
• Jonathan F. Buss, Tarique Islam:
  Simplifying the Weft Hierarchy. 187-199
  Electronic Edition (link) BibTeX
• Michael Hoffmann, Yoshio Okamoto:
  The Minimum Weight Triangulation Problem with Few Inner Points. 200-212
  Electronic Edition (link) BibTeX
• Faisal N. Abu-Khzam, Michael A. Langston:
  A Direct Algorithm for the Parameterized Face Cover Problem. 213-222
  Electronic Edition (link) BibTeX
• Michael R. Fellows, Stefan Szeider, Graham Wrightson:
  On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. 223-234
  Electronic Edition (link) BibTeX
• Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer:
  Parameterized Algorithms for Feedback Vertex Set. 235-247
  Electronic Edition (link) BibTeX
• Sergey S. Fedin, Alexander S. Kulikov:
  Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. 248-259
  Electronic Edition (link) BibTeX
• Venkatesh Raman, Saket Saurabh:
  Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. 260-270
  Electronic Edition (link) BibTeX
• Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
  Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. 271-280
  Electronic Edition (link) BibTeX
• Gerhard J. Woeginger:
  Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). 281-290
  Electronic Edition (link) BibTeX
• Michael A. Langston:
  Practical FPT Implementations and Applications (Invited Talk). 291-292
  Electronic Edition (link) BibTeX