| Publication | Date of Publication | Type |
|---|
| Refining a chain theorem from matroids to internally 4-connected graphs | 2024-12-23 | Paper |
| Packing Feedback Arc Sets in Tournaments Exactly | 2024-03-05 | Paper |
| On Gupta’s Codensity Conjecture | 2023-08-11 | Paper |
| Unavoidable Induced Subgraphs of Large 2-Connected Graphs | 2023-06-14 | Paper |
| Unavoidable Induced Subgraph of Infinite 2-connected Graphs | 2022-11-11 | Paper |
| Strengthened chain theorems for different versions of 4-connectivity | 2022-11-02 | 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 |
| A chain theorem for 4-connected graphs | 2018-12-20 | Paper |
| Excluding a large theta graph | 2018-07-24 | Paper |
| On almost-planar graphs | 2018-05-25 | Paper |
| Minimal \(k\)-connected non-Hamiltonian graphs | 2018-04-13 | Paper |
| On box-perfect graphs | 2017-11-28 | Paper |
| Graphs without large $K_{2,n}$-minors | 2017-02-04 | Paper |
| Unavoidable connected matroids retaining a specified minor | 2016-09-06 | Paper |
| Hall-Type Results for 3-Connected Projective Graphs | 2016-08-12 | Paper |
| Excluded-minor characterization of apex-outerplanar graphs | 2016-06-13 | Paper |
| Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs | 2016-06-10 | Paper |
| Graphs with no \(\bar{P}_7\)-minor | 2016-05-11 | Paper |
| Characterizing binary matroids with no \(P_9\)-minor | 2015-08-31 | Paper |
| Internally 4-connected projective-planar graphs | 2014-09-04 | Paper |
| On 3-connected graphs of path-width at most three | 2014-01-21 | Paper |
| A characterization of graphs with no octahedron minor | 2013-10-21 | Paper |
| Excluding a small minor | 2013-01-18 | Paper |
| The Maximum-Weight Stable Matching Problem: Duality and Efficiency | 2013-01-04 | Paper |
| A chain theorem for \(3^+\)-connected graphs | 2012-08-22 | Paper |
| Bandwidth of trees of diameter at most 4 | 2012-06-18 | Paper |
| Bonds with parity constraints | 2012-05-11 | Paper |
| A Characterization of Box-Mengerian Matroid Ports | 2011-04-27 | Paper |
| Large non-planar graphs and an application to crossing-critical graphs | 2011-03-14 | Paper |
| Unavoidable topological minors of infinite graphs | 2010-11-19 | Paper |
| Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs | 2010-10-14 | Paper |
| Splitter theorems for 4-regular graphs | 2010-10-07 | Paper |
| Transforms of pseudo-Boolean random variables | 2010-05-05 | Paper |
| Generating 5-regular planar graphs | 2009-12-18 | Paper |
| Unavoidable parallel minors of 4-connected graphs | 2009-06-16 | Paper |
| Packing circuits in matroids | 2009-04-24 | Paper |
| The edge version of Hadwiger's conjecture | 2009-04-09 | Paper |
| On canonical antichains | 2009-04-09 | Paper |
| The box-TDI system associated with 2-edge connected spanning subgraphs | 2009-03-04 | Paper |
| Formulas for approximating pseudo-Boolean random variables | 2008-09-10 | Paper |
| The complexity of recognizing linear systems with certain integrality properties | 2008-06-04 | Paper |
| On minimal rank over finite fields | 2008-05-28 | Paper |
| A Min-Max Relation on Packing Feedback Vertex Sets | 2008-05-27 | Paper |
| Efficient Learning of Pseudo-Boolean Functions from Limited Training Data | 2008-03-17 | Paper |
| Graph-theoretic method for merging security system specifications | 2007-05-18 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Splitter Theorems for Cubic Graphs | 2006-07-06 | Paper |
| New bounds for randomized busing | 2005-04-06 | Paper |
| The best expert versus the smartest algorithm | 2004-11-23 | Paper |
| Unavoidable doubly connected large graphs | 2004-08-06 | Paper |
| Excluding any graph as a minor allows a low tree-width 2-coloring | 2004-08-06 | Paper |
| Generating \(r\)-regular graphs | 2003-09-09 | Paper |
| Packing cycles in graphs. II | 2003-08-25 | Paper |
| Partitioning into graphs with only small components | 2003-08-25 | Paper |
| Packing cycles in graphs | 2003-08-20 | Paper |
| Surfaces, tree-width, clique-minors, and partitions | 2002-12-10 | Paper |
| On interval clutters | 2002-08-29 | Paper |
| Spanning trees with many leaves | 2002-06-03 | Paper |
| Partitioning graphs of bounded tree-width | 1999-10-31 | Paper |
| Excluding a long double path minor | 1999-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242973 | 1999-08-10 | Paper |
| Unavoidable minors of large 3-connected matroids | 1998-10-05 | Paper |
| Matroids arisen from matrogenic graphs | 1997-09-24 | Paper |
| Bounding the number of circuits of a graph | 1997-05-20 | Paper |
| Unavoidable minors of large 3-connected binary matroids | 1996-11-25 | Paper |
| Some results on tree decomposition of graphs | 1996-05-13 | Paper |
| On tree-partitions of graphs | 1996-03-25 | Paper |
| Graphs with not too many spanning trees | 1996-01-16 | Paper |
| Bounding the number of bases of a matroid | 1995-11-16 | Paper |
| On infinite antichains of matroids | 1995-07-02 | Paper |
| Recognizing the \(P_ 4\)-structures of a tree | 1995-02-01 | Paper |
| Bounding the vertex cover number of a hypergraph | 1994-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273868 | 1994-05-30 | Paper |
| Disjoint cycles in directed graphs on the torus and the Klein bottle | 1994-05-24 | Paper |
| Stable sets versus independent sets | 1994-03-10 | Paper |
| Monotone clutters | 1993-12-20 | Paper |
| Disjoint circuits on a Klein bottle and a theorem on posets | 1993-08-30 | Paper |
| Clutters with \(\tau_ 2 \Relbar 2\tau\) | 1993-06-20 | Paper |
| Subgraphs and well‐quasi‐ordering | 1993-01-17 | Paper |
| Disjoint Paths in a Planar Graph—A General Theorem | 1992-06-28 | Paper |
| Covering the edges with consecutive sets | 1992-06-27 | Paper |
| On the maximum 2-1 matching | 1987-01-01 | Paper |
