| Publication | Date of Publication | Type |
|---|
Packing, hitting, and colouring squares
Journal of Computational Geometry | 2024-12-19 | Paper |
| On integer multiflows and metric packings in matroids | 2024-07-05 | Paper |
How many matchings cover the nodes of a graph?
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Tashkinov-trees: an annotated proof
Graphs and Combinatorics | 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
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
On combinatorial properties of binary spaces
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
| Packing, Hitting, and Coloring Squares | 2022-06-05 | Paper |
Ear-slicing for matchings in hypergraphs
Graphs and Combinatorics | 2021-03-17 | Paper |
The salesman's improved tours for fundamental classes
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
The salesman's improved paths through forests
Journal of the ACM | 2020-02-11 | Paper |
| Color-critical Graphs and Hereditary Hypergraphs | 2019-10-24 | Paper |
Layers and matroids for the traveling salesman's paths
Operations Research Letters | 2019-06-11 | Paper |
On ideal clutters, metrics and multiflows
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
| The saleman's improved tours for fundamental classes | 2017-08-31 | Paper |
Graphic submodular function minimization: a graphic approach and applications
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Multiflow Feasibility: An Annotated Tableau
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Layers and Matroids for the Traveling Salesman's Paths
(available as arXiv preprint) | 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
Combinatorica | 2015-01-07 | Paper |
Complements of nearly perfect graphs
Journal of Combinatorics | 2013-11-05 | Paper |
Complements of nearly perfect graphs
Journal of Combinatorics | 2013-11-05 | Paper |
Eight-fifth approximation for the path TSP
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
The chromatic gap and its extremes
Journal of Combinatorial Theory. Series B | 2012-10-19 | Paper |
Alternatives for testing total dual integrality
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
An Excluded Minor Characterization of Seymour Graphs
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Ramsey-type results for Gallai colorings
Journal of Graph Theory | 2010-11-10 | Paper |
Minconvex Factors of Prescribed Size in Graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Optimal cuts in graphs and statistical mechanics
Mathematical and Computer Modelling | 2010-05-02 | Paper |
Path Partitions, Cycle Covers and Integer Decomposition
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Paintshop, odd cycles and necklace splitting
Discrete Applied Mathematics | 2009-06-30 | Paper |
Cyclic orders: equivalence and duality
Combinatorica | 2008-10-21 | Paper |
Generating All Sets With Bounded Unions
Combinatorics, Probability and Computing | 2008-10-13 | Paper |
Optimizing diversity
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Batch processing with interval graph compatibilities between tasks
Discrete Applied Mathematics | 2008-03-18 | Paper |
Characterizations of Total Dual Integrality
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Minmax relations for cyclically ordered digraphs
Journal of Combinatorial Theory. Series B | 2007-06-08 | Paper |
A Berge-keeping operation for graphs
Discrete Mathematics | 2006-10-30 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
On Metric Generators of Graphs
Mathematics of Operations Research | 2005-11-11 | Paper |
Coloring the Maximal Cliques of Graphs
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
Journal of Physics A: Mathematical and General | 2004-06-09 | Paper |
| Some aspects of minimal imperfect graphs | 2002-08-07 | Paper |
| scientific article; zbMATH DE number 1757969 (Why is no real title available?) | 2002-06-20 | Paper |
Integer multiflows and metric packings beyond the cut condition
Discrete Mathematics | 2002-06-19 | Paper |
Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1342145 (Why is no real title available?) | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1263272 (Why is no real title available?) | 1999-09-15 | Paper |
| scientific article; zbMATH DE number 1263287 (Why is no real title available?) | 1999-09-13 | Paper |
Flows, view obstructions, and the lonely runner
Journal of Combinatorial Theory. Series B | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1187141 (Why is no real title available?) | 1999-04-08 | Paper |
Optimal binary trees with order constraints
Discrete Applied Mathematics | 1999-03-30 | Paper |
| scientific article; zbMATH DE number 1187147 (Why is no real title available?) | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1033812 (Why is no real title available?) | 1997-11-25 | Paper |
Potentials in Undirected Graphs and Planar Multiflows
SIAM Journal on Computing | 1997-05-26 | Paper |
On Integer Multiflow Maximization
SIAM Journal on Discrete Mathematics | 1997-05-20 | Paper |
On critical edges in minimal imperfect graphs
Journal of Combinatorial Theory. Series B | 1997-01-26 | Paper |
| The connectivity of minimal imperfect graphs | 1996-09-15 | Paper |
Recognizing Greedy Structures
Journal of Algorithms | 1996-02-20 | Paper |
General antifactors of graphs
Journal of Combinatorial Theory. Series B | 1994-06-30 | Paper |
Integer plane multiflows with a mixed number of demands
Journal of Combinatorial Theory. Series B | 1994-05-05 | Paper |
A generalized cut-condition for multiflows in matroids
Discrete Mathematics | 1993-06-29 | Paper |
A particular timetable problem: Terminal scheduling
Computers & Mathematics with Applications | 1991-01-01 | Paper |
Undirected distances and the postman-structure of graphs
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4212067 (Why is no real title available?) | 1990-01-01 | Paper |
The Schrijver system of odd join polyhedra
Combinatorica | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4139464 (Why is no real title available?) | 1988-01-01 | Paper |
A quick proof of Seymour's theorem on t-joins
Discrete Mathematics | 1987-01-01 | Paper |
Total dual integrality implies local strong unimodularity
Mathematical Programming | 1987-01-01 | Paper |
A particular timetable problem: terminal scheduling
Optimization | 1987-01-01 | Paper |
Finding thet-join structure of graphs
Mathematical Programming | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4020833 (Why is no real title available?) | 1986-01-01 | Paper |
On two random search problems
Journal of Statistical Planning and Inference | 1985-01-01 | Paper |
Covering directed and odd cuts
Mathematical Programming Studies | 1984-01-01 | Paper |
