| Publication | Date of Publication | Type |
|---|
| Cluster editing for multi-layer and temporal graphs | 2024-11-12 | Paper |
| On kernels for \(d\)-path vertex cover | 2024-08-06 | Paper |
| On kernels for \(d\)-path vertex cover | 2024-07-01 | Paper |
| Generating Faster Algorithms for d-Path Vertex Cover | 2024-05-03 | Paper |
| Maximizing Social Welfare in Score-Based Social Distance Games | 2024-02-28 | Paper |
| Hedonic diversity games: a complexity picture with more than two colors | 2023-12-14 | Paper |
| Minimum eccentricity shortest path problem with respect to structural parameters | 2023-03-09 | Paper |
| Constant factor approximation for tracking paths and fault tolerant feedback vertex set | 2023-03-03 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
| Polynomial kernels for tracking shortest paths | 2022-10-28 | Paper |
| Constant factor approximation for tracking paths and fault tolerant feedback vertex set | 2022-10-19 | Paper |
| Cluster Editing in Multi-Layer and Temporal Graphs. | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092393 | 2022-07-21 | Paper |
| Complexity of the Steiner Network Problem with Respect to the Number of Terminals | 2022-07-18 | Paper |
| On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations | 2022-07-03 | Paper |
| Minimum eccentricity shortest path problem with respect to structural parameters | 2022-03-22 | Paper |
| A parameterized complexity view on collapsing \(k\)-cores | 2021-12-18 | Paper |
| Waypoint routing on bounded treewidth graphs | 2021-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009469 | 2021-08-04 | Paper |
| A tight lower bound for planar Steiner orientation | 2019-06-27 | Paper |
| A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching | 2019-03-14 | Paper |
| The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs | 2019-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634388 | 2018-04-10 | Paper |
| Extending the kernel for planar Steiner tree to the number of Steiner vertices | 2017-10-10 | Paper |
| A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack | 2017-09-01 | Paper |
| Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) | 2017-04-25 | Paper |
| Fixed-parameter algorithms for DAG partitioning | 2017-02-06 | Paper |
| Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound | 2017-01-26 | Paper |
| On Directed Steiner Trees with Multiple Roots | 2016-12-22 | Paper |
| Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) | 2016-07-22 | Paper |
| Polynomial-Time Data Reduction for the Subset Interconnection Design Problem | 2015-11-27 | Paper |
| On the parameterized complexity of computing balanced partitions in graphs | 2015-09-04 | Paper |
| A refined complexity analysis of degree anonymization in graphs | 2015-06-09 | Paper |
| On structural parameterizations for the 2-club problem | 2015-04-28 | Paper |
| On explaining integer vectors by few homogeneous segments | 2015-02-20 | Paper |
| On structural parameterizations for the 2-club problem | 2014-11-04 | Paper |
| Solving Multicut Faster Than 2 n | 2014-10-08 | Paper |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda | 2014-07-30 | Paper |
| Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound | 2014-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403059 | 2014-03-25 | Paper |
| Effective and Efficient Data Reduction for the Subset Interconnection Design Problem | 2014-01-14 | Paper |
| On the Parameterized Complexity of Computing Graph Bisections | 2013-12-06 | Paper |
| An FPT algorithm for Tree Deletion Set | 2013-11-28 | Paper |
| The parameterized complexity of local search for TSP, more refined | 2013-11-11 | Paper |
| Parameterized Complexity of Directed Steiner Tree on Sparse Graphs | 2013-09-17 | Paper |
| On Explaining Integer Vectors by Few Homogenous Segments | 2013-08-12 | Paper |
| A Refined Complexity Analysis of Degree Anonymization in Graphs | 2013-08-07 | Paper |
| Parameterized Complexity of DAG Partitioning | 2013-06-07 | Paper |
| An FPT Algorithm for Tree Deletion Set | 2013-04-12 | Paper |
| Feedback vertex set on graphs of low clique-width | 2013-01-24 | Paper |
| Parameterized complexity of generalized domination problems | 2012-05-11 | Paper |
| The Parameterized Complexity of Local Search for TSP, More Refined | 2011-12-16 | Paper |
| Parameterized Complexity of Arc-Weighted Directed Steiner Problems | 2011-10-27 | Paper |
| Clustered planarity: small clusters in cycles and Eulerian graphs | 2010-02-04 | Paper |
| Parameterized Complexity of Generalized Domination Problems | 2010-01-21 | Paper |
| What makes equitable connected partition easy | 2010-01-14 | Paper |
| Parameterized complexity of arc-weighted directed Steiner problems | 2009-12-17 | Paper |
| Clustered Planarity: Clusters with Few Outgoing Edges | 2009-03-03 | Paper |
| Clustered Planarity: Small Clusters in Eulerian Graphs | 2008-03-25 | Paper |
