| Publication | Date of Publication | Type |
|---|
Serial batching to minimize the weighted number of tardy jobs
Journal of Scheduling | 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
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Dynamic Parameterized Problems and Algorithms
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Parameterized algorithms for generalizations of directed feedback vertex set
Discrete Optimization | 2023-02-16 | Paper |
scientific article; zbMATH DE number 7650225 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
A 3/2-Approximation for the Metric Many-Visits Path TSP
SIAM Journal on Discrete Mathematics | 2022-12-09 | Paper |
scientific article; zbMATH DE number 7559382 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Parameterized complexity of configuration integer programs
Operations Research Letters | 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
(available as arXiv preprint) | 2021-05-25 | Paper |
| Reachability switching games | 2021-05-25 | Paper |
Time- and space-optimal algorithm for the many-visits TSP
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Time- and space-optimal algorithm for the many-visits TSP
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Engineering Kernelization for Maximum Cut
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Combinatorial \(n\)-fold integer programming and applications
Mathematical Programming. Series A. Series B | 2020-10-21 | Paper |
On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes
Discrete Optimization | 2020-07-30 | Paper |
On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes
Discrete Optimization | 2020-07-30 | Paper |
Odd multiway cut in directed acyclic graphs
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
| Combinatorial \(n\)-fold integer programming and applications | 2020-05-27 | Paper |
Dynamic parameterized problems and algorithms
(available as arXiv preprint) | 2020-05-27 | Paper |
Stable matchings with covering constraints: a complete computational trichotomy
Algorithmica | 2020-04-01 | Paper |
Parameterized algorithms for generalizations of directed feedback vertex set
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Parameterized algorithms for generalizations of directed feedback vertex set
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Domination when the stars are out
ACM Transactions on Algorithms | 2019-11-25 | Paper |
A time- and space-optimal algorithm for the many-visits TSP
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
New deterministic algorithms for solving parity games
Discrete Optimization | 2019-01-14 | Paper |
New algorithms for maximum disjoint paths based on tree-likeness
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
New algorithms for maximum disjoint paths based on tree-likeness
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
Parameterized complexity of machine scheduling: 15 open problems
Computers & Operations Research | 2018-09-18 | Paper |
Linear-time recognition of map graphs with outerplanar witness
Discrete Optimization | 2018-08-17 | Paper |
Improved bounds for minimal feedback vertex sets in tournaments
Journal of Graph Theory | 2018-08-16 | Paper |
Linear kernels and linear-time algorithms for finding large cuts
Algorithmica | 2018-07-26 | Paper |
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
European Journal of Operational Research | 2018-05-30 | Paper |
Polynomial kernels for deletion to classes of acyclic digraphs
Discrete Optimization | 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
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2018-03-02 | Paper |
Stable marriage with covering constraints -- a complete computational trichotomy
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2017-10-17 | Paper |
Large independent sets in triangle-free planar graphs
SIAM Journal on Discrete Mathematics | 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
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Parameterized complexity dichotomy for \textsc{Steiner Multicut}
Journal of Computer and System Sciences | 2016-06-13 | Paper |
New deterministic algorithms for solving parity games
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Scheduling and fixed-parameter tractability
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Interval scheduling and colorful independent sets
Journal of Scheduling | 2015-11-12 | Paper |
Polynomial kernels for weighted problems
Lecture Notes in Computer Science | 2015-09-16 | Paper |
Parameterized complexity of induced graph matching on claw-free graphs
Algorithmica | 2015-01-19 | Paper |
Large independent sets in triangle-free planar graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Treewidth computation and kernelization in the parallel external memory model
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Scheduling and fixed-parameter tractability
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science | 2014-01-10 | Paper |
Max-Cut parameterized above the Edwards-Erdős bound
Automata, Languages, and Programming | 2013-08-12 | Paper |
Interval scheduling and colorful independent sets
Lecture Notes in Computer Science | 2013-03-21 | Paper |
Feedback vertex sets in tournaments
Journal of Graph Theory | 2013-03-07 | Paper |
Feedback vertex sets in tournaments
Journal of Graph Theory | 2013-03-07 | Paper |
Induced matchings in subcubic planar graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Bisections above Tight Lower Bounds
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Parameterized complexity of induced \(H\)-matching on claw-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Planar \(k\)-path in subexponential time and polynomial space
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
| scientific article; zbMATH DE number 5943241 (Why is no real title available?) | 2011-08-25 | Paper |
Domination when the stars are out
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Ranking and drawing in subexponential time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
A linear kernel for a planar connected dominating set
Theoretical Computer Science | 2011-05-18 | Paper |
Betweenness parameterized above tight lower bound
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Induced matchings in subcubic planar graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Feedback vertex sets in tournaments
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Kernel and fast algorithm for dense triplet inconsistency
Lecture Notes in Computer Science | 2010-06-17 | Paper |
The complexity ecology of parameters: An illustration using bounded max leaf number
Theory of Computing Systems | 2009-10-19 | Paper |
Linear Kernel for Planar Connected Dominating Set
Lecture Notes in Computer Science | 2009-06-03 | Paper |
