The SCEAS System
Navigation Menu

Search the dblp DataBase


Gyula Pap: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gyula Pap
    A TDI Description of Restricted 2-Matching Polytopes. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:139-151 [Conf]
  2. Gyula Pap
    A Combinatorial Algorithm to Find a Maximum Even Factor. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:66-80 [Conf]
  3. Gyula Pap, László Szegö
    On the maximum even factor in weakly symmetric graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:201-213 [Journal]
  4. Gyula Pap
    Combinatorial algorithms for matchings, even factors and square-free 2-factors. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:57-69 [Journal]
  5. Márton Makai, Gyula Pap, Jácint Szabó
    Matching Problems in Polymatroids Without Double Circuits. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:167-181 [Conf]
  6. Gyula Pap
    Some new results on node-capacitated packing of A-paths. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:599-604 [Conf]
  7. Gyula Pap
    Packing Non-Returning A-Paths. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:247-251 [Journal]

  8. Matchings of cycles and paths in directed graphs. [Citation Graph (, )][DBLP]

  9. Packing non-returning A-paths algorithmically. [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002