| Publication | Date of Publication | Type |
|---|
| A constant-factor approximation for weighted bond cover | 2025-01-27 | Paper |
| Twin-width. III: Max independent set, min dominating set, and coloring | 2024-11-01 | Paper |
| Representing matroids over the reals is \(\exists \mathbb{R}\)-complete | 2024-09-17 | Paper |
| Twin-width. VI: The lens of contraction sequences | 2024-07-19 | Paper |
| Flow-augmentation. III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints | 2024-05-14 | Paper |
| Twin-width and polynomial kernels | 2024-02-12 | Paper |
| Twin-width. II: Small classes | 2024-01-15 | Paper |
| Grundy Coloring and friends, half-graphs, bicliques | 2023-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874335 | 2023-02-07 | Paper |
| Grundy distinguishes treewidth from pathwidth | 2023-02-07 | Paper |
| EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs | 2022-12-08 | Paper |
| Twin-width II: small classes | 2022-11-23 | Paper |
| Algorithmic applications of tree-cut width | 2022-11-15 | Paper |
| Twin-width and polynomial kernels | 2022-10-27 | Paper |
| Grundy Distinguishes Treewidth from Pathwidth | 2022-08-18 | Paper |
| Token sliding on split graphs | 2022-07-18 | Paper |
| Sum-of-Products with Default Values: Algorithms and Complexity Results | 2022-05-16 | Paper |
| Twin-width VIII: delineation and win-wins | 2022-04-01 | Paper |
| Twin-width. I: Tractable FO model checking | 2022-03-31 | Paper |
| Twin-width VI: the lens of contraction sequences | 2021-10-30 | Paper |
| On the tree-width of even-hole-free graphs | 2021-09-02 | Paper |
| Token sliding on split graphs | 2021-08-05 | Paper |
| New results on directed edge dominating set | 2021-08-04 | Paper |
| Twin-width and polynomial kernels | 2021-07-06 | Paper |
| Complexity and algorithms for constant diameter augmentation problems | 2020-10-01 | Paper |
| QPTAS and subexponential algorithm for maximum clique on disk graphs | 2020-08-18 | Paper |
| Twin-width III: Max Independent Set, Min Dominating Set, and Coloring | 2020-07-28 | Paper |
| Grundy Coloring & friends, Half-Graphs, Bicliques | 2020-01-11 | Paper |
| Linear kernels and single-exponential algorithms via protrusion decompositions | 2018-10-30 | Paper |
| Complexity of Grundy coloring and its variants | 2018-05-24 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2018-02-28 | Paper |
| Complexity and approximability of parameterized MAX-CSPs | 2017-10-10 | Paper |
| Complexity and Approximability of Parameterized MAX-CSPs | 2017-09-29 | Paper |
| An FPT 2-approximation for tree-cut decomposition | 2016-02-26 | Paper |
| Complexity of Grundy coloring and its variants | 2015-10-29 | Paper |
| Algorithmic applications of tree-cut width | 2015-09-16 | Paper |
| On subexponential and FPT-time inapproximability | 2015-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417644 | 2014-05-22 | Paper |
| The complexity of repairing, adjusting, and aggregating of extensions in abstract argumentation | 2014-03-31 | Paper |
| On subexponential and FPT-time inapproximability | 2013-12-10 | Paper |
| Linear kernels and single-exponential algorithms via protrusion decompositions | 2013-08-06 | Paper |
| Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming | 2012-11-21 | Paper |
| Algorithms and complexity results for persuasive argumentation | 2011-11-17 | Paper |
| Solving MAX-\(r\)-SAT above a tight lower bound | 2011-11-07 | Paper |
| Vertex cover problem parameterized above and below tight bounds | 2011-03-30 | Paper |
| A probabilistic approach to problems parameterized above or below tight bounds | 2011-03-28 | Paper |
| Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming | 2010-12-07 | Paper |
| Betweenness parameterized above tight lower bound | 2010-10-07 | Paper |
| Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs | 2010-06-07 | Paper |
| The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops | 2010-05-05 | Paper |
| On complexity of minimum leaf out-branching problem | 2010-04-28 | Paper |
| FPT algorithms and kernels for the directed \(k\)-leaf problem | 2010-02-12 | Paper |
| A probabilistic approach to problems parameterized above or below tight bounds | 2010-01-14 | Paper |
| Properly coloured cycles and paths: Results and open problems | 2010-01-07 | Paper |
| Minimum leaf out-branching and related problems | 2009-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615793 | 2009-03-24 | Paper |
| Minimum Leaf Out-Branching Problems | 2008-07-10 | Paper |
