| Publication | Date of Publication | Type |
|---|
| How many matchings cover the nodes of a graph? | 2024-02-21 | Paper |
| Tashkinov-trees: an annotated proof | 2024-01-05 | Paper |
| Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs | 2023-09-05 | Paper |
| Jump-systems of $T$-paths | 2023-02-26 | Paper |
| Odd Paths, Cycles and $T$-joins: Connections and Algorithms | 2022-11-23 | Paper |
| Integer plane multiflow maximisation: one-quarter-approximation and gaps | 2022-10-24 | Paper |
| Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation | 2022-10-14 | Paper |
| On combinatorial properties of binary spaces | 2022-08-30 | Paper |
| Packing, Hitting, and Coloring Squares | 2022-06-05 | Paper |
| Ear-slicing for matchings in hypergraphs | 2021-03-17 | Paper |
| The salesman's improved tours for fundamental classes | 2021-02-15 | Paper |
| The Salesman’s Improved Paths through Forests | 2020-02-11 | Paper |
| Color-critical Graphs and Hereditary Hypergraphs | 2019-10-24 | Paper |
| Layers and matroids for the traveling salesman's paths | 2019-06-11 | Paper |
| On ideal clutters, metrics and multiflows | 2019-01-11 | Paper |
| The saleman's improved tours for fundamental classes | 2017-08-31 | Paper |
| Multiflow Feasibility: An Annotated Tableau | 2017-04-07 | Paper |
| Graphic Submodular Function Minimization: A Graphic Approach and Applications | 2017-04-07 | Paper |
| Layers and Matroids for the Traveling Salesman's Paths | 2017-03-21 | Paper |
| The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio | 2016-04-08 | Paper |
| Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs | 2015-01-07 | Paper |
| Complements of nearly perfect graphs | 2013-11-05 | Paper |
| Eight-Fifth Approximation for the Path TSP | 2013-03-19 | Paper |
| The chromatic gap and its extremes | 2012-10-19 | Paper |
| Alternatives for testing total dual integrality | 2012-04-27 | Paper |
| An Excluded Minor Characterization of Seymour Graphs | 2011-06-24 | Paper |
| Ramsey-type results for Gallai colorings | 2010-11-10 | Paper |
| Minconvex Factors of Prescribed Size in Graphs | 2010-08-27 | Paper |
| Optimal cuts in graphs and statistical mechanics | 2010-05-02 | Paper |
| Path Partitions, Cycle Covers and Integer Decomposition | 2010-01-07 | Paper |
| Paintshop, odd cycles and necklace splitting | 2009-06-30 | Paper |
| Cyclic orders: equivalence and duality | 2008-10-21 | Paper |
| Generating All Sets With Bounded Unions | 2008-10-13 | Paper |
| Optimizing diversity | 2008-06-05 | Paper |
| Batch processing with interval graph compatibilities between tasks | 2008-03-18 | Paper |
| Characterizations of Total Dual Integrality | 2007-11-29 | Paper |
| Minmax relations for cyclically ordered digraphs | 2007-06-08 | Paper |
| A Berge-keeping operation for graphs | 2006-10-30 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| On Metric Generators of Graphs | 2005-11-11 | Paper |
| Coloring the Maximal Cliques of Graphs | 2005-02-28 | Paper |
| Optimal cooperation and submodularity for computing Potts partition functions with a large number of states | 2004-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2758338 | 2002-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537757 | 2002-06-20 | Paper |
| Integer multiflows and metric packings beyond the cut condition | 2002-06-19 | Paper |
| Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263727 | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234145 | 1999-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234160 | 1999-09-13 | Paper |
| Flows, view obstructions, and the lonely runner | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840345 | 1999-04-08 | Paper |
| Optimal binary trees with order constraints | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840352 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344207 | 1997-11-25 | Paper |
| Potentials in Undirected Graphs and Planar Multiflows | 1997-05-26 | Paper |
| On Integer Multiflow Maximization | 1997-05-20 | Paper |
| On critical edges in minimal imperfect graphs | 1997-01-26 | Paper |
| The connectivity of minimal imperfect graphs | 1996-09-15 | Paper |
| Recognizing Greedy Structures | 1996-02-20 | Paper |
| General antifactors of graphs | 1994-06-30 | Paper |
| Integer plane multiflows with a mixed number of demands | 1994-05-05 | Paper |
| A generalized cut-condition for multiflows in matroids | 1993-06-29 | Paper |
| A particular timetable problem: Terminal scheduling | 1991-01-01 | Paper |
| Undirected distances and the postman-structure of graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360195 | 1990-01-01 | Paper |
| The Schrijver system of odd join polyhedra | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3471824 | 1988-01-01 | Paper |
| A quick proof of Seymour's theorem on t-joins | 1987-01-01 | Paper |
| A particular timetable problem: terminal scheduling | 1987-01-01 | Paper |
| Total dual integrality implies local strong unimodularity | 1987-01-01 | Paper |
| Finding thet-join structure of graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3763889 | 1986-01-01 | Paper |
| On two random search problems | 1985-01-01 | Paper |
| Covering directed and odd cuts | 1984-01-01 | Paper |
| Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs | 0001-01-03 | Paper |
