| Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph J Cheriyan, A Sebo, Z Szigeti SIAM Journal on Discrete Mathematics 14 (2), 170-180, 2001 | 109* | 2001 |
| Edge-Connectivity Augmentation with Partition Constraints J Bang-Jensen, H N. Gabow, T Jordán, Z Szigeti ACM-SIAM Symposium on Discrete Algorithms, 306-315, 1998 | 78 | 1998 |
| Simultaneous well-balanced orientations of graphs Z Király, Z Szigeti Journal of Combinatorial Theory, Series B 96 (5), 684-692, 2006 | 40 | 2006 |
| Matroid-based Packing of Arborescences O Durand de Gevigney, VH Nguyen, Z Szigeti | 38* | 2012 |
| Hypergraph connectivity augmentation Z Szigeti Mathematical programming 84 (3), 519-527, 1999 | 35 | 1999 |
| An orientation theorem with parity conditions A Frank, T Jordán, Z Szigeti Discrete Applied Mathematics 115 (1), 37-47, 2001 | 32 | 2001 |
| Perfect matchings versus odd cuts Z Szigeti Combinatorica 22 (4), 575-589, 2002 | 29* | 2002 |
| Detachments preserving local edge-connectivity of graphs T Jordán, Z Szigeti SIAM Journal on Discrete Mathematics 17 (1), 72-87, 2003 | 23 | 2003 |
| On a matroid defined by ear-decompositions of graphs Z Szigeti Combinatorica 16 (2), 233-241, 1996 | 23 | 1996 |
| Old and new results on packing arborescences in directed hypergraphs Q Fortier, C Király, M Léonard, Z Szigeti, A Talon Discrete Applied Mathematics 242, 26-33, 2018 | 22 | 2018 |
| Edge-connectivity augmentations of graphs and hypergraphs Z Szigeti Research Trends in Combinatorial Optimization: Bonn 2008, 483-521, 2009 | 22 | 2009 |
| Packing of rigid spanning subgraphs and spanning trees J Cheriyan, O Durand de Gevigney, Z Szigeti Journal of Combinatorial Theory, Series B 105, 17-25, 2014 | 20 | 2014 |
| Packing of arborescences with matroid constraints via matroid intersection C Király, Z Szigeti, S Tanigawa Mathematical Programming 181 (1), 85-117, 2020 | 16 | 2020 |
| A characterization of Seymour graphs AA Ageev, AV Kostochka, Z Szigeti Journal of Graph Theory 24 (4), 357-364, 1997 | 16* | 1997 |
| Edge-connectivity of permutation hypergraphs N Jami, Z Szigeti Discrete Mathematics 312 (17), 2536-2539, 2012 | 15 | 2012 |
| On the graphic matroid parity problem Z Szigeti Journal of Combinatorial Theory, Series B 88 (2), 247-260, 2003 | 15 | 2003 |
| The two ear theorem on matching-covered graphs Z Szigeti Journal of combinatorial theory. Series B 74 (1), 104-109, 1998 | 14 | 1998 |
| Recent Results on Well-Balanced Orientations A Bernáth, S Iwata, T Király, Z Király, Z Szigeti | 14* | |
| On generalizations of matching-covered graphs Z Szigeti European Journal of Combinatorics 22 (6), 865-877, 2001 | 12 | 2001 |
| A note on packing paths in planar graphs A Frank, Z Szigeti Mathematical programming 70 (1), 201-209, 1995 | 12 | 1995 |
András SebőDirecteur de Recherche, CNRS, Laboratoire G-SCOP, GrenobleVerified email at grenoble-inp.fr
