| Publication | Date of Publication | Type |
|---|
| A PPA parity theorem about trees in a bipartite graph | 2022-01-05 | Paper |
| Understanding PPA-completeness | 2020-10-23 | Paper |
| Understanding PPA-completeness | 2017-10-10 | Paper |
| Euler Complexes | 2017-04-07 | Paper |
| Exponentiality of the exchange algorithm for finding another room-partitioning | 2015-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861564 | 2013-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861565 | 2013-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861566 | 2013-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861567 | 2013-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576689 | 2010-07-30 | Paper |
| Matroid Partition | 2010-06-03 | Paper |
| The travelling preacher, projection, and a lower bound for the stability number of a graph | 2008-10-29 | Paper |
| Colouring Some Classes of Perfect Graphs Robustly | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414632 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414633 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414634 | 2003-07-25 | Paper |
| Redundancy and Helly | 2003-03-26 | Paper |
| Some graphic uses of an even number of odd nodes | 1999-07-12 | Paper |
| Lambda composition | 1997-12-07 | Paper |
| A minor-monotone graph parameter based on oriented matroids | 1997-06-10 | Paper |
| Coflow polyhedra | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348434 | 1990-01-01 | Paper |
| A note on perfect graphs | 1986-01-01 | Paper |
| The poset scheduling problem | 1985-01-01 | Paper |
| A case of non-convergent dual changes in assignment problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220355 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220357 | 1984-01-01 | Paper |
| Reductions to 1–matching polyhedra | 1983-01-01 | Paper |
| Polarities Given by Systems of Bilinear Inequalities | 1983-01-01 | Paper |
| Brick decompositions and the matching rank of graphs | 1982-01-01 | Paper |
| Polyhedral polarity defined by a general bilinear inequality | 1982-01-01 | Paper |
| A Combinatorial Decomposition Theory | 1980-01-01 | Paper |
| Matroid Intersection | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870942 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4149476 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4070624 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4078069 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4121713 | 1974-01-01 | Paper |
| Matching, Euler tours and the Chinese postman | 1973-01-01 | Paper |
| Matroid designs | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068442 | 1972-01-01 | Paper |
| Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems | 1972-01-01 | Paper |
| Matroids and the greedy algorithm | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4078051 | 1970-01-01 | Paper |
| Bottleneck extrema | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5661340 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675543 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5684698 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5593828 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5595648 | 1968-01-01 | Paper |
| Systems of distinct representatives and linear algebra | 1967-01-01 | Paper |
| On the surface duality of linear graphs | 1965-01-01 | Paper |
| Paths, Trees, and Flowers | 1965-01-01 | Paper |
| Transversals and matroid partition | 1965-01-01 | Paper |
| Maximum matching and a polyhedron with 0,1-vertices | 1965-01-01 | Paper |
| Minimum partition of a matroid into independent subsets | 1965-01-01 | Paper |
| Lehmans switching game and a theorem of Tutte and Nash-Williams | 1965-01-01 | Paper |
| Existence of k-edge connected ordinary graphs with prescribed degrees | 1964-01-01 | Paper |
| Covers and packings in a family of sets | 1962-01-01 | Paper |
