| 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 brief history of Edward K. Blum and the Journal of Computer and System Sciences. | 0 | 0.34 | 2018 |
| A Survey on the Complexity of Flood-Filling Games. | 0 | 0.34 | 2018 |
| Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You. | 0 | 0.34 | 2016 |
| Satisfying more than half of a system of linear equations over GF(2): A multivariate approach | 5 | 0.43 | 2014 |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem. | 0 | 0.34 | 2013 |
| Myhill-Nerode Methods for Hypergraphs. | 3 | 0.38 | 2013 |
| Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity | 23 | 0.72 | 2013 |
| Fpt Is Characterized By Useful Obstruction Sets | 1 | 0.35 | 2013 |
| The Parameterized Complexity of Abduction. | 6 | 0.44 | 2012 |
| Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications | 9 | 0.54 | 2012 |
| How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding | 1 | 0.37 | 2012 |
| Train marshalling is fixed parameter tractable | 4 | 0.47 | 2012 |
| Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). | 7 | 0.48 | 2012 |
| The Parameterized Complexity of Stabbing Rectangles | 1 | 0.35 | 2012 |
| Facility location problems: A parameterized view | 10 | 0.64 | 2011 |
| Haplotype Inference Constrained by Plausible Haplotype Data | 2 | 0.38 | 2011 |
| Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable | 2 | 0.39 | 2011 |
| On the complexity of some colorful problems parameterized by treewidth | 37 | 1.51 | 2011 |
| Recent developments in the theory of pre-processing | 0 | 0.34 | 2011 |
| Special Issue on Parameterized Complexity of Discrete Optimization | 0 | 0.34 | 2011 |
| Parameterized complexity of the firefighter problem | 3 | 0.44 | 2011 |
| Upper and lower bounds for finding connected motifs in vertex-colored graphs | 29 | 1.05 | 2011 |
| A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems | 8 | 0.58 | 2011 |
| Parameterized Control Complexity in Fallback Voting | 1 | 0.35 | 2010 |
| A linear kernel for co-path/cycle packing | 7 | 0.48 | 2010 |
| Parameterizing by the Number of Numbers | 16 | 0.87 | 2010 |
| Determining the Winner of a Dodgson Election is Hard | 2 | 0.64 | 2010 |
| The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number | 25 | 0.95 | 2009 |
| Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs | 6 | 0.47 | 2009 |
| Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology | 34 | 1.06 | 2009 |
| The Parameterized Complexity of Some Minimum Label Problems | 11 | 0.65 | 2009 |
| Clique-Width is NP-Complete | 55 | 1.43 | 2009 |
| Local search: is brute-force avoidable? | 19 | 0.69 | 2009 |
| A generalization of Nemhauser and Trotter's local optimization theorem | 29 | 1.08 | 2009 |
| Fixed-Parameter Algorithms for Kemeny Scores | 23 | 1.19 | 2008 |
| Parameterized Low-distortion Embeddings - Graph metrics into lines and trees | 5 | 0.78 | 2008 |
| A purely democratic characterization of W[1] | 0 | 0.34 | 2008 |
| The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors | 1 | 0.39 | 2008 |
| On Problems without Polynomial Kernels (Extended Abstract) | 50 | 2.13 | 2008 |
| On the Parameterized Complexity of Layered Graph Drawing | 30 | 1.54 | 2008 |
| Parameterized Algorithms and Hardness Results for Some Graph Motif Problems | 24 | 1.04 | 2008 |
| The Complexity of Polynomial-Time Approximation | 13 | 0.55 | 2007 |
| Efficient parameterized preprocessing for cluster editing | 27 | 1.08 | 2007 |
| A Fixed-Parameter Approach to 2-Layer Planarization | 7 | 0.54 | 2006 |
| Clique-width minimization is NP-hard | 32 | 1.20 | 2006 |
| Kernelization for Convex Recoloring | 4 | 0.52 | 2006 |
| The lost continent of polynomial time: preprocessing and kernelization | 21 | 0.80 | 2006 |
