default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWPEC 2008: Victoria, BC, Canada
- Martin Grohe, Rolf Niedermeier:
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings. Lecture Notes in Computer Science 5018, Springer 2008, ISBN 978-3-540-79722-7 - Jianer Chen:
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters. 1-8 - Erik D. Demaine:
Algorithmic Graph Minors and Bidimensionality. 9 - Stephan Kreutzer:
Algorithmic Meta-theorems. 10-12 - Omid Amini, Ignasi Sau
, Saket Saurabh:
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. 13-29 - Yonatan Aumann, Yair Dombb:
Fixed Structure Complexity. 30-42 - Sebastian Böcker, Quang Bao Anh Bui, Anke Truß:
An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees. 43-54 - Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. 55-65 - Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. 66-77 - Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Capacitated Domination and Covering: A Parameterized Perspective. 78-90 - Khaled M. Elbassioni, Matthias Hagen, Imran Rauf:
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. 91-102 - Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond:
A Purely Democratic Characterization of W[1]. 103-114 - Sylvain Guillemot:
Parameterized Complexity and Approximability of the SLCS Problem. 115-128 - Sylvain Guillemot:
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs. 129-140 - Daniel Lokshtanov:
Wheel-Free Deletion Is W[2]-Hard. 141-147 - Moritz Müller:
Parameterized Derandomization. 148-159 - Hans L. Bodlaender, Eelko Penninkx:
A Linear Kernel for Planar Feedback Vertex Set. 160-171 - Allan Scott, Ulrike Stege:
Parameterized Chess. 172-189 - Patrick Traxler:
The Time Complexity of Constraint Satisfaction. 190-201 - Magnus Wahlström:
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. 202-213 - Johan M. M. van Rooij, Hans L. Bodlaender:
Exact Algorithms for Edge Domination. 214-225
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-31 23:35 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:
