Parametrized and exact computation. First international workshop, IWPEC 2004, Bergen, Norway, September 14--17, 2004. Proceedings. (Q1769768)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Damaschke, Peter}, Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, 1-12 [Zbl 1104.68538] \textit{Downey, Rodney G.; McCartin, Catherine}, Online problems, pathwidth, and persistence, 13-24 [Zbl 1104.68082] \textit{Haas, Robert; Hoffmann, Michael}, Chordless paths through three vertices, 25-36 [Zbl 1104.68539] \textit{Bodlaender, Hans L.; Thilikos, Dimitrios M.}, Computing small search numbers in linear time, 37-48 [Zbl 1104.68079] \textit{Weyer, Mark}, Bounded fixed-parameter tractability: The case \(2^{\text{poly}(k)}\), 49-60 [Zbl 1104.68053] \textit{Chandran, L. Sunil; Grandoni, Fabrizio}, Refined memorisation for vertex cover, 61-70 [Zbl 1104.68515] \textit{Marx, Dániel}, Parameterized graph separation problems, 71-82 [Zbl 1104.68543] \textit{Marx, Dániel}, Parameterized coloring problems on chordal graphs, 83-95 [Zbl 1104.68544] \textit{Hliněný, Petr; Seese, Detlef}, On decidability of MSO theories of representable matroids, 96-107 [Zbl 1104.03007] \textit{Chen, Yijia; Flum, Jörg}, On miniaturized problems in parameterized complexity theory, 108-120 [Zbl 1104.68513] \textit{Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.}, Smaller kernels for hitting set problems of constant arity, 121-126 [Zbl 1104.68519] \textit{Mathieson, Luke; Prieto, Elena; Shaw, Peter}, Packing edge disjoint triangles: A parameterized view, 127-137 [Zbl 1104.68518] \textit{Prieto, Elena; Sloper, Christian}, Looking at the stars, 138-148 [Zbl 1104.68546] \textit{Müller-Hannemann, Matthias; Weihe, Karsten}, Moving policies in cyclic assembly-line scheduling, 149-161 [Zbl 1104.90304] \textit{Guo, Jiong; Hüffner, Falk; Niedermeier, Rolf}, A structural view on parameterizing problems: Distance from triviality, 162-173 [Zbl 1104.68050] \textit{Gramm, Jens; Nierhoff, Till; Tantau, Till}, Perfect path phylogeny haplotyping with missing data is fixed-parameter tractable, 174-186 [Zbl 1104.68517] \textit{Buss, Jonathan F.; Islam, Tarique}, Simplifying the weft hierarchy, 187-199 [Zbl 1104.68512] \textit{Hoffmann, Michael; Okamoto, Yoshio}, The minimum weight triangulation problem with few inner points, 200-212 [Zbl 1104.65303] \textit{Abu-Khzam, Faisal N.; Langston, Michael A.}, A direct algorithm for the parameterized face cover problem, 213-222 [Zbl 1104.68514] \textit{Fellows, Michael R.; Szeider, Stefan; Wrightson, Graham}, On finding short resolution refutations and small unsatisfiable subsets, 223-234 [Zbl 1104.03308] \textit{Kanj, Iyad; Pelsmajer, Michael; Schaefer, Marcus}, Parameterized algorithms for feedback vertex set, 235-247 [Zbl 1104.68541] \textit{Fedin, Sergey S.; Kulikov, Alexander S.}, Automated proofs of upper bounds on the running time of splitting algorithms, 248-259 [Zbl 1104.68843] \textit{Raman, Venkatesh; Saurabh, Saket}, Improved parameterized algorithms for feedback set problems in weighted tournaments, 260-270 [Zbl 1104.68547] \textit{Dehne, Frank; Fellows, Mike; Rosamond, Frances; Shaw, Peter}, Greedy localization, iterative compression, and modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel \(2k\) kernelization for vertex cover, 271-280 [Zbl 1104.68516] \textit{Woeginger, Gerhard J.}, Space and time complexity of exact algorithms: Some open problems, 281-290 [Zbl 1104.68520] \textit{Langston, Mike}, Practical FPT implementations and applications, 291 [Zbl 1104.68829]