Zoltán Szigeti

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 36

Top Topics

Packing Problem

Randomized Approximation

Connected Graphs

Top Venues

Discret. Appl. Math.

Discret. Optim.

SIAM J. Discret. Math.

Publications

Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti
Matroid-reachability-based decomposition into arborescences. CoRR (2024)
Pierre Hoppenot, Zoltán Szigeti
On reversing arcs to improve arc-connectivity. Inf. Process. Lett. 184 (2024)
Florian Hörsch, Zoltán Szigeti
Steiner connectivity problems in hypergraphs. Inf. Process. Lett. 183 (2024)
Zoltán Szigeti
Packing mixed hyperarborescences. CoRR (2023)
Pierre Hoppenot, Mathis Martin, Zoltán Szigeti
Packing forests. CoRR (2023)
Zoltán Szigeti
Packing mixed hyperarborescences. Discret. Optim. 50 (2023)
Florian Hörsch, Zoltán Szigeti
The complexity of 2-vertex-connected orientation in mixed graphs. Discret. Optim. 48 (Part 1) (2023)
Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti
Directed hypergraph connectivity augmentation by hyperarc reorientations. CoRR (2023)
Pierre Hoppenot, Zoltán Szigeti
On reversing arcs to improve arc-connectivity. CoRR (2023)
Florian Hörsch, Zoltán Szigeti
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. J. Comb. Optim. 45 (1) (2023)
Romain Chapoullié, Zoltán Szigeti
On packing time-respecting arborescences. Discret. Optim. 45 (2022)
Florian Hörsch, Zoltán Szigeti
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. CoRR (2022)
Florian Hörsch, Zoltán Szigeti
Steiner connectivity problems in hypergraphs. CoRR (2022)
Florian Hörsch, Zoltán Szigeti
Reachability in arborescence packings. Discret. Appl. Math. 320 (2022)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. SIAM J. Discret. Math. 36 (3) (2022)
Romain Chapoullié, Zoltán Szigeti
On packing time-respecting arborescences. CoRR (2022)
Florian Hörsch, Zoltán Szigeti
Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection. Electron. J. Comb. 28 (3) (2021)
Florian Hörsch, Zoltán Szigeti
Connectivity of orientations of 3-edge-connected graphs. Eur. J. Comb. 94 (2021)
Florian Hoersch, Zoltán Szigeti
Eulerian orientations and vertex-connectivity. Discret. Appl. Math. 289 (2021)
Florian Hörsch, Zoltán Szigeti
A note on 2-vertex-connected orientations. CoRR (2021)
Florian Hörsch, Zoltán Szigeti
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects. Algorithmica 83 (8) (2021)
Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa
On packing spanning arborescences with matroid constraint. J. Graph Theory 93 (2) (2020)
Florian Hörsch, Zoltán Szigeti
Packing of mixed hyperarborescences with flexible roots via matroid intersection. CoRR (2020)
Florian Hörsch, Zoltán Szigeti
Connectivity of orientations of 3-edge-connected graphs. CoRR (2020)
Florian Hörsch, Zoltán Szigeti
Reachability in arborescence packings. CoRR (2020)
Florian Hoersch, Zoltán Szigeti
The (2, k)-connectivity augmentation problem: Algorithmic aspects. CoRR (2020)
Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa
Packing of arborescences with matroid constraints via matroid intersection. Math. Program. 181 (1) (2020)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. CoRR (2020)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. APPROX-RANDOM (2020)
Olivier Durand de Gevigney, Zoltán Szigeti
On (2, k)?connected graphs. J. Graph Theory 91 (4) (2019)
Tatsuya Matsuoka, Zoltán Szigeti
Polymatroid-based capacitated packing of branchings. Discret. Appl. Math. 270 (2019)
Quentin Fortier, Csaba Király, Marion Léonard, Zoltán Szigeti, Alexandre Talon
Old and new results on packing arborescences in directed hypergraphs. Discret. Appl. Math. 242 (2018)
Olivier Durand de Gevigney, Zoltán Szigeti
On minimally 2-T-connected directed graphs. Discret. Appl. Math. 250 (2018)
Attila Bernáth, Roland Grappe, Zoltán Szigeti
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SIAM J. Discret. Math. 31 (1) (2017)
Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa
On packing spanning arborescences with matroid constraint. Electron. Notes Discret. Math. 61 (2017)
András Sebö, Zoltán Szigeti
Preface: Graph theory and combinatorics. Discret. Appl. Math. 209 (2016)
Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti
Packing of rigid spanning subgraphs and spanning trees. J. Comb. Theory, Ser. B 105 (2014)
Olivier Durand de Gevigney, Viet Hang Nguyen, Zoltán Szigeti
Matroid-Based Packing of Arborescences. SIAM J. Discret. Math. 27 (1) (2013)
Attila Bernáth, Roland Grappe, Zoltán Szigeti
Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph. J. Graph Theory 72 (3) (2013)
Dieter Rautenbach, Zoltán Szigeti
Greedy colorings of words. Discret. Appl. Math. 160 (12) (2012)
Olivier Durand de Gevigney, Sulamita Klein, Viet Hang Nguyen, Zoltán Szigeti
Sandwich problems on orientations. J. Braz. Comput. Soc. 18 (2) (2012)
Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti
Packing of Rigid Spanning Subgraphs and Spanning Trees CoRR (2012)
Neil Jami, Zoltán Szigeti
Edge-connectivity of permutation hypergraphs. Discret. Math. 312 (17) (2012)
Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti
An Excluded Minor Characterization of Seymour Graphs. IPCO (2011)
Attila Bernáth, Roland Grappe, Zoltán Szigeti
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SODA (2010)
Roland Grappe, Attila Bernáth, Zoltán Szigeti
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. Electron. Notes Discret. Math. 34 (2009)
Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti
Recent results on well-balanced orientations. Discret. Optim. 5 (4) (2008)
Zoltán Szigeti
Edge-connectivity augmentation of graphs over symmetric parity families. Discret. Math. 308 (24) (2008)
Zoltán Szigeti
Edge-splittings preserving local edge-connectivity of graphs. Discret. Appl. Math. 156 (7) (2008)
Roland Grappe, Zoltán Szigeti
Covering symmetric semi-monotone functions. Discret. Appl. Math. 156 (1) (2008)
Zoltán Szigeti
Edge-Connectivity Augmentations of Graphs and Hypergraphs. Bonn Workshop of Combinatorial Optimization (2008)
Zoltán Király, Zoltán Szigeti
Simultaneous well-balanced orientations of graphs. J. Comb. Theory, Ser. B 96 (5) (2006)
Zoltán Szigeti
On the local splitting theorem. Electron. Notes Discret. Math. 19 (2005)
Zoltán Szigeti
On a min-max theorem on bipartite graphs. Discret. Math. 276 (1-3) (2004)
Zoltán Szigeti
On the graphic matroid parity problem. J. Comb. Theory, Ser. B 88 (2) (2003)
Tibor Jordán, Zoltán Szigeti
Detachments Preserving Local Edge-Connectivity of Graphs. SIAM J. Discret. Math. 17 (1) (2003)
Zoltán Szigeti
Perfect Matchings Versus Odd Cuts. Comb. 22 (4) (2002)
Joseph Cheriyan, András Sebö, Zoltán Szigeti
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph. SIAM J. Discret. Math. 14 (2) (2001)
András Frank, Tibor Jordán, Zoltán Szigeti
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115 (1-3) (2001)
Zoltán Szigeti
On Generalizations of Matching-covered Graphs. Eur. J. Comb. 22 (6) (2001)
Zoltán Szigeti
On min-max theorems in matching theory. Electron. Notes Discret. Math. 5 (2000)
Zoltán Szigeti
Hypergraph connectivity augmentation. Math. Program. 84 (3) (1999)
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discret. Math. 12 (2) (1999)
András Frank, Tibor Jordán, Zoltán Szigeti
An Orientation Theorem with Parity Conditions. IPCO (1999)
Zoltán Szigeti
On Optimal Ear-Decompositions of Graphs. IPCO (1999)
Zoltán Szigeti
On a Min-max Theorem of Cacti. IPCO (1998)
Joseph Cheriyan, András Sebö, Zoltán Szigeti
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. IPCO (1998)
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
Edge-Connectivity Augmentation with Partition Constraints. SODA (1998)
Zoltán Szigeti
The Two Ear Theorem on Matching-Covered Graphs. J. Comb. Theory, Ser. B 74 (1) (1998)
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
A characterization of Seymour graphs. J. Graph Theory 24 (4) (1997)
Zoltán Szigeti
On a Matroid Defined by Ear-Decompositions of Graphs. Comb. 16 (2) (1996)
András Frank, Zoltán Szigeti
A note on packing paths in planar graphs. Math. Program. 70 (1995)
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
A Characterization of Seymour Graphs. IPCO (1995)
András Frank, Zoltán Szigeti
-Cuts. J. Comb. Theory, Ser. B 61 (2) (1994)
Zoltán Szigeti
On Lovász's cathedral theorem. IPCO (1993)