search
search
reviewers
reviewers
feeds
feeds
assignments
assignments

settings
logout

IWPEC

Keyphrases

Publications

2009

Peter Damaschke
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. IWPEC (2009)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
On Digraph Width Measures in Parameterized Algorithmics. IWPEC (2009)
Dániel Marx, Ildikó Schlotter
Stable Assignment with Couples: Parameterized Complexity and Local Search. IWPEC (2009)
Jean Daligault, Stéphan Thomassé
On Finding Directed Trees with Many Leaves. IWPEC (2009)
Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. IWPEC (2009)
Gregory Z. Gutin, Daniel Karapetyan, Igor Razgon
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs. IWPEC (2009)
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
[1]-Hard. IWPEC (2009)
Chris Calabro, Russell Impagliazzo, Ramamohan Paturi
The Complexity of Satisfiability of Small Depth Circuits. IWPEC (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Boolean-Width of Graphs. IWPEC (2009)
Mikko Koivisto
Partitioning into Sets of Bounded Cardinality. IWPEC (2009)
Noga Alon, Shai Gutner
Balanced Hashing, Color Coding and Approximate Counting. IWPEC (2009)
Hans L. Bodlaender
Kernelization: New Upper and Lower Bound Techniques. IWPEC (2009)
Panos Giannopoulos, Christian Knauer, Günter Rote
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC (2009)
Petr A. Golovach, Dimitrios M. Thilikos
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC (2009)
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý
What Makes Equitable Connected Partition Easy. IWPEC (2009)
Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan
An Exponential Time 2-Approximation Algorithm for Bandwidth. IWPEC (2009)
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC (2009)
Peter Damaschke
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. IWPEC (2009)
Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC (2009)
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen
Improved Induced Matchings in Sparse Graphs. IWPEC (2009)
Karol Suchan, Yngve Villanger
. IWPEC (2009)
Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC (2009)
Daniel Lokshtanov, Saket Saurabh
Even Faster Algorithm for Set Splitting! IWPEC (2009)
Narges Simjour
Improved Parameterized Algorithms for the Kemeny Aggregation Problem. IWPEC (2009)
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
On the Directed Degree-Preserving Spanning Tree Problem. IWPEC (2009)
Shai Gutner
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor. IWPEC (2009)
Stefan Kratsch, Magnus Wahlström
Two Edge Modification Problems without Polynomial Kernels. IWPEC (2009)

volume 5917, 2009

Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers IWPEC 5917 (2009)

2008

volume 5018, 2008

Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings IWPEC 5018 (2008)

volume 4169, 2006

Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings IWPEC 4169 (2006)