The preliminary versions of some of my papers can be downloaded from here. Choose Tech. Reports.

Last Update: April 7, 2006.

PAPERS IN JOURNALS

J1. László Szegõ, A Note on Covering Intersecting Set-Systems by Digraphs, Discrete Mathematics, Vol 234, Issue 1-3 (2001) 187-189.

J2. András Frank and L. Szegõ, A Note on the Path-Matching Formula, Journal of Graph Theory, Vol 41, Issue 2, (2002) 110-119.

J3. András Frank and L. Szegõ, Constructive Characterizations on Packing and Covering by Trees. Discrete Applied Mathematics, Vol 131, Issue 2 (2003) 347-371.

J4. Bianca Spille and L. Szegõ, A Gallai-Edmonds-type Structure Theorem for Path-Matchings, Journal of Graph Theory, Vol 46, Issue 2 (2004) 93-102.

J5. Gyula Pap and L. Szegõ, On the Maximum Even Factor in Weakly Symmetric Digraphs, Journal of Combinatorial Theory Ser. B, Vol 91 Issue 2 (2004) 201-213.

J6. Johanna Becker, Zsolt Csizmadia, Jerome Galtier, Alexandre Laugier, Jacint Szabo, Laszlo Szego, An integer programming solution in daisy networks, Networks Volume 47, Issue 2 (2006) 116 - 121.

J7. Gyula Pap and L. Szegõ, Matchings of cycles and paths in directed graphs, Combinatorica, Vol 27, Issue 3 (2007) 383-398.

J8. Zsolt Fekete and L. Szegõ, A note on [k,l]-sparse graphs, in: Graph Theory in Paris, Eds: Bondy, Fonlupt, Fouquet, Fournier, and Alfonsin; Birkhauser Basel, 2007, pages 169 - 177.

J9. L. Szegõ, On constructive characterizations of (k,l)-sparse graphs, European Journal of Combinatorics, Volume 27 Issue 7 (2006), 1211 - 1223.

CONFERENCE PROCEEDINGS

P1. L. Szegõ, A Note on Covering Intersecting Set-Systems by Digraphs,, The Proceedings of the First Japanese-Hungarian Symposium on Discrete Mathematics, Kyoto (1999) 37--38.

P2. A. Frank and L. Szegõ, An Extension of a Theorem of Henneberg and Laman, in: Integer Programming and Combinatorial Optimization (Proceedings 8th International IPCO Conference, Utrecht, 2001; K. Aardal, B. Gerards , eds.) [Lecture Notes in Computer Science 0302] Springer-Verlag Heidelberg, 2001, pp. 145-159.

P3. G. Pap and L. Szegõ, On the Maximum Even Factor in Weakly Symmetric Digraphs, The Proceedings of the Third Japanese-Hungarian Symposium on Discrete Mathematics, Tokyo (2003) 8--17.

P4. András Sebõ and L. Szegõ, The Path-packing Structure of Graphs, in: Integer Programming and Combinatorial Optimization (Proceedings 10th International IPCO Conference, New York, 2004; D. Bienstock, G. Nemhauser, eds.) [Lecture Notes in Computer Science 3064], Springer-Verlag Heidelberg, 2004, pp. 256 - 270.

TRANSLATION

Cormen, Leiserson, Rivest: Algoritmusok (27. fejezet) Mûszaki Kiadó, 1999., 2000., 2001., 2003. (Introduction to Algorithms, Chapter 27).

Cormen, Leiserson, Rivest, Stein: Új algoritmusok (26. fejezet) Scolar Kiadó, 2003. (Introduction to Algorithms, Second Edition, Chapter 26).

THESIS

L. Szegõ, Structure Theorems in Combinatorial Optimization, PhD thesis, Eotvos University, Budapest, Hungary, 2002.