default search action
IPEC 2011: Saarbrücken, Germany
- Dániel Marx, Peter Rossmanith:
Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Lecture Notes in Computer Science 7112, Springer 2012, ISBN 978-3-642-28049-8 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
On Multiway Cut Parameterized above Lower Bounds. 1-12 - Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized Complexity of Firefighting Revisited. 13-26 - Minghui Jiang, Yong Zhang:
Parameterized Complexity in Multiple-Interval Graphs: Domination. 27-40 - Yoichi Iwata:
A Faster Algorithm for Dominating Set Analyzed by the Potential Method. 41-54 - Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. 55-66 - Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Increasing the Minimum Degree of a Graph by Contractions. 67-79 - Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos:
Planar Disjoint-Paths Completion. 80-93 - Peter Damaschke:
Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing. 94-105 - Alexander Golovnev:
New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree. 106-117 - Eun Jung Kim, Ryan Williams:
Improved Parameterized Algorithms for above Average Constraint Satisfaction. 118-131 - Bart M. P. Jansen, Stefan Kratsch:
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal. 132-144 - Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Path and Cycle Problems. 145-158 - Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
On the Hardness of Losing Width. 159-168 - Jiong Guo, Iyad A. Kanj, Stefan Kratsch:
Safe Approximation and Its Relation to Kernelization. 169-180 - Torben Hagerup:
Simpler Linear-Time Kernelization for Planar Dominating Set. 181-193 - René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller:
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. 194-206 - Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. 207-218 - Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle:
Finding Good Decompositions for Dynamic Programming on Dense Graphs. 219-231 - Michael Lampis:
Parameterized Maximum Path Coloring. 232-245 - Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
On Cutwidth Parameterized by Vertex Cover. 246-258 - Robert Ganian:
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. 259-271
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.