| |
| 2008 | ||
|---|---|---|
| 9 | EE | Gyula Pap: Packing non-returning A-paths algorithmically. Discrete Mathematics 308(8): 1472-1488 (2008) |
| 2007 | ||
| 8 | EE | Márton Makai, Gyula Pap, Jácint Szabó: Matching Problems in Polymatroids Without Double Circuits. IPCO 2007: 167-181 |
| 7 | EE | Gyula Pap: Some new results on node-capacitated packing of A-paths. STOC 2007: 599-604 |
| 6 | EE | Gyula Pap: Packing Non-Returning A-Paths. Combinatorica 27(2): 247-251 (2007) |
| 5 | EE | Gyula Pap: Combinatorial algorithms for matchings, even factors and square-free 2-factors. Math. Program. 110(1): 57-69 (2007) |
| 2005 | ||
| 4 | EE | Gyula Pap: A Combinatorial Algorithm to Find a Maximum Even Factor. IPCO 2005: 66-80 |
| 3 | EE | Gyula Pap: Packings and 2-packings of A-paths. Electronic Notes in Discrete Mathematics 22: 391-400 (2005) |
| 2004 | ||
| 2 | EE | Gyula Pap: A TDI Description of Restricted 2-Matching Polytopes. IPCO 2004: 139-151 |
| 1 | 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) |
| 1 | Márton Makai | [8] |
| 2 | Jácint Szabó | [8] |
| 3 | László Szegö | [1] |