Zoltán Szigeti

Discret. Math., 2026

2025

Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs.

[BibT_eX]

[DOI]

Mathis Martin

Math. Program., September, 2025

Regular packing of rooted hyperforests with root constraints in hypergraphs.

[BibT_eX]

[DOI]

Mathis Martin

Math. Program., September, 2025

2024

Matroid-rooted packing of arborescences.

[BibT_eX]

[DOI]

J. Comb. Optim., October, 2024

On reversing arcs to improve arc-connectivity.

[BibT_eX]

[DOI]

Inf. Process. Lett., February, 2024

Steiner connectivity problems in hypergraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., January, 2024

Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees.

[BibT_eX]

[DOI]

CoRR, 2024

Matroid-reachability-based decomposition into arborescences.

[BibT_eX]

[DOI]

Benjamin Peyrille

CoRR, 2024

2023

Packing mixed hyperarborescences.

[BibT_eX]

[DOI]

Discret. Optim., November, 2023

The complexity of 2-vertex-connected orientation in mixed graphs.

[BibT_eX]

[DOI]

Discret. Optim., May, 2023

On the complexity of finding well-balanced orientations with upper bounds on the out-degrees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

Packing forests.

[BibT_eX]

[DOI]

Mathis Martin

CoRR, 2023

Directed hypergraph connectivity augmentation by hyperarc reorientations.

[BibT_eX]

[DOI]

Moritz Mühlenthaler

Benjamin Peyrille

CoRR, 2023

2022

A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

On packing time-respecting arborescences.

[BibT_eX]

[DOI]

Romain Chapoullié

Discret. Optim., 2022

Reachability in arborescence packings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Connectivity of orientations of 3-edge-connected graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Eulerian orientations and vertex-connectivity.

[BibT_eX]

[DOI]

Florian Hoersch

Discret. Appl. Math., 2021

A note on 2-vertex-connected orientations.

[BibT_eX]

[DOI]

CoRR, 2021

Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Packing of arborescences with matroid constraints via matroid intersection.

[BibT_eX]

[DOI]

Csaba Király

Shin-ichi Tanigawa

Math. Program., 2020

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

2019

On (2, k)?connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Polymatroid-based capacitated packing of branchings.

[BibT_eX]

[DOI]

Tatsuya Matsuoka

Discret. Appl. Math., 2019

2018

On minimally 2-T-connected directed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Old and new results on packing arborescences in directed hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

On packing spanning arborescences with matroid constraint.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Preface: Graph theory and combinatorics.

[BibT_eX]

[DOI]

András Sebö

Discret. Appl. Math., 2016

2014

Packing of rigid spanning subgraphs and spanning trees.

[BibT_eX]

[DOI]

Joseph Cheriyan

J. Comb. Theory B, 2014

2013

Matroid-Based Packing of Arborescences.

[BibT_eX]

[DOI]

Viet Hang Nguyen

SIAM J. Discret. Math., 2013

2012

Sandwich problems on orientations.

[BibT_eX]

[DOI]

Sulamita Klein

Viet Hang Nguyen

J. Braz. Comput. Soc., 2012

Edge-connectivity of permutation hypergraphs.

[BibT_eX]

[DOI]

Neil Jami

Discret. Math., 2012

Greedy colorings of words.

[BibT_eX]

[DOI]

Dieter Rautenbach

Discret. Appl. Math., 2012

2011

An Excluded Minor Characterization of Seymour Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.

[BibT_eX]

[DOI]

Attila Bernáth

Roland Grappe

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph.

[BibT_eX]

[DOI]

Roland Grappe

Attila Bernáth

Electron. Notes Discret. Math., 2009

2008

Edge-connectivity augmentation of graphs over symmetric parity families.

[BibT_eX]

[DOI]

Discret. Math., 2008

Recent results on well-balanced orientations.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Edge-splittings preserving local edge-connectivity of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Covering symmetric semi-monotone functions.

[BibT_eX]

[DOI]

Roland Grappe

Discret. Appl. Math., 2008

Edge-Connectivity Augmentations of Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2006

Simultaneous well-balanced orientations of graphs.

[BibT_eX]

[DOI]

Zoltán Király

J. Comb. Theory B, 2006

2005

On the local splitting theorem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

On a min-max theorem on bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Detachments Preserving Local Edge-Connectivity of Graphs.

[BibT_eX]

[DOI]

Tibor Jordán

SIAM J. Discret. Math., 2003

On the graphic matroid parity problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

2002

Perfect Matchings Versus Odd Cuts.

[BibT_eX]

[DOI]

Comb., 2002

2001

Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph.

[BibT_eX]

[DOI]

Joseph Cheriyan

András Sebö

SIAM J. Discret. Math., 2001

On Generalizations of Matching-covered Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Combinatorial problems related to origin-destination matrices.

[BibT_eX]

[DOI]

Tibor Jordán

Discret. Appl. Math., 2001

2000

On min-max theorems in matching theory.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

1999

Hypergraph connectivity augmentation.

[BibT_eX]

[DOI]

Math. Program., 1999

On Optimal Ear-Decompositions of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

An Orientation Theorem with Parity Conditions.

[BibT_eX]

[DOI]

Tibor Jordán

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

The Two Ear Theorem on Matching-Covered Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Edge-Connectivity Augmentation with Partition Constraints.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

On a Min-max Theorem of Cacti.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs.

[BibT_eX]

[DOI]

Joseph Cheriyan

András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996

On a Matroid Defined by Ear-Decompositions of Graphs.

[BibT_eX]

[DOI]

Comb., 1996

1995

A note on packing paths in planar graphs.

[BibT_eX]

[DOI]

Math. Program., 1995

A Characterization of Seymour Graphs.

[BibT_eX]

[DOI]

Alexander A. Ageev

Alexandr V. Kostochka

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

On Packing <i>T</i>-Cuts.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

1993

On Lovász's cathedral theorem.

[BibT_eX]