| Publication | Date of Publication | Type |
|---|
| Matroid-rooted packing of arborescences | 2024-12-03 | Paper |
| On reversing arcs to improve arc-connectivity | 2024-03-26 | Paper |
| A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case | 2023-10-31 | Paper |
| Steiner connectivity problems in hypergraphs | 2023-10-12 | Paper |
| Packing mixed hyperarborescences | 2023-09-25 | Paper |
| The complexity of 2-vertex-connected orientation in mixed graphs | 2023-06-30 | Paper |
| Directed hypergraph connectivity augmentation by hyperarc reorientations | 2023-04-28 | Paper |
| On the complexity of finding well-balanced orientations with upper bounds on the out-degrees | 2022-12-16 | Paper |
| On packing time-respecting arborescences | 2022-09-15 | Paper |
| A characterization of Seymour graphs | 2022-08-30 | Paper |
| Reachability in arborescence packings | 2022-08-24 | Paper |
| A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case | 2022-08-18 | Paper |
| On packing time-respecting arborescences | 2022-03-02 | Paper |
| On the complexity of finding well-balanced orientations with upper bounds on the out-degrees | 2022-02-28 | Paper |
| Packing of mixed hyperarborescences with flexible roots via matroid intersection | 2021-08-09 | Paper |
| The \((2, k)\)-connectivity augmentation problem: algorithmic aspects | 2021-07-26 | Paper |
| Connectivity of orientations of 3-edge-connected graphs | 2021-04-14 | Paper |
| Eulerian orientations and vertex-connectivity | 2020-12-29 | Paper |
| A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case | 2020-08-07 | Paper |
| Packing of arborescences with matroid constraints via matroid intersection | 2020-06-10 | Paper |
| On packing spanning arborescences with matroid constraint | 2020-05-21 | Paper |
| The $(2,k)$-connectivity augmentation problem: Algorithmic aspects | 2020-04-18 | Paper |
| Polymatroid-based capacitated packing of branchings | 2019-11-06 | Paper |
| On ‐connected graphs | 2019-08-15 | Paper |
| On minimally 2-\(T\)-connected directed graphs | 2018-10-26 | Paper |
| Old and new results on packing arborescences in directed hypergraphs | 2018-04-20 | Paper |
| On packing spanning arborescences with matroid constraint | 2018-01-18 | Paper |
| Edge-connectivity augmentations of~graphs~and~hypergraphs | 2017-04-07 | Paper |
| Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph | 2017-03-16 | Paper |
| On min-max theorems in matching theory | 2016-07-01 | Paper |
| Packing of rigid spanning subgraphs and spanning trees | 2014-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417727 | 2014-05-22 | Paper |
| Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph | 2013-10-10 | Paper |
| Matroid-Based Packing of Arborescences | 2013-06-27 | Paper |
| Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph | 2013-04-19 | Paper |
| Orientations of graphs | 2012-10-06 | Paper |
| Greedy colorings of words | 2012-08-14 | Paper |
| Edge-connectivity of permutation hypergraphs | 2012-08-10 | Paper |
| An Excluded Minor Characterization of Seymour Graphs | 2011-06-24 | Paper |
| Edge-connectivity augmentation of graphs over symmetric parity families | 2009-01-28 | Paper |
| Recent results on well-balanced orientations | 2008-11-19 | Paper |
| Edge-splittings preserving local edge-connectivity of graphs | 2008-04-16 | Paper |
| Covering symmetric semi-monotone functions | 2007-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439662 | 2007-05-29 | Paper |
| Simultaneous well-balanced orientations of graphs | 2006-08-16 | Paper |
| On a min--max theorem on bipartite graphs | 2004-02-14 | Paper |
| Detachments Preserving Local Edge-Connectivity of Graphs | 2004-01-08 | Paper |
| Perfect matchings versus odd cuts | 2003-10-14 | Paper |
| On the graphic matroid parity problem | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263728 | 2001-05-17 | Paper |
| Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph | 2001-03-19 | Paper |
| An orientation theorem with parity conditions | 2001-01-01 | Paper |
| On generalizations of matching-covered graphs | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263711 | 2000-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250196 | 2000-10-17 | Paper |
| Hypergraph connectivity augmentation | 1999-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234158 | 1999-09-15 | Paper |
| Edge-Connectivity Augmentation with Partition Constraints | 1999-06-27 | Paper |
| The two ear theorem on matching-covered graphs | 1998-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840352 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840349 | 1998-08-10 | Paper |
| A characterization of Seymour graphs | 1997-08-31 | Paper |
| On a matroid defined by ear-decompositions of graphs | 1997-03-11 | Paper |
| A note on packing paths in planar graphs | 1996-02-06 | Paper |
| On packing \(T\)-cuts | 1995-03-02 | Paper |
| Packing forests | N/A | Paper |
| Matroid-reachability-based decomposition into arborescences | N/A | Paper |
