On Lovász's cathedral theorem. - Zoltán Szigeti (IPCO, 1993)

On Packing T-Cuts. - András Frank; Zoltán Szigeti (J. Comb. Theory B, 1994)

A note on packing paths in planar graphs. - András Frank; Zoltán Szigeti (Math. Program., 1995)

On a Matroid Defined by Ear-Decompositions of Graphs. - Zoltán Szigeti (Comb., 1996)

A characterization of Seymour graphs. - Alexander A. Ageev; Alexandr V. Kostochka; Zoltán Szigeti (J. Graph Theory, 1997)

An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. - Joseph Cheriyan; András Sebö; Zoltán Szigeti (IPCO, 1998)

On a Min-max Theorem of Cacti. - Zoltán Szigeti (IPCO, 1998)

The Two Ear Theorem on Matching-Covered Graphs. - Zoltán Szigeti (J. Comb. Theory B, 1998)

An Orientation Theorem with Parity Conditions. - András Frank; Tibor Jordán; Zoltán Szigeti (IPCO, 1999)

On Optimal Ear-Decompositions of Graphs. - Zoltán Szigeti (IPCO, 1999)

Hypergraph connectivity augmentation. - Zoltán Szigeti (Math. Program., 1999)

Edge-Connectivity Augmentation with Partition Constraints. - Jørgen Bang-Jensen; Harold N. Gabow; Tibor Jordán; Zoltán Szigeti (SIAM J. Discret. Math., 1999)

On min-max theorems in matching theory. - Zoltán Szigeti (Electron. Notes Discret. Math., 2000)

Combinatorial problems related to origin-destination matrices. - András Frank; Tibor Jordán; Zoltán Szigeti (Discret. Appl. Math., 2001)

On Generalizations of Matching-covered Graphs. - Zoltán Szigeti (Eur. J. Comb., 2001)

Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph. - Joseph Cheriyan; András Sebö; Zoltán Szigeti (SIAM J. Discret. Math., 2001)

Perfect Matchings Versus Odd Cuts. - Zoltán Szigeti (Comb., 2002)

On the graphic matroid parity problem. - Zoltán Szigeti (J. Comb. Theory B, 2003)

Detachments Preserving Local Edge-Connectivity of Graphs. - Tibor Jordán; Zoltán Szigeti (SIAM J. Discret. Math., 2003)

On a min-max theorem on bipartite graphs. - Zoltán Szigeti (Discret. Math., 2004)

On the local splitting theorem. - Zoltán Szigeti (Electron. Notes Discret. Math., 2005)

Simultaneous well-balanced orientations of graphs. - Zoltán Király; Zoltán Szigeti (J. Comb. Theory B, 2006)

Edge-Connectivity Augmentations of Graphs and Hypergraphs. - Zoltán Szigeti (Bonn Workshop of Combinatorial Optimization, 2008)

Covering symmetric semi-monotone functions. - Roland Grappe; Zoltán Szigeti (Discret. Appl. Math., 2008)

Edge-splittings preserving local edge-connectivity of graphs. - Zoltán Szigeti (Discret. Appl. Math., 2008)

Recent results on well-balanced orientations. - Attila Bernáth; Satoru Iwata 001; Tamás Király; Zoltán Király; Zoltán Szigeti (Discret. Optim., 2008)

Edge-connectivity augmentation of graphs over symmetric parity families. - Zoltán Szigeti (Discret. Math., 2008)

An Excluded Minor Characterization of Seymour Graphs. - Alexander A. Ageev; Yohann Benchetrit; András Sebö; Zoltán Szigeti (IPCO, 2011)

Greedy colorings of words. - Dieter Rautenbach; Zoltán Szigeti (Discret. Appl. Math., 2012)

Edge-connectivity of permutation hypergraphs. - Neil Jami; Zoltán Szigeti (Discret. Math., 2012)

Sandwich problems on orientations. - Olivier Durand de Gevigney; Sulamita Klein; Viet Hang Nguyen; Zoltán Szigeti (J. Braz. Comput. Soc., 2012)

Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph. - Attila Bernáth; Roland Grappe; Zoltán Szigeti (J. Graph Theory, 2013)

Matroid-Based Packing of Arborescences. - Olivier Durand de Gevigney; Viet Hang Nguyen; Zoltán Szigeti (SIAM J. Discret. Math., 2013)

Packing of rigid spanning subgraphs and spanning trees. - Joseph Cheriyan; Olivier Durand de Gevigney; Zoltán Szigeti (J. Comb. Theory B, 2014)

Preface: Graph theory and combinatorics. - András Sebö; Zoltán Szigeti (Discret. Appl. Math., 2016)

Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. - Attila Bernáth; Roland Grappe; Zoltán Szigeti (SIAM J. Discret. Math., 2017)

Old and new results on packing arborescences in directed hypergraphs. - Quentin Fortier; Csaba Király 001; Marion Léonard; Zoltán Szigeti; Alexandre Talon (Discret. Appl. Math., 2018)

On minimally 2-T-connected directed graphs. - Olivier Durand de Gevigney; Zoltán Szigeti (Discret. Appl. Math., 2018)

Polymatroid-based capacitated packing of branchings. - Tatsuya Matsuoka; Zoltán Szigeti (Discret. Appl. Math., 2019)

On (2, k)?connected graphs. - Olivier Durand de Gevigney; Zoltán Szigeti (J. Graph Theory, 2019)

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. - Sylvia C. Boyd; Joseph Cheriyan; Robert Cummings; Logan Grout; Sharat Ibrahimpur; Zoltán Szigeti; Lu Wang (APPROX-RANDOM, 2020)

On packing spanning arborescences with matroid constraint. - Quentin Fortier; Csaba Király 001; Zoltán Szigeti; Shin-ichi Tanigawa (J. Graph Theory, 2020)

Packing of arborescences with matroid constraints via matroid intersection. - Csaba Király 001; Zoltán Szigeti; Shin-ichi Tanigawa (Math. Program., 2020)

The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects. - Florian Hörsch; Zoltán Szigeti (Algorithmica, 2021)

Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection. - Florian Hörsch; Zoltán Szigeti (Electron. J. Comb., 2021)

A note on 2-vertex-connected orientations. - Florian Hörsch; Zoltán Szigeti (CoRR, 2021)

Eulerian orientations and vertex-connectivity. - Florian Hoersch; Zoltán Szigeti (Discret. Appl. Math., 2021)

Connectivity of orientations of 3-edge-connected graphs. - Florian Hörsch; Zoltán Szigeti (Eur. J. Comb., 2021)

Reachability in arborescence packings. - Florian Hörsch; Zoltán Szigeti (Discret. Appl. Math., 2022)

On packing time-respecting arborescences. - Romain Chapoullié; Zoltán Szigeti (Discret. Optim., 2022)

A $ frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. - Sylvia C. Boyd; Joseph Cheriyan; Robert Cummings; Logan Grout; Sharat Ibrahimpur; Zoltán Szigeti; Lu Wang (SIAM J. Discret. Math., 2022)

Directed hypergraph connectivity augmentation by hyperarc reorientations. - Moritz Mühlenthaler; Benjamin Peyrille; Zoltán Szigeti (CoRR, 2023)

Packing forests. - Pierre Hoppenot; Mathis Martin; Zoltán Szigeti (CoRR, 2023)

On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. - Florian Hörsch; Zoltán Szigeti (J. Comb. Optim., 2023)

The complexity of 2-vertex-connected orientation in mixed graphs. - Florian Hörsch; Zoltán Szigeti (Discret. Optim., 2023)

Packing mixed hyperarborescences. - Zoltán Szigeti (Discret. Optim., 2023)

Matroid-reachability-based decomposition into arborescences. - Florian Hörsch; Benjamin Peyrille; Zoltán Szigeti (CoRR, 2024)

On arborescence packing augmentation in hypergraphs. - Pierre Hoppenot; Zoltán Szigeti (CoRR, 2024)

Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees. - Pierre Hoppenot; Zoltán Szigeti (CoRR, 2024)

Steiner connectivity problems in hypergraphs. - Florian Hörsch; Zoltán Szigeti (Inf. Process. Lett., 2024)

On reversing arcs to improve arc-connectivity. - Pierre Hoppenot; Zoltán Szigeti (Inf. Process. Lett., 2024)

Matroid-rooted packing of arborescences. - Zoltán Szigeti (J. Comb. Optim., 2024)