default search action
IWPEC 2009: Copenhagen, Denmark
- Jianer Chen, Fedor V. Fomin:
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5917, Springer 2009, ISBN 978-3-642-11268-3 - Noga Alon, Shai Gutner:
Balanced Hashing, Color Coding and Approximate Counting. 1-16 - Hans L. Bodlaender
:
Kernelization: New Upper and Lower Bound Techniques. 17-37 - Sebastian Böcker
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. 38-49 - Hans L. Bodlaender
Planar Capacitated Dominating Set Is W[1]-Hard. 50-60 - Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Boolean-Width of Graphs. 61-74 - Chris Calabro, Russell Impagliazzo
The Complexity of Satisfiability of Small Depth Circuits. 75-85 - Jean Daligault, Stéphan Thomassé
On Finding Directed Trees with Many Leaves. 86-97 - Peter Damaschke:
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. 98-109 - Peter Damaschke:
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. 110-121 - Rosa Enciso, Michael R. Fellows
What Makes Equitable Connected Partition Easy. 122-133 - Rok Erman, Lukasz Kowalik, Matjaz Krnc
Improved Induced Matchings in Sparse Graphs. 134-148 - Michael R. Fellows
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. 149-160 - Henning Fernau
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. 161-172 - Martin Fürer
An Exponential Time 2-Approximation Algorithm for Bandwidth. 173-184 - Robert Ganian
On Digraph Width Measures in Parameterized Algorithmics. 185-197 - Panos Giannopoulos, Christian Knauer, Günter Rote:
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. 198-209 - Petr A. Golovach
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. 210-221 - Gregory Z. Gutin, Daniel Karapetyan
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. 222-233 - Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. 234-245 - Shai Gutner:
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. 246-257 - Mikko Koivisto:
Partitioning into Sets of Bounded Cardinality. 258-263 - Stefan Kratsch, Magnus Wahlström:
Two Edge Modification Problems without Polynomial Kernels. 264-275 - Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
On the Directed Degree-Preserving Spanning Tree Problem. 276-287 - Daniel Lokshtanov, Saket Saurabh:
Even Faster Algorithm for Set Splitting! 288-299 - Dániel Marx, Ildikó Schlotter
Stable Assignment with Couples: Parameterized Complexity and Local Search. 300-311 - Narges Simjour:
Improved Parameterized Algorithms for the Kemeny Aggregation Problem. 312-323 - Karol Suchan
Computing Pathwidth Faster Than 2n. 324-335
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 2024-11-22 19:50 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: