| Publication | Date of Publication | Type |
|---|
Matroid-rooted packing of arborescences
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
On reversing arcs to improve arc-connectivity
Information Processing Letters | 2024-03-26 | Paper |
A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
(available as arXiv preprint) | 2023-10-31 | Paper |
Steiner connectivity problems in hypergraphs
Information Processing Letters | 2023-10-12 | Paper |
| Packing mixed hyperarborescences | 2023-09-25 | Paper |
The complexity of 2-vertex-connected orientation in mixed graphs
Discrete Optimization | 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
Journal of Combinatorial Optimization | 2022-12-16 | Paper |
On packing time-respecting arborescences
Discrete Optimization | 2022-09-15 | Paper |
A characterization of Seymour graphs
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Reachability in arborescence packings
Discrete Applied Mathematics | 2022-08-24 | Paper |
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
On packing time-respecting arborescences
(available as arXiv preprint) | 2022-03-02 | Paper |
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
(available as arXiv preprint) | 2022-02-28 | Paper |
Packing of mixed hyperarborescences with flexible roots via matroid intersection
The Electronic Journal of Combinatorics | 2021-08-09 | Paper |
The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
Algorithmica | 2021-07-26 | Paper |
Connectivity of orientations of 3-edge-connected graphs
European Journal of Combinatorics | 2021-04-14 | Paper |
Eulerian orientations and vertex-connectivity
Discrete Applied Mathematics | 2020-12-29 | Paper |
A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
(available as arXiv preprint) | 2020-08-07 | Paper |
Packing of arborescences with matroid constraints via matroid intersection
Mathematical Programming. Series A. Series B | 2020-06-10 | Paper |
On packing spanning arborescences with matroid constraint
Journal of Graph Theory | 2020-05-21 | Paper |
The $(2,k)$-connectivity augmentation problem: Algorithmic aspects
(available as arXiv preprint) | 2020-04-18 | Paper |
Polymatroid-based capacitated packing of branchings
Discrete Applied Mathematics | 2019-11-06 | Paper |
On ‐connected graphs
Journal of Graph Theory | 2019-08-15 | Paper |
On minimally 2-\(T\)-connected directed graphs
Discrete Applied Mathematics | 2018-10-26 | Paper |
Old and new results on packing arborescences in directed hypergraphs
Discrete Applied Mathematics | 2018-04-20 | Paper |
| On packing spanning arborescences with matroid constraint | 2018-01-18 | Paper |
Edge-connectivity augmentations of~graphs~and~hypergraphs
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
| On min-max theorems in matching theory | 2016-07-01 | Paper |
Packing of rigid spanning subgraphs and spanning trees
Journal of Combinatorial Theory. Series B | 2014-08-27 | Paper |
| scientific article; zbMATH DE number 6297806 (Why is no real title available?) | 2014-05-22 | Paper |
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Matroid-Based Packing of Arborescences
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Matroid-Based Packing of Arborescences
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
Journal of Graph Theory | 2013-04-19 | Paper |
Orientations of graphs
Matemática Contemporânea | 2012-10-06 | Paper |
Greedy colorings of words
Discrete Applied Mathematics | 2012-08-14 | Paper |
Edge-connectivity of permutation hypergraphs
Discrete Mathematics | 2012-08-10 | Paper |
An Excluded Minor Characterization of Seymour Graphs
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Edge-connectivity augmentation of graphs over symmetric parity families
Discrete Mathematics | 2009-01-28 | Paper |
Recent results on well-balanced orientations
Discrete Optimization | 2008-11-19 | Paper |
Edge-splittings preserving local edge-connectivity of graphs
Discrete Applied Mathematics | 2008-04-16 | Paper |
Covering symmetric semi-monotone functions
Discrete Applied Mathematics | 2007-11-30 | Paper |
| scientific article; zbMATH DE number 5158485 (Why is no real title available?) | 2007-05-29 | Paper |
Simultaneous well-balanced orientations of graphs
Journal of Combinatorial Theory. Series B | 2006-08-16 | Paper |
On a min--max theorem on bipartite graphs
Discrete Mathematics | 2004-02-14 | Paper |
Detachments Preserving Local Edge-Connectivity of Graphs
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Perfect matchings versus odd cuts
Combinatorica | 2003-10-14 | Paper |
On the graphic matroid parity problem
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1342146 (Why is no real title available?) | 2001-05-17 | Paper |
Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
An orientation theorem with parity conditions
Discrete Applied Mathematics | 2001-01-01 | Paper |
On generalizations of matching-covered graphs
European Journal of Combinatorics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1342129 (Why is no real title available?) | 2000-11-27 | Paper |
| scientific article; zbMATH DE number 1303570 (Why is no real title available?) | 2000-10-17 | Paper |
Hypergraph connectivity augmentation
Mathematical Programming. Series A. Series B | 1999-12-05 | Paper |
| scientific article; zbMATH DE number 1263285 (Why is no real title available?) | 1999-09-15 | Paper |
Edge-Connectivity Augmentation with Partition Constraints
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
The two ear theorem on matching-covered graphs
Journal of Combinatorial Theory. Series B | 1998-12-14 | Paper |
| scientific article; zbMATH DE number 1187147 (Why is no real title available?) | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1187144 (Why is no real title available?) | 1998-08-10 | Paper |
| A characterization of Seymour graphs | 1997-08-31 | Paper |
On a matroid defined by ear-decompositions of graphs
Combinatorica | 1997-03-11 | Paper |
A note on packing paths in planar graphs
Mathematical Programming. Series A. Series B | 1996-02-06 | Paper |
On packing \(T\)-cuts
Journal of Combinatorial Theory. Series B | 1995-03-02 | Paper |
Packing forests
(available as arXiv preprint) | N/A | Paper |
Matroid-reachability-based decomposition into arborescences
(available as arXiv preprint) | N/A | Paper |
