| Publication | Date of Publication | Type |
|---|
| Total dual dyadicness and dyadic generating sets | 2024-08-20 | Paper |
| Small separations in pinch-graphic matroids | 2024-02-21 | Paper |
| Recognizing pinch-graphic matroids | 2024-02-21 | Paper |
| Recognizing even-cycle and even-cut matroids | 2023-10-23 | Paper |
| Dyadic linear programming and extensions | 2023-09-08 | Paper |
| Testing idealness in the filter oracle model | 2022-12-12 | Paper |
| Recognizing Even-Cycle and Even-Cut Matroids | 2022-10-14 | Paper |
| Total dual dyadicness and dyadic generating sets | 2022-08-16 | Paper |
| Clean Clutters and Dyadic Fractional Packings | 2022-04-20 | Paper |
| Testing idealness in the filter oracle model | 2022-02-15 | Paper |
| A short proof of Shih's isomorphism theorem on graphic subspaces | 2021-04-16 | Paper |
| The minimally non-ideal binary clutters with a triangle | 2019-11-21 | Paper |
| The two-point Fano and ideal binary clutters | 2019-11-21 | Paper |
| Packing odd T‐joins with at most two terminals | 2018-04-27 | Paper |
| The two-point Fano and ideal binary clutters | 2017-08-31 | Paper |
| Single commodity-flow algorithms for lifts of graphic and cographic matroids | 2016-09-09 | Paper |
| A characterization of weakly bipartite graphs | 2016-07-01 | Paper |
| A survey on flows in graphs and matroids | 2016-06-21 | Paper |
| Stabilizer theorems for even cycle matroids | 2016-03-14 | Paper |
| Lehman's Theorem and the Directed Steiner Tree Problem | 2016-01-15 | Paper |
| Displaying blocking pairs in signed graphs | 2015-09-30 | Paper |
| On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs | 2015-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191865 | 2014-09-25 | Paper |
| The Cycling Property for the Clutter of Odd st-Walks | 2014-06-02 | Paper |
| Relationships between Pairs of Representations of Signed Binary Matroids | 2013-06-27 | Paper |
| Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids | 2013-03-19 | Paper |
| Packing directed circuits exactly | 2012-02-13 | Paper |
| Lehman matrices | 2009-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439690 | 2007-05-29 | Paper |
| Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids | 2005-11-11 | Paper |
| A family of switch equivalent graphs | 2005-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737527 | 2004-08-11 | Paper |
| The packing property. | 2004-02-18 | Paper |
| Packing odd circuits in Eulerian graphs | 2003-08-20 | Paper |
| A short proof of Seymour's characterization of the matroids with the max-flow min-cut property | 2003-08-20 | Paper |
| Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour | 2003-01-05 | Paper |
| A characterization of weakly bipartite graphs | 2002-12-10 | Paper |
| On dijoins | 2002-09-25 | Paper |
| Ideal clutters | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537698 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537745 | 2002-06-20 | Paper |
| Perfect and ideal \(0, \pm 1\) matrices | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840343 | 1999-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840342 | 1999-04-08 | Paper |
