Gyula Pap

research fellow, member

Address:	Department of Operations Research
	Eötvös Loránd University
	1117 Budapest
	Pázmány Péter sétány, 1/C, 3-505
Tel:	(+36-1) 372-2500/8580
Email:	gyuszko_at_cs.elte.hu
Home page:	http://www.cs.elte.hu/~gyuszko
Publication list:	http://www.cs.cornell.edu/~pap/publications.html

List of EGRES technical reports

Synchronized Traveling Salesman Problem (Gyula Pap, József Varnyú)
Blocking optimal structures (Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap)
Blocking optimal arborescences (Attila Bernáth, Gyula Pap)
A note on bounded weighted graphic metric TSP (Ildikó Czeller, Gyula Pap)
Blocking unions of arborescences (Attila Bernáth, Gyula Pap)
Algorithms for multiplayer multicommodity flow problems (Attila Bernáth, Tamás Király, Erika Renáta Bérczi-Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László Végh)
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ő)

List of EGRES quick proofs

A note on maximum matroids of graphs (Gyula Pap)

Last modification: 3.5.2024. Please email your comments to Tamás Király!