| Publication | Date of Publication | Type |
|---|
| Detecting points in integer cones of polytopes is double-exponentially hard | 2024-05-29 | Paper |
| The Asymmetric Travelling Salesman Problem In Sparse Digraphs. | 2023-11-13 | Paper |
| The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. | 2023-11-13 | Paper |
| Partitioning edges of a planar graph into linear forests and a matching | 2023-10-05 | Paper |
| Many Visits TSP Revisited | 2023-02-07 | Paper |
| Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP | 2022-05-11 | Paper |
| Many-visits TSP revisited | 2021-11-25 | Paper |
| Tight lower bounds for list edge coloring | 2020-08-25 | Paper |
| Tight lower bounds for the complexity of multicoloring | 2020-05-27 | Paper |
| Improving TSP tours using dynamic programming over tree decompositions | 2020-05-27 | Paper |
| Tight lower bounds for the complexity of multicoloring | 2019-12-16 | Paper |
| Improving TSP Tours Using Dynamic Programming over Tree Decompositions | 2019-12-02 | Paper |
| Engineering Motif Search for Large Graphs | 2019-09-12 | Paper |
| Counting thin subgraphs via packings faster than meet-in-the-middle time | 2019-06-20 | Paper |
| Approximation and parameterized complexity of minimax approval voting | 2018-11-30 | Paper |
| On directed feedback vertex set parameterized by treewidth | 2018-11-22 | Paper |
| Counting thin subgraphs via packings faster than meet-in-the-middle time | 2018-11-12 | Paper |
| On the fine-grained complexity of rainbow coloring | 2018-07-18 | Paper |
| On the fine-grained complexity of rainbow coloring | 2018-03-02 | Paper |
| Linear kernels for outbranching problems in sparse digraphs | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363775 | 2017-09-29 | Paper |
| Spotting trees with few leaves | 2017-05-24 | Paper |
| Probably optimal graph motifs | 2017-01-30 | Paper |
| A \(13k\)-kernel for planar feedback vertex set via region decomposition | 2016-08-31 | Paper |
| Assigning channels via the meet-in-the-middle approach | 2016-05-31 | Paper |
| On finding rainbow and colorful paths | 2016-04-13 | Paper |
| Constrained multilinear detection and generalized graph motifs | 2016-03-29 | Paper |
| Spotting trees with few leaves | 2015-10-27 | Paper |
| A \(14k\)-kernel for planar feedback vertex set via region decomposition | 2015-09-15 | Paper |
| Oracles for bounded-length shortest paths in planar graphs | 2015-09-02 | Paper |
| Parameterized algorithms | 2015-08-17 | Paper |
| Beyond the Vizing's bound for at most seven colors | 2014-12-22 | Paper |
| Fast witness extraction using a decision oracle | 2014-10-08 | Paper |
| Assigning channels via the meet-in-the-middle approach | 2014-09-02 | Paper |
| A \(9k\) kernel for nonseparating independent set in planar graphs | 2013-12-13 | Paper |
| Beyond the Shannon's Bound | 2013-09-24 | Paper |
| Towards optimal kernel for connected vertex cover in planar graphs | 2013-04-25 | Paper |
| Channel assignment via fast zeta transform | 2013-04-04 | Paper |
| Nonblocker in \(H\)-minor free graphs: kernelization meets discharging | 2013-01-07 | Paper |
| A \(9k\) kernel for nonseparating independent set in planar graphs | 2012-11-06 | Paper |
| A planar linear arboricity conjecture | 2012-06-13 | Paper |
| 35/44-approximation for asymmetric maximum TSP with triangle inequality | 2011-03-02 | Paper |
| Improved induced matchings in sparse graphs | 2010-11-25 | Paper |
| Fast 3-coloring triangle-free planar graphs | 2010-09-27 | Paper |
| Fast approximation in subspaces by doubling metric decomposition | 2010-09-06 | Paper |
| Exponential-time approximation of weighted set cover | 2010-08-20 | Paper |
| Short path queries in planar graphs in constant time | 2010-08-16 | Paper |
| An improved bound on the largest induced forests for triangle-free planar graphs | 2010-07-27 | Paper |
| Approximating the maximum 3- and 4-edge-colorable subgraph (extended abstract) | 2010-06-22 | Paper |
| A planar linear arboricity conjecture | 2010-05-28 | Paper |
| Adjacency queries in dynamic sparse graphs | 2010-01-29 | Paper |
| Improved induced matchings in sparse graphs | 2010-01-14 | Paper |
| Short cycles in planar graphs. | 2010-01-12 | Paper |
| Total-Coloring of Plane Graphs with Maximum Degree Nine | 2009-11-27 | Paper |
| Deterministic 7/8-approximation for the metric maximum TSP | 2009-11-06 | Paper |
| Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality | 2009-10-20 | Paper |
| Improved edge-coloring with three colors | 2009-09-10 | Paper |
| 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality | 2009-02-17 | Paper |
| Deterministic 7/8-Approximation for the Metric Maximum TSP | 2008-11-27 | Paper |
| Improved Edge-Coloring with Three Colors | 2008-09-04 | Paper |
| Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures | 2008-04-24 | Paper |
| New linear-time algorithms for edge-coloring planar graphs | 2008-04-03 | Paper |
| A Generalization of Kotzig’s Theorem and Its Application | 2008-03-28 | Paper |
| A note on scheduling equal-length jobs to maximize throughput | 2007-05-15 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414492 | 2003-07-25 | Paper |
