| Publication | Date of Publication | Type |
|---|
| Packing Feedback Arc Sets in Tournaments Exactly | 2024-03-05 | Paper |
| On Gupta’s Codensity Conjecture | 2023-08-11 | Paper |
| Ranking tournaments with no errors. II: Minimax relation | 2020-04-07 | Paper |
| Ranking tournaments with no errors. I: Structural description | 2020-01-15 | Paper |
| Densities, Matchings, and Fractional Edge-Colorings | 2019-02-08 | Paper |
| Proof of the Goldberg-Seymour Conjecture on Edge-Colorings of Multigraphs | 2019-01-29 | Paper |
| On box-perfect graphs | 2017-11-28 | Paper |
| A Polyhedral Description of Kernels | 2016-08-10 | Paper |
| Coloring digraphs with forbidden cycles | 2015-08-21 | Paper |
| Nowhere-Zero 3-Flows in Signed Graphs | 2014-12-22 | Paper |
| An Optimal Binding Number Condition for Bipancyclism | 2013-09-26 | Paper |
| Approximate min-max relations on plane graphs | 2013-08-09 | Paper |
| The circumference of a graph with no \(K_{3,t}\)-minor. II | 2013-01-14 | Paper |
| Total Dual Integrality in Some Facility Location Problems | 2013-01-04 | Paper |
| The Maximum-Weight Stable Matching Problem: Duality and Efficiency | 2013-01-04 | Paper |
| Bonds with parity constraints | 2012-05-11 | Paper |
| A Characterization of Box-Mengerian Matroid Ports | 2011-04-27 | Paper |
| A Unified Approach to Box-Mengerian Hypergraphs | 2011-04-27 | Paper |
| Approximating the chromatic index of multigraphs | 2011-03-17 | Paper |
| A Characterization of Almost CIS Graphs | 2010-06-01 | Paper |
| Odd-\(K_{4}\)'s in stability critical graphs | 2009-12-15 | Paper |
| Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows | 2009-05-27 | Paper |
| Packing circuits in matroids | 2009-04-24 | Paper |
| The box-TDI system associated with 2-edge connected spanning subgraphs | 2009-03-04 | Paper |
| A Min-Max Theorem on Tournaments | 2008-06-19 | Paper |
| The complexity of recognizing linear systems with certain integrality properties | 2008-06-04 | Paper |
| A Min-Max Relation on Packing Feedback Vertex Sets | 2008-05-27 | Paper |
| Approximating Longest Cycles in Graphs with Bounded Degrees | 2007-06-26 | Paper |
| The circumference of a graph with no \(K_{3,t}\)-minor | 2007-01-16 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| An efficient algorithm for finding maximum cycle packings in reducible flow graphs | 2006-06-14 | Paper |
| Differential Methods for Finding Independent Sets in Hypergraphs | 2006-06-01 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs | 2005-12-14 | Paper |
| A Min-Max Theorem on Feedback Vertex Sets | 2005-11-11 | Paper |
| Ramsey functions involving \(K_{m,n}\) with \(n\) large | 2005-10-26 | Paper |
| Perfect circular arc coloring | 2005-10-18 | Paper |
| Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares | 2005-10-04 | Paper |
| Hamilton paths in toroidal graphs | 2005-08-05 | Paper |
| The independence number of graphs with a forbidden cycle and Ramsey numbers | 2005-03-15 | Paper |
| On-line scheduling a batch processing system to minimize total weighted job completion time | 2005-03-15 | Paper |
| An upper bound for Ramsey numbers. | 2005-02-25 | Paper |
| Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474104 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4463367 | 2004-05-27 | Paper |
| \(f\)-factors in bipartite (\(mf\))-graphs | 2004-01-26 | Paper |
| Packing cycles in graphs. II | 2003-08-25 | Paper |
| Ramsey numbers involving large dense graphs and bipartite Turán numbers | 2003-08-25 | Paper |
| Packing cycles in graphs | 2003-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4545720 | 2002-11-11 | Paper |
| Group testing and fault detection for replicated files | 2002-09-29 | Paper |
| The lower bound on independence number. | 2002-08-15 | Paper |
| Asymptotic upper bounds for Ramsey functions | 2002-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767413 | 2002-01-29 | Paper |
| Wavelength allocation on trees of rings | 2001-10-14 | Paper |
| An Approximation Algorithm for Feedback Vertex Sets in Tournaments | 2001-06-21 | Paper |
| Totally balanced combinatorial optimization games | 2001-06-10 | Paper |
| Solution to a problem on degree sequences of graphs | 2000-12-13 | Paper |
| Coloring graphs with no \(\text{odd-}K_4\) | 2000-11-02 | Paper |
| Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263703 | 1999-11-21 | Paper |
| Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218428 | 1999-02-14 | Paper |
| Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs | 1996-02-12 | Paper |
| The maximum number of diagonals of a cycle in a block and its extremal graphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974704 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974710 | 1992-06-25 | Paper |
