| Publication | Date of Publication | Type |
|---|
| Editing to cliques: a survey of FPT results and recent applications in analyzing large datasets | 2024-04-22 | Paper |
| On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves | 2023-10-04 | Paper |
| What Is Known About Vertex Cover Kernelization? | 2023-06-30 | Paper |
| A Survey on the Complexity of Flood-Filling Games | 2023-06-30 | Paper |
| Collaborating with Hans: Some Remaining Wonderments | 2022-10-19 | Paper |
| Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory | 2022-03-02 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2019-12-06 | Paper |
| Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number | 2018-05-24 | Paper |
| A brief history of Edward K. Blum and the Journal of Computer and System Sciences | 2018-04-18 | Paper |
| Parameterized approximation via fidelity preserving transformations | 2017-12-21 | Paper |
| The Flood-It game parameterized by the vertex cover number | 2016-10-17 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2016-02-19 | Paper |
| Distortion is Fixed Parameter Tractable | 2015-09-24 | Paper |
| Clique-width minimization is NP-hard | 2014-11-25 | Paper |
| Multivariate Complexity Theory | 2014-02-21 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2014-01-14 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2013-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843923 | 2013-08-27 | Paper |
| Parameterized Approximation via Fidelity Preserving Transformations | 2013-08-12 | Paper |
| Constraint satisfaction problems: convexity makes AllDifferent constraints tractable | 2013-03-04 | Paper |
| Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity | 2013-01-24 | Paper |
| Parameterizing by the number of numbers | 2012-12-06 | Paper |
| Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications | 2012-11-21 | Paper |
| Passion Plays: Melodramas about Mathematics | 2012-09-05 | Paper |
| Computer Science Unplugged and Related Projects in Math and Computer Science Popularization | 2012-09-05 | Paper |
| Determining the winner of a Dodgson election is hard | 2012-08-29 | Paper |
| Local search: is brute-force avoidable? | 2012-08-17 | Paper |
| The parameterized complexity of stabbing rectangles | 2012-04-26 | Paper |
| Quadratic kernelization for convex recoloring of trees | 2011-09-20 | Paper |
| On the complexity of some colorful problems parameterized by treewidth | 2011-02-21 | Paper |
| Parameterizing by the number of numbers | 2010-12-07 | Paper |
| Milling a Graph with Turn Costs: A Parameterized Complexity Perspective | 2010-11-16 | Paper |
| Parameterized approximation of dominating set problems | 2010-06-09 | Paper |
| Clique-Width is NP-Complete | 2010-06-01 | Paper |
| W-hierarchies defined by symmetric gates | 2010-05-10 | Paper |
| Clustering with partial information | 2010-03-09 | Paper |
| What Makes Equitable Connected Partition Easy | 2010-01-14 | Paper |
| Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs | 2010-01-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Fixed-parameter algorithms for Kemeny rankings | 2009-11-04 | Paper |
| The complexity ecology of parameters: An illustration using bounded max leaf number | 2009-10-19 | Paper |
| Distortion Is Fixed Parameter Tractable | 2009-07-14 | Paper |
| Haplotype Inference Constrained by Plausible Haplotype Data | 2009-07-07 | Paper |
| Connected Coloring Completion for General Graphs: Algorithms and Complexity | 2009-03-06 | Paper |
| Quadratic Kernelization for Convex Recoloring of Trees | 2009-03-06 | Paper |
| On the Complexity of Some Colorful Problems Parameterized by Treewidth | 2009-03-03 | Paper |
| Parameterized Complexity of Stabbing Rectangles and Squares in the Plane | 2009-02-24 | Paper |
| On the parameterized complexity of multiple-interval graph problems | 2009-02-19 | Paper |
| Clustering with Partial Information | 2009-02-03 | Paper |
| Graph Layout Problems Parameterized by Vertex Cover | 2009-01-29 | Paper |
| Leaf Powers and Their Properties: Using the Trees | 2009-01-29 | Paper |
| Faster fixed-parameter tractable algorithms for matching and packing problems | 2008-12-02 | Paper |
| On the parameterized complexity of layered graph drawing | 2008-12-02 | Paper |
| Fixed-Parameter Algorithms for Kemeny Scores | 2008-07-10 | Paper |
| A Purely Democratic Characterization of W[1] | 2008-06-05 | Paper |
| The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel | 2008-06-03 | Paper |
| An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem | 2007-12-19 | Paper |
| The complexity of polynomial-time approximation | 2007-12-19 | Paper |
| On complexity of lobbying in multiple referenda | 2007-12-06 | Paper |
| The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number | 2007-11-13 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043700 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472448 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796197 | 2003-03-02 | Paper |
