Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Pap, Gyula"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Blocking optimal arborescences
Attila Bernáth
,
Gyula Pap
Lecture Notes in Computer Science
7801
, 2013, pp. 74-85
An algorithm for weighted fractional matroid matching
Dion Gijswijt
,
Gyula Pap
Journal of Combinatorial Theory Series B
103
(4), 2013, pp. 509-520
Matchings and nonrainbow colorings
Zdenȇk Dvoȓák
,
Stanislav Jendrol'
,
Daniel Král'
,
Gyula Pap
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 344-348
Matching problems in polymatroids without double circuits
Márton Makai
,
Gyula Pap
,
Jácint Szabó
Lecture Notes in Computer Science
4513
, 2007, pp. 167-181
Matchings of cycles and paths in directed graphs
Gyula Pap
,
László Szegŏ
Combinatorica
27
(3), 2007, pp. 383-398
Packing non-returning
A
-paths
Gyula Pap
Combinatorica
27
(2), 2007, pp. 247-251
Some new results on node-capacitated packing of
A
-paths
Gyula Pap
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 599-604
A combinatorial algorithm to find a maximum even factor
Gyula Pap
Lecture Notes in Computer Science
3509
, 2005, pp. 66-80
On the maximum even factor in weakly symmetric graphs
Gyula Pap
,
László Szegö
Journal of Combinatorial Theory Series B
91
(2), 2004, pp. 201-213
A TDI description of restricted 2-matching polytopes
Gyula Pap
Lecture Notes in Computer Science
3064
, 2004, pp. 139-151