Collaborating with Hans - Some Remaining Wonderments. | 0 | 0.34 | 2020 |
Diversity in Combinatorial Optimization. | 0 | 0.34 | 2019 |
What Is Known About Vertex Cover Kernelization? | 0 | 0.34 | 2018 |
A Survey on the Complexity of Flood-Filling Games. | 0 | 0.34 | 2018 |
The Flood-It game parameterized by the vertex cover number | 0 | 0.34 | 2015 |
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding | 1 | 0.37 | 2012 |
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees | 5 | 0.78 | 2008 |
Kernelization for Convex Recoloring | 4 | 0.52 | 2006 |
FPT is P-Time Extremal Structure I | 45 | 1.87 | 2005 |
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width | 8 | 0.61 | 2005 |
Proving NP-hardness for clique-width II: non-approximability of clique-width | 10 | 0.55 | 2005 |
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems | 24 | 1.37 | 2000 |