Zoltán Szigeti
Orcid: 0000-0003-2982-1737
According to our database1,
Zoltán Szigeti
authored at least 62 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
6
5
3
5
2
2
2
1
1
1
2
3
4
1
1
1
2
1
3
1
2
1
1
1
1
1
1
1
1
2
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees.
CoRR, 2024
2023
Discret. Optim., May, 2023
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees.
J. Comb. Optim., 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
2021
Electron. J. Comb., 2021
Algorithmica, 2021
2020
Math. Program., 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
2018
Discret. Appl. Math., 2018
2017
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.
SIAM J. Discret. Math., 2017
2016
2014
2013
J. Graph Theory, 2013
2012
2011
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2008
Discret. Math., 2008
Discret. Appl. Math., 2008
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2006
2005
2004
2003
SIAM J. Discret. Math., 2003
2002
2001
SIAM J. Discret. Math., 2001
Discret. Appl. Math., 2001
2000
1999
SIAM J. Discret. Math., 1999
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
1998
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
1996
1995
1994
1993
On Lovász's cathedral theorem.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993