default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoltán Szigeti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j50]Florian Hörsch, Zoltán Szigeti:
Steiner connectivity problems in hypergraphs. Inf. Process. Lett. 183: 106428 (2024)- [j49]Pierre Hoppenot, Zoltán Szigeti
:
On reversing arcs to improve arc-connectivity. Inf. Process. Lett. 184: 106434 (2024) - [j48]Zoltán Szigeti:
Matroid-rooted packing of arborescences. J. Comb. Optim. 48(3): 19 (2024) - [i15]Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti:
Matroid-reachability-based decomposition into arborescences. CoRR abs/2405.03270 (2024) - 2023
- [j47]Florian Hörsch, Zoltán Szigeti:
The complexity of 2-vertex-connected orientation in mixed graphs. Discret. Optim. 48(Part 1): 100774 (2023) - [j46]Zoltán Szigeti:
Packing mixed hyperarborescences. Discret. Optim. 50: 100811 (2023) - [j45]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): 30 (2023) - [i14]Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti:
Directed hypergraph connectivity augmentation by hyperarc reorientations. CoRR abs/2304.14868 (2023) - [i13]Pierre Hoppenot, Zoltán Szigeti:
On reversing arcs to improve arc-connectivity. CoRR abs/2305.01444 (2023) - [i12]Zoltán Szigeti:
Packing mixed hyperarborescences. CoRR abs/2309.14513 (2023) - [i11]Pierre Hoppenot, Mathis Martin, Zoltán Szigeti:
Packing forests. CoRR abs/2310.13341 (2023) - 2022
- [j44]Florian Hörsch, Zoltán Szigeti:
Reachability in arborescence packings. Discret. Appl. Math. 320: 170-183 (2022) - [j43]Romain Chapoullié, Zoltán Szigeti:
On packing time-respecting arborescences. Discret. Optim. 45: 100702 (2022) - [j42]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): 1730-1747 (2022) - [i10]Florian Hörsch, Zoltán Szigeti:
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. CoRR abs/2202.13759 (2022) - [i9]Romain Chapoullié, Zoltán Szigeti:
On packing time-respecting arborescences. CoRR abs/2203.01096 (2022) - [i8]Florian Hörsch, Zoltán Szigeti:
Steiner connectivity problems in hypergraphs. CoRR abs/2211.02525 (2022) - 2021
- [j41]Florian Hörsch, Zoltán Szigeti:
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects. Algorithmica 83(8): 2333-2350 (2021) - [j40]Florian Hörsch, Zoltán Szigeti:
Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection. Electron. J. Comb. 28(3) (2021) - [j39]Florian Hoersch, Zoltán Szigeti:
Eulerian orientations and vertex-connectivity. Discret. Appl. Math. 289: 115-124 (2021) - [j38]Florian Hörsch, Zoltán Szigeti:
Connectivity of orientations of 3-edge-connected graphs. Eur. J. Comb. 94: 103292 (2021) - [i7]Florian Hörsch, Zoltán Szigeti:
A note on 2-vertex-connected orientations. CoRR abs/2112.07539 (2021) - 2020
- [j37]Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. J. Graph Theory 93(2): 230-252 (2020) - [j36]Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
Packing of arborescences with matroid constraints via matroid intersection. Math. Program. 181(1): 85-117 (2020) - [c11]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: 61:1-61:12 - [i6]Florian Hoersch, Zoltán Szigeti:
The (2, k)-connectivity augmentation problem: Algorithmic aspects. CoRR abs/2004.08645 (2020) - [i5]Florian Hörsch, Zoltán Szigeti:
Reachability in arborescence packings. CoRR abs/2006.16190 (2020) - [i4]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 abs/2008.03327 (2020) - [i3]Florian Hörsch, Zoltán Szigeti:
Connectivity of orientations of 3-edge-connected graphs. CoRR abs/2012.03259 (2020) - [i2]Florian Hörsch, Zoltán Szigeti:
Packing of mixed hyperarborescences with flexible roots via matroid intersection. CoRR abs/2012.13899 (2020)
2010 – 2019
- 2019
- [j35]Tatsuya Matsuoka, Zoltán Szigeti:
Polymatroid-based capacitated packing of branchings. Discret. Appl. Math. 270: 190-203 (2019) - [j34]Olivier Durand de Gevigney, Zoltán Szigeti:
On (2, k)?connected graphs. J. Graph Theory 91(4): 305-325 (2019) - 2018
- [j33]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: 26-33 (2018) - [j32]Olivier Durand de Gevigney, Zoltán Szigeti:
On minimally 2-T-connected directed graphs. Discret. Appl. Math. 250: 183-185 (2018) - 2017
- [j31]Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. Electron. Notes Discret. Math. 61: 451-457 (2017) - [j30]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): 335-382 (2017) - 2016
- [j29]András Sebö, Zoltán Szigeti:
Preface: Graph theory and combinatorics. Discret. Appl. Math. 209: 1 (2016) - 2014
- [j28]Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti:
Packing of rigid spanning subgraphs and spanning trees. J. Comb. Theory B 105: 17-25 (2014) - 2013
- [j27]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): 291-312 (2013) - [j26]Olivier Durand de Gevigney, Viet Hang Nguyen, Zoltán Szigeti:
Matroid-Based Packing of Arborescences. SIAM J. Discret. Math. 27(1): 567-574 (2013) - 2012
- [j25]Dieter Rautenbach, Zoltán Szigeti:
Greedy colorings of words. Discret. Appl. Math. 160(12): 1872-1874 (2012) - [j24]Neil Jami, Zoltán Szigeti:
Edge-connectivity of permutation hypergraphs. Discret. Math. 312(17): 2536-2539 (2012) - [j23]Olivier Durand de Gevigney, Sulamita Klein, Viet Hang Nguyen, Zoltán Szigeti:
Sandwich problems on orientations. J. Braz. Comput. Soc. 18(2): 85-93 (2012) - [i1]Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti:
Packing of Rigid Spanning Subgraphs and Spanning Trees. CoRR abs/1201.3727 (2012) - 2011
- [c10]Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti:
An Excluded Minor Characterization of Seymour Graphs. IPCO 2011: 1-13 - 2010
- [c9]Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SODA 2010: 1512-1520
2000 – 2009
- 2009
- [j22]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: 173-177 (2009) - 2008
- [j21]Roland Grappe, Zoltán Szigeti:
Covering symmetric semi-monotone functions. Discret. Appl. Math. 156(1): 138-144 (2008) - [j20]Zoltán Szigeti:
Edge-splittings preserving local edge-connectivity of graphs. Discret. Appl. Math. 156(7): 1011-1018 (2008) - [j19]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): 663-676 (2008) - [j18]Zoltán Szigeti:
Edge-connectivity augmentation of graphs over symmetric parity families. Discret. Math. 308(24): 6527-6532 (2008) - [c8]Zoltán Szigeti:
Edge-Connectivity Augmentations of Graphs and Hypergraphs. Bonn Workshop of Combinatorial Optimization 2008: 483-521 - 2006
- [j17]Zoltán Király, Zoltán Szigeti:
Simultaneous well-balanced orientations of graphs. J. Comb. Theory B 96(5): 684-692 (2006) - 2005
- [j16]Zoltán Szigeti:
On the local splitting theorem. Electron. Notes Discret. Math. 19: 57-61 (2005) - 2004
- [j15]Zoltán Szigeti:
On a min-max theorem on bipartite graphs. Discret. Math. 276(1-3): 353-361 (2004) - 2003
- [j14]Zoltán Szigeti:
On the graphic matroid parity problem. J. Comb. Theory B 88(2): 247-260 (2003) - [j13]Tibor Jordán, Zoltán Szigeti:
Detachments Preserving Local Edge-Connectivity of Graphs. SIAM J. Discret. Math. 17(1): 72-87 (2003) - 2002
- [j12]Zoltán Szigeti:
Perfect Matchings Versus Odd Cuts. Comb. 22(4): 575-589 (2002) - 2001
- [j11]András Frank, Tibor Jordán, Zoltán Szigeti:
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115(1-3): 37-47 (2001) - [j10]Zoltán Szigeti:
On Generalizations of Matching-covered Graphs. Eur. J. Comb. 22(6): 865-877 (2001) - [j9]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): 170-180 (2001) - 2000
- [j8]Zoltán Szigeti:
On min-max theorems in matching theory. Electron. Notes Discret. Math. 5: 291-294 (2000)
1990 – 1999
- 1999
- [j7]Zoltán Szigeti:
Hypergraph connectivity augmentation. Math. Program. 84(3): 519-527 (1999) - [j6]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): 160-207 (1999) - [c7]András Frank, Tibor Jordán, Zoltán Szigeti:
An Orientation Theorem with Parity Conditions. IPCO 1999: 183-190 - [c6]Zoltán Szigeti:
On Optimal Ear-Decompositions of Graphs. IPCO 1999: 415-428 - 1998
- [j5]Zoltán Szigeti:
The Two Ear Theorem on Matching-Covered Graphs. J. Comb. Theory B 74(1): 104-109 (1998) - [c5]Zoltán Szigeti:
On a Min-max Theorem of Cacti. IPCO 1998: 84-95 - [c4]Joseph Cheriyan, András Sebö, Zoltán Szigeti:
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. IPCO 1998: 126-136 - [c3]Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti:
Edge-Connectivity Augmentation with Partition Constraints. SODA 1998: 306-315 - 1997
- [j4]Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti:
A characterization of Seymour graphs. J. Graph Theory 24(4): 357-364 (1997) - 1996
- [j3]Zoltán Szigeti:
On a Matroid Defined by Ear-Decompositions of Graphs. Comb. 16(2): 233-241 (1996) - 1995
- [j2]András Frank, Zoltán Szigeti:
A note on packing paths in planar graphs. Math. Program. 70: 201-209 (1995) - [c2]Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti:
A Characterization of Seymour Graphs. IPCO 1995: 364-372 - 1994
- [j1]András Frank, Zoltán Szigeti:
On Packing T-Cuts. J. Comb. Theory B 61(2): 263-271 (1994) - 1993
- [c1]Zoltán Szigeti:
On Lovász's cathedral theorem. IPCO 1993: 413-423
Coauthor Index
aka: Florian Hoersch
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
