| Publication | Date of Publication | Type |
|---|
| Fair Integral Network Flows | 2024-02-27 | Paper |
| A network flow approach to a common generalization of Clar and Fries numbers | 2023-07-06 | Paper |
| Two arc disjoint paths in Eulerian digraphs | 2023-03-21 | Paper |
| Decreasing minimization on base-polyhedra: relation between discrete and continuous cases | 2023-01-17 | Paper |
| Decreasing minimization on M-convex sets: background and structures | 2022-10-24 | Paper |
| Decreasing minimization on M-convex sets: algorithms and applications | 2022-10-24 | Paper |
| Fair integral submodular flows | 2022-08-24 | Paper |
| A Discrete Convex Min-Max Formula for Box-TDI Polyhedra | 2022-06-27 | Paper |
| Decreasing Minimization on Base-Polyhedra: Relation Between Discrete and Continuous Cases | 2022-02-14 | Paper |
| A simple algorithm and min-max formula for the inverse arborescence problem | 2021-04-01 | Paper |
| Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings | 2020-03-12 | Paper |
| Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation | 2020-03-12 | Paper |
| Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs | 2020-03-12 | Paper |
| Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis | 2018-08-25 | Paper |
| Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization | 2018-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635969 | 2018-04-23 | Paper |
| A Survey on Covering Supermodular Functions | 2017-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816087 | 2016-07-01 | Paper |
| Sink-Stable Sets of Digraphs | 2015-04-17 | Paper |
| Tree-compositions and orientations | 2014-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2861497 | 2013-11-08 | Paper |
| Independent arborescences in directed graphs | 2013-03-01 | Paper |
| Simple push-relabel algorithms for matroids and submodular flows | 2012-12-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999648 | 2011-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3085455 | 2011-03-31 | Paper |
| Rooted \(k\)-connections in digraphs | 2009-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3617665 | 2009-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3617674 | 2009-03-30 | Paper |
| Variations for Lovász’ Submodular Ideas | 2009-02-12 | Paper |
| An algorithm to increase the node-connectivity of a digraph by one | 2008-11-19 | Paper |
| A note on degree-constrained subgraphs | 2008-05-13 | Paper |
| An algorithm for node-capacitated ring routing | 2008-01-21 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Node-Capacitated Ring Routing | 2005-11-11 | Paper |
| An algorithm for source location in directed graphs | 2005-06-01 | Paper |
| On Kuhn's Hungarian Method?A tribute from Hungary | 2005-06-01 | Paper |
| A constrained independent set problem for matroids | 2004-07-01 | Paper |
| Restricted \(t\)-matchings in bipartite graphs | 2003-10-14 | Paper |
| Constructive characterizations for packing and covering with trees | 2003-10-14 | Paper |
| On decomposing a hypergraph into \(k\) connected sub-hypergraphs | 2003-10-14 | Paper |
| On the orientation of graphs and hypergraphs | 2003-10-14 | Paper |
| Combined connectivity augmentation and orientation problems | 2003-10-14 | Paper |
| Note on the path‐matching formula | 2003-03-19 | Paper |
| Graph orientations with edge-connection and parity constraints | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537741 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537742 | 2002-06-20 | Paper |
| An orientation theorem with parity conditions | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263711 | 2000-11-27 | Paper |
| Finding minimum generators of path systems | 2000-06-09 | Paper |
| Directed vertex-connectivity augmentation | 2000-04-10 | Paper |
| Increasing the rooted connectivity of a digraph by one | 2000-01-30 | Paper |
| Connectivity augmentation of networks: Structures and algorithms. Papers from the workshop held at Eötvös University, Budapest, Hungary, November 1994 | 2000-01-04 | Paper |
| Covering symmetric supermodular functions by graphs | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263470 | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263712 | 1999-09-22 | Paper |
| Minimum multiway cuts in trees | 1999-04-19 | Paper |
| Two Arc-Disjoint Paths in Eulerian Digraphs | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386300 | 1998-08-25 | Paper |
| Applications of relaxed submodularity | 1998-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398362 | 1998-07-19 | Paper |
| On Integer Multiflow Maximization | 1997-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871749 | 1996-09-29 | Paper |
| Preserving and Increasing Local Edge-Connectivity in Mixed Graphs | 1996-04-08 | Paper |
| A note on packing paths in planar graphs | 1996-02-06 | Paper |
| Minimal edge-coverings of pairs of sets | 1995-09-20 | Paper |
| On packing \(T\)-cuts | 1995-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273846 | 1994-06-12 | Paper |
| Submodular functions in graph theory | 1994-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142412 | 1993-12-12 | Paper |
| On sparse subgraphs preserving connectivity properties | 1993-08-24 | Paper |
| Conservative weightings and ear-decompositions of graphs | 1993-08-16 | Paper |
| Algorithms for routing around a rectangle | 1993-05-16 | Paper |
| On a theorem of Mader | 1993-01-16 | Paper |
| Augmenting Graphs to Meet Edge-Connectivity Requirements | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972951 | 1992-06-26 | Paper |
| On circuit decomposition of planar Eulerian graphs | 1992-06-25 | Paper |
| Packing paths in planar graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3353050 | 1990-01-01 | Paper |
| An application of submodular flows | 1989-01-01 | Paper |
| Generalized polymatroids and submodular flows | 1988-01-01 | Paper |
| An application of simultaneous diophantine approximation in combinatorial optimization | 1987-01-01 | Paper |
| Edge-disjoint paths in planar graphs | 1985-01-01 | Paper |
| A Primal-Dual Algorithm for Submodular Flows | 1985-01-01 | Paper |
| Finding feasible vectors of Edmonds-Giles polyhedra | 1984-01-01 | Paper |
| Covering directed and odd cuts | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220319 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3682499 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688403 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3039389 | 1983-01-01 | Paper |
| Disjoint paths in a rectilinear grid | 1982-01-01 | Paper |
| A note on k-strongly connected orientations of an undirected graph | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3958239 | 1982-01-01 | Paper |
| An Algorithm for Submodular Functions on Graphs | 1982-01-01 | Paper |
| How to make a digraph strongly connected | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929415 | 1981-01-01 | Paper |
| A weighted matroid intersection algorithm | 1981-01-01 | Paper |
| On the orientation of graphs | 1980-01-01 | Paper |
| On chain and antichain families of a partially ordered set | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3858297 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859792 | 1979-01-01 | Paper |
| On a class of balanced hypergraphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4093489 | 1976-01-01 | Paper |
