default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWPEC 2004: Bergen, Norway
- Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne:
Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3162, Springer 2004, ISBN 3-540-23071-8 - Peter Damaschke:
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. 1-12 - Rodney G. Downey, Catherine McCartin:
Online Problems, Pathwidth, and Persistence. 13-24 - Robert Haas, Michael Hoffmann:
Chordless Paths Through Three Vertices. 25-36 - Hans L. Bodlaender, Dimitrios M. Thilikos:
Computing Small Search Numbers in Linear Time. 37-48 - Mark Weyer:
Bounded Fixed-Parameter Tractability: The Case 2poly(k). 49-60 - L. Sunil Chandran, Fabrizio Grandoni:
Refined Memorisation for Vertex Cover. 61-70 - Dániel Marx:
Parameterized Graph Separation Problems. 71-82 - Dániel Marx
:
Parameterized Coloring Problems on Chordal Graphs. 83-95 - Petr Hlinený, Detlef Seese:
On Decidability of MSO Theories of Representable Matroids. 96-107 - Yijia Chen, Jörg Flum:
On Miniaturized Problems in Parameterized Complexity Theory. 108-120 - Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Smaller Kernels for Hitting Set Problems of Constant Arity. 121-126 - Luke Mathieson, Elena Prieto-Rodriguez, Peter Shaw:
Packing Edge Disjoint Triangles: A Parameterized View. 127-137 - Elena Prieto-Rodriguez, Christian Sloper:
Looking at the Stars. 138-148 - Matthias Müller-Hannemann, Karsten Weihe:
Moving Policies in Cyclic Assembly-Line Scheduling. 149-161 - Jiong Guo, Falk Hüffner, Rolf Niedermeier:
A Structural View on Parameterizing Problems: Distance from Triviality. 162-173 - Jens Gramm, Till Nierhoff, Till Tantau:
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable. 174-186 - Jonathan F. Buss, Tarique Islam:
Simplifying the Weft Hierarchy. 187-199 - Michael Hoffmann, Yoshio Okamoto:
The Minimum Weight Triangulation Problem with Few Inner Points. 200-212 - Faisal N. Abu-Khzam, Michael A. Langston:
A Direct Algorithm for the Parameterized Face Cover Problem. 213-222 - Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. 223-234 - Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer:
Parameterized Algorithms for Feedback Vertex Set. 235-247 - Sergey S. Fedin, Alexander S. Kulikov:
Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms. 248-259 - Venkatesh Raman, Saket Saurabh:
Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. 260-270 - 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 - Gerhard J. Woeginger:
Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk). 281-290 - Michael A. Langston:
Practical FPT Implementations and Applications (Invited Talk). 291-292
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-30 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
