| 2006 |
|---|
| 8 | EE | László Szegö:
On constructive characterizations of (k, l)-sparse graphs.
Eur. J. Comb. 27(7): 1211-1223 (2006) |
| 7 | EE | Johanna Becker,
Zsolt Csizmadia,
Jérôme Galtier,
Alexandre Laugier,
Jácint Szabó,
László Szegö:
An integer programming approach to routing in daisy networks.
Networks 47(2): 116-121 (2006) |
| 2004 |
|---|
| 6 | EE | András Sebö,
László Szegö:
The Path-Packing Structure of Graphs.
IPCO 2004: 256-270 |
| 5 | EE | Gyula Pap,
László Szegö:
On the maximum even factor in weakly symmetric graphs.
J. Comb. Theory, Ser. B 91(2): 201-213 (2004) |
| 4 | EE | Bianca Spille,
László Szegö:
A Gallai-Edmonds-type structure theorem for path-matchings.
Journal of Graph Theory 46(2): 93-102 (2004) |
| 2003 |
|---|
| 3 | EE | András Frank,
László Szegö:
Constructive characterizations for packing and covering with trees.
Discrete Applied Mathematics 131(2): 347-371 (2003) |
| 2001 |
|---|
| 2 | EE | András Frank,
László Szegö:
An Extension of a Theorem of Henneberg and Laman.
IPCO 2001: 145-159 |
| 1 | EE | László Szegö:
On covering intersecting set-systems by digraphs.
Discrete Mathematics 234(1-3): 187-189 (2001) |
