| 2008 |
|---|
| 25 | EE | Roland Grappe,
Zoltán Szigeti:
Covering symmetric semi-monotone functions.
Discrete Applied Mathematics 156(1): 138-144 (2008) |
| 24 | EE | Zoltán Szigeti:
Edge-splittings preserving local edge-connectivity of graphs.
Discrete Applied Mathematics 156(7): 1011-1018 (2008) |
| 23 | EE | Zoltán Szigeti:
Edge-connectivity augmentation of graphs over symmetric parity families.
Discrete Mathematics 308(24): 6527-6532 (2008) |
| 22 | EE | Attila Bernáth,
Satoru Iwata,
Tamás Király,
Zoltán Király,
Zoltán Szigeti:
Recent results on well-balanced orientations.
Discrete Optimization 5(4): 663-676 (2008) |
| 2006 |
|---|
| 21 | EE | Zoltán Király,
Zoltán Szigeti:
Simultaneous well-balanced orientations of graphs.
J. Comb. Theory, Ser. B 96(5): 684-692 (2006) |
| 2005 |
|---|
| 20 | EE | Zoltán Szigeti:
On the local splitting theorem.
Electronic Notes in Discrete Mathematics 19: 57-61 (2005) |
| 2004 |
|---|
| 19 | EE | Zoltán Szigeti:
On a min-max theorem on bipartite graphs.
Discrete Mathematics 276(1-3): 353-361 (2004) |
| 2003 |
|---|
| 18 | EE | Zoltán Szigeti:
On the graphic matroid parity problem.
J. Comb. Theory, Ser. B 88(2): 247-260 (2003) |
| 17 | EE | Tibor Jordán,
Zoltán Szigeti:
Detachments Preserving Local Edge-Connectivity of Graphs.
SIAM J. Discrete Math. 17(1): 72-87 (2003) |
| 2002 |
|---|
| 16 | EE | Zoltán Szigeti:
Perfect Matchings Versus Odd Cuts.
Combinatorica 22(4): 575-589 (2002) |
| 2001 |
|---|
| 15 | | András Frank,
Tibor Jordán,
Zoltán Szigeti:
Combinatorial problems related to origin-destination matrices.
Discrete Applied Mathematics 115(1-3): 37-47 (2001) |
| 14 | EE | Zoltán Szigeti:
On Generalizations of Matching-covered Graphs.
Eur. J. Comb. 22(6): 865-877 (2001) |
| 13 | EE | Joseph Cheriyan,
András Sebö,
Zoltán Szigeti:
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph.
SIAM J. Discrete Math. 14(2): 170-180 (2001) |
| 2000 |
|---|
| 12 | EE | Zoltán Szigeti:
On min-max theorems in matching theory.
Electronic Notes in Discrete Mathematics 5: 291-294 (2000) |
| 1999 |
|---|
| 11 | EE | András Frank,
Tibor Jordán,
Zoltán Szigeti:
An Orientation Theorem with Parity Conditions.
IPCO 1999: 183-190 |
| 10 | EE | Zoltán Szigeti:
On Optimal Ear-Decompositions of Graphs.
IPCO 1999: 415-428 |
| 9 | EE | Jørgen Bang-Jensen,
Harold N. Gabow,
Tibor Jordán,
Zoltán Szigeti:
Edge-Connectivity Augmentation with Partition Constraints.
SIAM J. Discrete Math. 12(2): 160-207 (1999) |
| 1998 |
|---|
| 8 | EE | Joseph Cheriyan,
András Sebö,
Zoltán Szigeti:
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs.
IPCO 1998: 126-136 |
| 7 | EE | Zoltán Szigeti:
On a Min-max Theorem of Cacti.
IPCO 1998: 84-95 |
| 6 | | Jørgen Bang-Jensen,
Harold N. Gabow,
Tibor Jordán,
Zoltán Szigeti:
Edge-Connectivity Augmentation with Partition Constraints.
SODA 1998: 306-315 |
| 5 | EE | Zoltán Szigeti:
The Two Ear Theorem on Matching-Covered Graphs.
J. Comb. Theory, Ser. B 74(1): 104-109 (1998) |
| 1996 |
|---|
| 4 | | Zoltán Szigeti:
On a Matroid Defined by Ear-Decompositions of Graphs.
Combinatorica 16(2): 233-241 (1996) |
| 1995 |
|---|
| 3 | | Alexander A. Ageev,
Alexandr V. Kostochka,
Zoltán Szigeti:
A Characterization of Seymour Graphs.
IPCO 1995: 364-372 |
| 1994 |
|---|
| 2 | EE | András Frank,
Zoltán Szigeti:
On Packing T-Cuts.
J. Comb. Theory, Ser. B 61(2): 263-271 (1994) |
| 1993 |
|---|
| 1 | | Zoltán Szigeti:
On Lovász's cathedral theorem.
IPCO 1993: 413-423 |
