| Publication | Date of Publication | Type |
|---|
| Structural parameterizations for two bounded degree problems revisited | 2025-01-06 | Paper |
| Parameterized max min feedback vertex set | 2024-12-03 | Paper |
| First order logic on Pathwidth revisited again | 2024-11-14 | Paper |
| Digraph coloring and distance to acyclicity | 2024-10-07 | Paper |
| Determining a Slater winner is complete for parallel access to NP | 2024-04-23 | Paper |
| Filling crosswords is very hard | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147536 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147538 | 2024-01-15 | Paper |
| In)approximability of Maximum Minimal FVS | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6089653 | 2023-11-13 | Paper |
| Improved (In-)Approximability Bounds for d-Scattered Set | 2023-07-03 | Paper |
| Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation | 2023-03-22 | Paper |
| Grundy distinguishes treewidth from pathwidth | 2023-02-07 | Paper |
| Parameterized Complexity of $$(A,\ell )$$-Path Packing | 2022-10-13 | Paper |
| New algorithms for mixed dominating set | 2022-09-30 | Paper |
| Grundy Distinguishes Treewidth from Pathwidth | 2022-08-18 | Paper |
| Token sliding on split graphs | 2022-07-18 | Paper |
| Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation | 2022-06-13 | Paper |
| Defective Coloring on Classes of Perfect Graphs | 2022-06-08 | Paper |
| Parameterized complexity of \((A,\ell)\)-path packing | 2022-03-22 | Paper |
| Structurally parameterized \(d\)-scattered set | 2022-01-05 | Paper |
| (In)approximability of maximum minimal FVS | 2021-11-25 | Paper |
| Token sliding on split graphs | 2021-08-05 | Paper |
| New results on directed edge dominating set | 2021-08-04 | Paper |
| Finer tight bounds for coloring on clique-width | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136270 | 2020-11-25 | Paper |
| Finer tight bounds for coloring on clique-width | 2020-10-29 | Paper |
| Parameterized complexity of safe set | 2020-09-04 | Paper |
| Independent set reconfiguration parameterized by modular-width | 2020-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116470 | 2020-08-25 | Paper |
| Parameterized orientable deletion | 2020-08-25 | Paper |
| Improved (In-)approximability bounds for \(d\)-scattered set | 2020-08-24 | Paper |
| How bad is the freedom to Flood-It? | 2020-08-11 | Paper |
| Parameterized (approximate) defective coloring | 2020-08-05 | Paper |
| Treewidth with a quantifier alternation revisited | 2020-05-27 | Paper |
| On the parameterized complexity of red-blue points separation | 2020-05-27 | Paper |
| Parameterized orientable deletion | 2020-05-21 | Paper |
| Parameterized (approximate) defective coloring | 2020-04-22 | Paper |
| Independent set reconfiguration parameterized by modular-width | 2020-02-24 | Paper |
| Parameterized complexity of safe set | 2020-02-06 | Paper |
| On the parameterized complexity of red-blue points separation | 2019-07-23 | Paper |
| Structural parameters, tight bounds, and approximation for \((k, r)\)-center | 2019-06-20 | Paper |
| How Bad is the Freedom to Flood-It? | 2019-02-14 | Paper |
| Parameterized power vertex cover | 2018-12-10 | Paper |
| Structurally parameterized \(d\)-scattered set | 2018-11-22 | Paper |
| QBF as an alternative to Courcelle's theorem | 2018-08-10 | Paper |
| The many facets of upper domination | 2018-03-13 | Paper |
| Time-approximation trade-offs for inapproximable problems | 2018-01-24 | Paper |
| Sub-exponential approximation schemes for CSPs: from dense to almost sparse | 2018-01-24 | Paper |
| Defective coloring on classes of perfect graphs | 2018-01-04 | Paper |
| Time-approximation trade-offs for inapproximable problems | 2017-11-14 | Paper |
| Complexity and approximability of parameterized MAX-CSPs | 2017-10-10 | Paper |
| Complexity and Approximability of Parameterized MAX-CSPs | 2017-09-29 | Paper |
| Parameterized power vertex cover | 2016-12-22 | Paper |
| Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective | 2016-11-09 | Paper |
| Upper domination: complexity and approximation | 2016-09-29 | Paper |
| Parameterized Algorithms for Parity Games | 2015-09-16 | Paper |
| New inapproximability bounds for TSP | 2015-08-31 | Paper |
| Improved inapproximability for TSP | 2014-10-06 | Paper |
| Parameterized Approximation Schemes Using Graph Widths | 2014-07-01 | Paper |
| Model checking lower bounds for simple graphs | 2014-04-09 | Paper |
| The computational complexity of the game of Set and its theoretical applications | 2014-03-31 | Paper |
| Quantum data and control made easier | 2014-01-17 | Paper |
| New inapproximability bounds for TSP | 2014-01-14 | Paper |
| Parameterized maximum path coloring | 2014-01-13 | Paper |
| Parameterized Algorithms for Modular-Width | 2013-12-10 | Paper |
| Model checking lower bounds for simple graphs | 2013-08-06 | Paper |
| A kernel of order \(2k-c\log k\) for vertex cover | 2013-04-04 | Paper |
| Algorithmic meta-theorems for restrictions of treewidth | 2012-11-21 | Paper |
| Parameterized modal satisfiability | 2012-11-21 | Paper |
| Improved inapproximability for TSP | 2012-11-02 | Paper |
| Local Improvement Gives Better Expanders | 2012-11-02 | Paper |
| On the algorithmic effectiveness of digraph decompositions and complexity measures | 2012-10-16 | Paper |
| Online maximum directed cut | 2012-10-01 | Paper |
| Periodic metro scheduling | 2012-09-28 | Paper |
| Ordered coloring of grids and related graphs | 2012-08-10 | Paper |
| Parameterized maximum path coloring | 2012-06-15 | Paper |
| Queen labelings | 2011-12-01 | Paper |
| Vertex cover problem parameterized above and below tight bounds | 2011-03-30 | Paper |
| Parameterized modal satisfiability | 2010-09-07 | Paper |
| Algorithmic meta-theorems for restrictions of treewidth | 2010-09-06 | Paper |
| Ordered coloring grids and related graphs | 2010-02-24 | Paper |
| Online Maximum Directed Cut | 2009-12-17 | Paper |
| The ferry cover problem | 2009-08-06 | Paper |
| On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures | 2009-01-29 | Paper |
| The Ferry Cover Problem | 2007-11-15 | Paper |
