| Combinatorial algorithms for matchings, even factors and square-free 2-factors G Pap Mathematical Programming 110 (1), 57-69, 2007 | 38 | 2007 |
| Packing non-returning A-paths G Pap Combinatorica 27 (2), 247-251, 2007 | 30 | 2007 |
| On the maximum even factor in weakly symmetric graphs G Pap, L Szegő Journal of Combinatorial Theory, Series B 91 (2), 201-213, 2004 | 25 | 2004 |
| Packing non-returning A-paths algorithmically G Pap Discrete Mathematics 308 (8), 1472-1488, 2008 | 22 | 2008 |
| An algorithm for weighted fractional matroid matching D Gijswijt, G Pap Journal of Combinatorial Theory, Series B 103 (4), 509-520, 2013 | 20 | 2013 |
| A TDI description of restricted 2-matching polytopes G Pap International Conference on Integer Programming and Combinatorial …, 2004 | 17 | 2004 |
| Blocking Optimal k-Arborescences A Bernáth, T Király Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 16 | 2016 |
| Globally optimal pixel labeling algorithms for tree metrics PF Felzenszwalb, G Pap, E Tardos, R Zabih 2010 IEEE Computer Society Conference on Computer Vision and Pattern …, 2010 | 16 | 2010 |
| Some new results on node-capacitated packing of A-paths G Pap Proceedings of the Thirty-ninth Annual ACM symposium on theory of computing …, 2007 | 16 | 2007 |
| Tree metrics and edge-disjoint -paths H Hirai, G Pap Mathematical Programming 147 (1), 81-123, 2014 | 15 | 2014 |
| A constructive approach to matching and its generalizations G Pap Ph. D. thesis, Eötvös Loránd University, 2006 | 15 | 2006 |
| Weighted linear matroid matching G Pap Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics …, 2013 | 13 | 2013 |
| Alternating paths revisited II: restricted b-matchings in bipartite graphs G Pap EGRES Technical Report TR-2005-13, 2005 | 12 | 2005 |
| Strongly polynomial time solvability of integral and half-integral node-capacitated multiflow problems G Pap Technical report, EGRES Technical Report, TR-2008-12, Eötvös Loránd University, 2008 | 10 | 2008 |
| A combinatorial algorithm to find a maximum even factor G Pap International Conference on Integer Programming and Combinatorial …, 2005 | 9 | 2005 |
| A matroid intersection algorithm G Pap Technical Report TR-2008-10, Egerváry Research Group on Combinatorial …, 2008 | 7 | 2008 |
| Blocking unions of arborescences A Bernáth, G Pap Discrete Optimization 22, 277-290, 2016 | 4 | 2016 |
| Algorithms for multiplayer multicommodity flow problems A Bernáth, T Király, ER Kovács, G Mádi-Nagy, G Pap, J Pap, J Szabó, ... Central European Journal of Operations Research 21, 699-712, 2013 | 4 | 2013 |
| Weighted restricted 2-matching G Pap Mathematical programming 119 (2), 305-329, 2009 | 3 | 2009 |
| Matchings and Nonrainbow Colorings Z Dvořák, S Jendrol', D Král', G Pap SIAM Journal on Discrete Mathematics 23 (1), 344-348, 2009 | 3 | 2009 |
