Gyula Pap
research fellow, member
|
 |
List of EGRES technical reports
- Covering minimum cost arborescences (Attila Bernáth, Gyula Pap)
- Tree metrics and edge-disjoint S-paths (Hiroshi Hirai, Gyula Pap)
- Strongly polynomial time solvability of integral and half-integral node-capacitated multiflow problems (Gyula Pap)
- An algorithm for weighted fractional matroid matching (Dion Gijswijt, Gyula Pap)
- A matroid intersection algorithm (Gyula Pap)
- Mader matroids are gammoids (Gyula Pap)
- Alternating paths revisited IV: packings and 2-packings of A-paths (Gyula Pap)
- Alternating paths revisited III: hypo-matchings in directed graphs (Gyula Pap)
- Alternating paths revisited II: restricted b-matchings in bipartite graphs (Gyula Pap)
- Packing non-returning A-paths (Gyula Pap)
- Alternating paths revisited I: even factors (Gyula Pap)
- A TDI description of restricted 2-matching polytopes (Gyula Pap)
- On factorizations of directed graphs by cycles (Gyula Pap, László Szegő)
- On the maximum even factor in weakly symmetric graphs (Gyula Pap, László Szegő)