| Publication | Date of Publication | Type |
|---|
| Serial batching to minimize the weighted number of tardy jobs | 2025-01-07 | Paper |
| Space-efficient parameterized algorithms on graphs of low shrubdepth | 2025-01-06 | Paper |
| A \((3/2+\varepsilon)\)-approximation for multiple TSP with a variable number of depots | 2025-01-06 | Paper |
| Hitting Weighted Even Cycles in Planar Graphs | 2023-11-20 | Paper |
| No Polynomial Kernels for Knapsack | 2023-08-24 | Paper |
| High-multiplicity \(N\)-fold IP via configuration LP | 2023-05-25 | Paper |
| Dynamic Parameterized Problems and Algorithms | 2023-04-26 | Paper |
| Parameterized algorithms for generalizations of directed feedback vertex set | 2023-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875550 | 2023-02-03 | Paper |
| A 3/2-Approximation for the Metric Many-Visits Path TSP | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089171 | 2022-07-18 | Paper |
| Parameterized complexity of configuration integer programs | 2022-03-11 | Paper |
| New approximation algorithms for \((1,2)\)-TSP | 2021-07-28 | Paper |
| Reachability Switching Games | 2021-07-28 | Paper |
| Reachability switching games | 2021-05-25 | Paper |
| Time- and space-optimal algorithm for the many-visits TSP | 2021-05-03 | Paper |
| Engineering Kernelization for Maximum Cut | 2021-01-27 | Paper |
| Combinatorial \(n\)-fold integer programming and applications | 2020-10-21 | Paper |
| On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes | 2020-07-30 | Paper |
| Odd multiway cut in directed acyclic graphs | 2020-07-30 | Paper |
| Combinatorial \(n\)-fold integer programming and applications | 2020-05-27 | Paper |
| Dynamic parameterized problems and algorithms | 2020-05-27 | Paper |
| Stable matchings with covering constraints: a complete computational trichotomy | 2020-04-01 | Paper |
| Parameterized algorithms for generalizations of directed feedback vertex set | 2020-02-06 | Paper |
| Domination when the stars are out | 2019-11-25 | Paper |
| A time- and space-optimal algorithm for the many-visits TSP | 2019-10-15 | Paper |
| New deterministic algorithms for solving parity games | 2019-01-14 | Paper |
| New algorithms for maximum disjoint paths based on tree-likeness | 2018-09-28 | Paper |
| Parameterized complexity of machine scheduling: 15 open problems | 2018-09-18 | Paper |
| Linear-time recognition of map graphs with outerplanar witness | 2018-08-17 | Paper |
| Improved bounds for minimal feedback vertex sets in tournaments | 2018-08-16 | Paper |
| Linear kernels and linear-time algorithms for finding large cuts | 2018-07-26 | Paper |
| Improved integrality gap upper bounds for traveling salesperson problems with distances one and two | 2018-05-30 | Paper |
| Polynomial kernels for deletion to classes of acyclic digraphs | 2018-05-24 | Paper |
| Linear kernels and linear-time algorithms for finding large cuts | 2018-04-19 | Paper |
| Voting and bribing in single-exponential time | 2018-04-19 | Paper |
| Improved Bounds for Minimal Feedback Vertex Sets in Tournaments | 2018-04-10 | Paper |
| New algorithms for maximum disjoint paths based on tree-likeness | 2018-03-02 | Paper |
| A 7/3-approximation for feedback vertex sets in tournaments | 2018-03-02 | Paper |
| Stable marriage with covering constraints -- a complete computational trichotomy | 2018-02-13 | Paper |
| Polynomial kernels for deletion to classes of acyclic digraphs | 2018-01-24 | Paper |
| Linear-time recognition of map graphs with outerplanar witness | 2017-10-17 | Paper |
| On routing disjoint paths in bounded treewidth graphs | 2017-10-17 | Paper |
| Large independent sets in triangle-free planar graphs | 2017-06-23 | Paper |
| Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound | 2017-01-26 | Paper |
| Parameterized complexity dichotomy for Steiner Multicut | 2017-01-24 | Paper |
| Polynomial kernels for weighted problems | 2016-11-14 | Paper |
| Parameterized complexity dichotomy for \textsc{Steiner Multicut} | 2016-06-13 | Paper |
| New deterministic algorithms for solving parity games | 2016-05-03 | Paper |
| Scheduling and fixed-parameter tractability | 2015-12-09 | Paper |
| Interval scheduling and colorful independent sets | 2015-11-12 | Paper |
| Polynomial kernels for weighted problems | 2015-09-16 | Paper |
| Parameterized complexity of induced graph matching on claw-free graphs | 2015-01-19 | Paper |
| Large independent sets in triangle-free planar graphs | 2014-10-08 | Paper |
| Treewidth computation and kernelization in the parallel external memory model | 2014-09-15 | Paper |
| Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound | 2014-06-10 | Paper |
| Scheduling and fixed-parameter tractability | 2014-06-02 | Paper |
| Kernel and fast algorithm for dense triplet inconsistency | 2014-01-10 | Paper |
| Max-Cut parameterized above the Edwards-Erdős bound | 2013-08-12 | Paper |
| Interval scheduling and colorful independent sets | 2013-03-21 | Paper |
| Feedback vertex sets in tournaments | 2013-03-07 | Paper |
| Induced matchings in subcubic planar graphs | 2013-01-04 | Paper |
| Bisections above Tight Lower Bounds | 2012-11-06 | Paper |
| Parameterized complexity of induced \(H\)-matching on claw-free graphs | 2012-09-25 | Paper |
| Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables | 2012-05-11 | Paper |
| Planar \(k\)-path in subexponential time and polynomial space | 2011-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089795 | 2011-08-25 | Paper |
| Domination when the stars are out | 2011-07-06 | Paper |
| Ranking and drawing in subexponential time | 2011-05-19 | Paper |
| A linear kernel for a planar connected dominating set | 2011-05-18 | Paper |
| Betweenness parameterized above tight lower bound | 2010-10-07 | Paper |
| Induced matchings in subcubic planar graphs | 2010-09-06 | Paper |
| All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables | 2010-09-06 | Paper |
| Feedback vertex sets in tournaments | 2010-09-06 | Paper |
| Kernel and fast algorithm for dense triplet inconsistency | 2010-06-17 | Paper |
| The complexity ecology of parameters: An illustration using bounded max leaf number | 2009-10-19 | Paper |
| Linear Kernel for Planar Connected Dominating Set | 2009-06-03 | Paper |
