| Publication | Date of Publication | Type |
|---|
| Roman census: enumerating and counting Roman dominating functions on graph classes | 2024-12-03 | Paper |
| Minimal Roman dominating functions: extensions and enumeration | 2024-05-30 | Paper |
| A Linear Kernel for Planar Vector Domination | 2023-12-14 | Paper |
| Minimal Roman dominating functions: extensions and enumeration | 2023-05-05 | Paper |
| An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion | 2023-05-02 | Paper |
| An improved exact algorithm for minimum dominating set in chordal graphs | 2021-12-14 | Paper |
| A Note on the Maximum Number of Minimal Connected Dominating Sets in a Graph | 2021-11-10 | Paper |
| Parameterized Dynamic Variants of Red-Blue Dominating Set | 2020-07-20 | Paper |
| Partitioning a graph into degenerate subgraphs | 2019-11-28 | Paper |
| Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks | 2019-09-05 | Paper |
| Efficient parallel algorithms for parameterized problems | 2019-08-20 | Paper |
| Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity | 2019-04-26 | Paper |
| Clustering with lower-bounded sizes. A general graph-theoretic framework | 2018-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636485 | 2018-04-19 | Paper |
| On the complexity of multi-parameterized cluster editing | 2017-10-06 | Paper |
| On the complexity of various parameterizations of common induced subgraph isomorphism | 2017-09-28 | Paper |
| On the Parameterized Parallel Complexity and the Vertex Cover Problem | 2017-02-01 | Paper |
| The Monotone Circuit Value Problem with Bounded Genus Is in NC | 2016-09-02 | Paper |
| Enumerating minimal dominating sets in chordal graphs | 2016-08-16 | Paper |
| Data reductions and combinatorial bounds for improved approximation algorithms | 2015-12-30 | Paper |
| On the complexity of various parameterizations of common induced subgraph isomorphism | 2015-09-15 | Paper |
| Approximation Algorithms Inspired by Kernelization Methods | 2015-09-11 | Paper |
| Partitioning a graph into disjoint cliques and a triangle-free graph | 2015-07-06 | Paper |
| Maximum common induced subgraph parameterized by vertex cover | 2014-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403032 | 2014-03-25 | Paper |
| The Multi-parameterized Cluster Editing Problem | 2013-12-10 | Paper |
| Charge and reduce: A fixed-parameter algorithm for string-to-string correction | 2012-10-16 | Paper |
| An improved kernelization algorithm for \(r\)-set packing | 2012-03-19 | Paper |
| An exact algorithm for connected red-blue dominating set | 2011-08-23 | Paper |
| Graph Coloring and the Immersion Order | 2011-03-18 | Paper |
| A Hybrid Graph Representation for Recursive Backtracking Algorithms | 2010-09-07 | Paper |
| A kernelization algorithm for \(d\)-hitting set | 2010-08-18 | Paper |
| An Exact Algorithm for Connected Red-Blue Dominating Set | 2010-05-28 | Paper |
| Linear-time algorithms for problems on planar graphs with fixed disk dimension | 2010-01-29 | Paper |
| A Quadratic Kernel for 3-Set Packing | 2009-06-03 | Paper |
| A bounded search tree algorithm for parameterized face cover | 2009-02-23 | Paper |
| Kernelization Algorithms for d-Hitting Set Problems | 2009-02-17 | Paper |
| Kernels: Annotated, Proper and Induced | 2008-06-03 | Paper |
| Crown structures for vertex cover kernelization | 2007-12-19 | Paper |
| Pseudo-kernelization: A branch-then-Reduce approach for FPT problems | 2007-12-19 | Paper |
| Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs | 2007-05-29 | Paper |
| Scalable parallel algorithms for FPT problems | 2006-09-12 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
