Zoltán Szigeti

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