According to our database
1,
Zoltán Szigeti
authored at least 62 papers
between 1993 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
Matroid-rooted packing of arborescences.
J. Comb. Optim., October, 2024
On reversing arcs to improve arc-connectivity.
Inf. Process. Lett., February, 2024
Steiner connectivity problems in hypergraphs.
Inf. Process. Lett., January, 2024
Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees.
CoRR, 2024
On arborescence packing augmentation in hypergraphs.
CoRR, 2024
Matroid-reachability-based decomposition into arborescences.
CoRR, 2024
2023
Packing mixed hyperarborescences.
Discret. Optim., November, 2023
The complexity of 2-vertex-connected orientation in mixed graphs.
Discret. Optim., May, 2023
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees.
J. Comb. Optim., 2023
Directed hypergraph connectivity augmentation by hyperarc reorientations.
CoRR, 2023
2022
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.
SIAM J. Discret. Math., September, 2022
On packing time-respecting arborescences.
Discret. Optim., 2022
Reachability in arborescence packings.
Discret. Appl. Math., 2022
2021
Connectivity of orientations of 3-edge-connected graphs.
Eur. J. Comb., 2021
Eulerian orientations and vertex-connectivity.
Discret. Appl. Math., 2021
A note on 2-vertex-connected orientations.
CoRR, 2021
Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection.
Electron. J. Comb., 2021
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects.
Algorithmica, 2021
2020
Packing of arborescences with matroid constraints via matroid intersection.
Math. Program., 2020
On packing spanning arborescences with matroid constraint.
J. Graph Theory, 2020
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.
Proceedings of the Approximation, 2020
2019
On (2, k)?connected graphs.
J. Graph Theory, 2019
Polymatroid-based capacitated packing of branchings.
Discret. Appl. Math., 2019
2018
On minimally 2-T-connected directed graphs.
Discret. Appl. Math., 2018
Old and new results on packing arborescences in directed hypergraphs.
Discret. Appl. Math., 2018
2017
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.
SIAM J. Discret. Math., 2017
2016
Preface: Graph theory and combinatorics.
Discret. Appl. Math., 2016
2014
Packing of rigid spanning subgraphs and spanning trees.
J. Comb. Theory B, 2014
2013
Matroid-Based Packing of Arborescences.
SIAM J. Discret. Math., 2013
Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph.
J. Graph Theory, 2013
2012
Sandwich problems on orientations.
J. Braz. Comput. Soc., 2012
Edge-connectivity of permutation hypergraphs.
Discret. Math., 2012
Greedy colorings of words.
Discret. Appl. Math., 2012
2011
An Excluded Minor Characterization of Seymour Graphs.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2008
Edge-connectivity augmentation of graphs over symmetric parity families.
Discret. Math., 2008
Recent results on well-balanced orientations.
Discret. Optim., 2008
Edge-splittings preserving local edge-connectivity of graphs.
Discret. Appl. Math., 2008
Covering symmetric semi-monotone functions.
Discret. Appl. Math., 2008
Edge-Connectivity Augmentations of Graphs and Hypergraphs.
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2006
Simultaneous well-balanced orientations of graphs.
J. Comb. Theory B, 2006
2005
On the local splitting theorem.
Electron. Notes Discret. Math., 2005
2004
On a min-max theorem on bipartite graphs.
Discret. Math., 2004
2003
Detachments Preserving Local Edge-Connectivity of Graphs.
SIAM J. Discret. Math., 2003
On the graphic matroid parity problem.
J. Comb. Theory B, 2003
2002
Perfect Matchings Versus Odd Cuts.
Comb., 2002
2001
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph.
SIAM J. Discret. Math., 2001
On Generalizations of Matching-covered Graphs.
Eur. J. Comb., 2001
Combinatorial problems related to origin-destination matrices.
Discret. Appl. Math., 2001
2000
On min-max theorems in matching theory.
Electron. Notes Discret. Math., 2000
1999
Edge-Connectivity Augmentation with Partition Constraints.
SIAM J. Discret. Math., 1999
Hypergraph connectivity augmentation.
Math. Program., 1999
On Optimal Ear-Decompositions of Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
An Orientation Theorem with Parity Conditions.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
1998
The Two Ear Theorem on Matching-Covered Graphs.
J. Comb. Theory B, 1998
On a Min-max Theorem of Cacti.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
A characterization of Seymour graphs.
J. Graph Theory, 1997
1996
On a Matroid Defined by Ear-Decompositions of Graphs.
Comb., 1996
1995
A note on packing paths in planar graphs.
Math. Program., 1995
1994
On Packing <i>T</i>-Cuts.
J. Comb. Theory B, 1994
1993
On Lovász's cathedral theorem.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
