PhD Thesis:

A constructive approach to matching and its applications, PhD thesis, 2007 PS

10-page summary of my thesis PS


P. Felzenszwalb, G. Pap, E. Tardos, R. Zabih: Globally Optimal Pixel Labeling Algorithms for Tree Metrics, IEEE Conference on Computer Vision and Pattern Recognition (2010), PDF

Z. Dvorak, S. Jendrol, D. Kral, G. Pap: Matchings and non-rainbow colorings, SIAM Journal on Discrete Mathematics 23 (2009), 344-348, PDF

Weighted Restricted 2-Matching, Mathematical Programming, Ser. B, (2008), PDF

Packing non-returning $A$-paths algorithmically, Discrete Mathematics, Volume 308, Issue 8, (April 2008) 1472-1488

Combinatorial algorithms for matchings, even factors and square-free 2-factors, Mathematical Programming Ser. B, Volume 110, Issue 1, (March 2007), 57-69. PS

Hypo-matchings in directed graphs, [in: Graph Theory 2004, Trends in Mathematics, Bondy, A.; Fonlupt, J.; Fouquet, J.-L.; Fournier, J.-C.; Ramírez Alfonsín, J.L., eds.], Birkhäuser Verlag, Basel, Switzerland (2006), 325-335. PS

A Combinatorial Algorithm to Find a Maximum Even Factor, IPCO XI, 2005, Berlin, [in: Integer Prog. and Comb. Opt., Jünger, Michael; Kaibel, Volker, eds.], Lecture Notes in Computer Science, LNCS 3509, Springer Verlag (2005), 66-80.

Packing non-returning $A$-paths, Combinatorica, Volume 27, Issue 2, (March 2007), 247-251. PS

(with László Szegő) Matchings of cycles and paths in directed graphs, Combinatorica, Volume 27, Issue 3, (2007), 383-398. PS

A TDI description of Restricted 2-Matching Polytopes, IPCO X, 2004, New York, [in: Integer Prog. and Comb. Opt., D. Bienstock, G. Nemhauser eds.], Lecture Notes in Computer Science, LNCS 3064, Springer Verlag (2004), 139-151.

(with M. Makai, J. Szabó) Matching Problems in Polymatroids Without Double Circuits, IPCO XII, 2007, Ithaca NY, [in: Integer Prog. and Comb. Opt., M. Fischetti, D.P. Williamson eds.], Lecture Notes in Computer Science, LNCS 4513, Springer Verlag (2007), 167-181.PDF

(with László Szegő) On the maximum even factor in weakly symmetric graphs, Journal of Combinatorial Theory Ser. B, 91/2 (2004) 201-213. PDF

Négyzetmentes 2-párosítások páros gráfokban [Square-free 2-matchings in bipartite graphs, in Hungarian], Matematikai Lapok, 13, 2006-2007/1, (2007), 49-56. PS


EGRES Technical Reports (download from: EGRES homepage)

EGRES TR-2011-13, (with Attila Bernáth) Covering minimum cost arborescences PDF

EGRES TR-2010-13, (with Hiroshi Hirai) Tree metrics and edge-disjoint S-paths PDF

EGRES TR-2008-12, Strongly polynomial time solvability of integral and half-integral node-capacitated multiflow problems PDF

EGRES TR-2008-11, (with Dion Gijswijt) An algorithm for weighted fractional matroid matching PDF

EGRES TR-2008-10, A matroid intersection algorithm PDF

EGRES TR-2006-17, Mader matroids are gammoids PDF

EGRES TR-2005-15, Alternating paths revisited IV: packings and 2-packings of A-paths PDF

EGRES TR-2005-14, Alternating paths revisited III: hypo-matchings in directed graphs PDF

EGRES TR-2005-13, Alternating paths revisited II: Ktt-free t-matchings PDF

EGRES TR-2005-12, Packing non-returning A-paths PDF

EGRES TR-2004-18, Alternating paths revisited I: even factors PDF

EGRES TR-2004-15, A TDI description of Restricted 2-Matching Polytopes PDF

EGRES TR-2004-01, (with László Szegő) On factorizations of directed graphs by cycles PDF

EGRES TR-2003-02, (with László Szegő) On the maximum even factor problem in weakly symmetric graphs PDF


"Algorithms for Multiflows", Discrete Mathematics and Optimization Seminar, McGill University, Montreal, 2009, slides

"An algorithm for fractional matroid matching (joint work with Dion Gijswijt)", Combinatorial Optimization, Oberwolfach, Germany, 2008, slides

"Algorithms for Multiflows", Combinatorial Optimization Workshop, Bonn, Germany, 2008, slides

"Algorithms for Multiflows", Theory Seminar, Computer Science Department, Cornell University, 2008, slides

"Node-capacitated packing of A-paths - How to make a polynomial algorithm strongly polynomial?", 12th Combinatorial Optimization Workshop, 2008, Aussois, France, slides

"A survey of results on packing A-paths", 5th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, 2007, Sendai, Japan, (invited talk), slides

"Some new results on node-capacitated packing of A-paths", STOC 2007, San Diego, U.S., slides

"A-utak pontkapacitásos pakolása" Magyar Operációkutatási Konferencia 2007, Balatonőszöd, slides

short presentation, Oberwolfach 2007, Graph Theory, slides

"Hypo-matchings in directed graphs", Graph Theory 2005, Nyborg, Denamrk, slides

"A new approach to alternating paths", Comb. Opt. 2005, Oberwolfach, Germany, Berlin, slides

"A new approach to alternating paths", The Hungarian Method is Fifty, 2005, the Hungarian Academy of Sciences, Budapest, Hungary (invited talk), slides

"Packings and 2-packings of A-paths", ICGT 2005, Hyeres

"Packing non-returning A-paths algorithmically", EUROCOMB 2005, Berlin, slides

"A combinatorial algorithm for the maximum even factor problem", IPCO XI 2005, Berlin

"Packing non-returning A-paths", 4th Japanese-Hungarian Symposium, 2005, Budapest, slides

"A combinatorial algorithm for maximum even factors", VOCAL, 2004, Veszprém

"Hypo-matchings in directed graphs, Graph Theory", 2004, Paris

"A TDI description of Restricted 2-Matching Polytopes", IPCO X, 2004, New York

"H-factors in directed graphs", EUROCOMB, 2003, Prague

"Even factors and ear-decompositions", 3rd Japanese-Hungarian  Symposium, 2003, Tokyo