Odd and Even Harder Problems on Cycle-Factors.

Gyula Pap

Florian Hörsch Csaba Király 0001 Lydia Mirabel Mendoza-Cadena Gyula Pap Eszter Szabó Yutaro Yamaguchi 0001 Odd and Even Harder Problems on Cycle-Factors. 2025 October abs/2510.18393 CoRR https://doi.org/10.48550/arXiv.2510.18393 db/journals/corr/corr2510.html#abs-2510-18393 streams/journals/corr

Alpár Jüttner Csaba Király 0001 Lydia Mirabel Mendoza-Cadena Gyula Pap Ildikó Schlotter Yutaro Yamaguchi 0001 Shortest odd paths in undirected graphs with conservative weight functions. 34-50 2024 357 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2024.05.044 db/journals/dam/dam357.html#JuttnerKCPSY24 streams/journals/dam

Alpár Jüttner Csaba Király 0001 Lydia Mirabel Mendoza-Cadena Gyula Pap Ildikó Schlotter Yutaro Yamaguchi 0001 Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. 2023 abs/2308.12653 CoRR https://doi.org/10.48550/arXiv.2308.12653 db/journals/corr/corr2308.html#abs-2308-12653

Gyula Pap József Varnyú Synchronized Traveling Salesman Problem. 437-459 2021 25 J. Graph Algorithms Appl. 1 https://doi.org/10.7155/jgaa.00566 db/journals/jgaa/jgaa25.html#PapV21

Gyula Pap József Varnyú Synchronized Traveling Salesman Problem. 2020 abs/2012.00311 CoRR https://arxiv.org/abs/2012.00311 db/journals/corr/corr2012.html#abs-2012-00311

Kristóf Bérczi Attila Bernáth Tamás Király Gyula Pap Blocking optimal structures. 1864-1872 2018 341 Discret. Math. 7 https://doi.org/10.1016/j.disc.2018.03.024 db/journals/dm/dm341.html#BercziBKP18

Attila Bernáth Gyula Pap Blocking optimal arborescences. 583-601 2017 161 Math. Program. 1-2 https://doi.org/10.1007/s10107-016-1025-3 db/journals/mp/mp161.html#BernathP17

Attila Bernáth Gyula Pap Blocking unions of arborescences. 277-290 2016 22 Discret. Optim. https://doi.org/10.1016/j.disopt.2016.08.003 db/journals/disopt/disopt22.html#BernathP16

Mátyás Barczy Kristóf Körmendi Gyula Pap Statistical inference for 2-type doubly symmetric critical irreducible continuous state and continuous time branching processes with immigration. 92-123 2015 139 J. Multivar. Anal. https://doi.org/10.1016/j.jmva.2015.03.005 db/journals/ma/ma139.html#BarczyKP15

Attila Bernáth Gyula Pap Blocking optimal arborescences. 2015 abs/1506.05677 CoRR http://arxiv.org/abs/1506.05677 db/journals/corr/corr1506.html#BernathP15

Attila Bernáth Gyula Pap Blocking unions of arborescences. 2015 abs/1507.00868 CoRR http://arxiv.org/abs/1507.00868 db/journals/corr/corr1507.html#BernathP15a

Hiroshi Hirai 0001 Gyula Pap Tree metrics and edge-disjoint S-paths. 81-123 2014 147 Math. Program. 1-2 https://doi.org/10.1007/s10107-013-0713-5 db/journals/mp/mp147.html#HiraiP14

Attila Bernáth Tamás Király Erika R. Kovács Gergely Mádi-Nagy Gyula Pap Júlia Pap Jácint Szabó László A. Végh Algorithms for multiplayer multicommodity flow problems. 699-712 2013 21 Central Eur. J. Oper. Res. 4 https://doi.org/10.1007/s10100-012-0255-6 db/journals/cejor/cejor21.html#BernathKKMPPSV13

Dion Gijswijt Gyula Pap An algorithm for weighted fractional matroid matching. 509-520 2013 103 J. Comb. Theory B 4 https://doi.org/10.1016/j.jctb.2013.05.004 db/journals/jct/jctb103.html#GijswijtP13

Attila Bernáth Gyula Pap Blocking Optimal Arborescences. 74-85 2013 IPCO https://doi.org/10.1007/978-3-642-36694-9_7 conf/ipco/2013 db/conf/ipco/ipco2013.html#BernathP13

Sándor Baran Gyula Pap Parameter estimation in a spatial unilateral unit root autoregressive model. 282-305 2012 107 J. Multivar. Anal. https://doi.org/10.1016/j.jmva.2012.01.022 db/journals/ma/ma107.html#BaranP12

Gábor Péter Nagy Gyula Pap Ágnes Szendrei Foreword. 151 2011 63 Period. Math. Hung. 2 https://doi.org/10.1007/s10998-011-8151-8 db/journals/pmh/pmh63.html#NagyPS11

Pedro F. Felzenszwalb Gyula Pap Éva Tardos Ramin Zabih Globally optimal pixel labeling algorithms for tree metrics. 3153-3160 2010 CVPR https://doi.org/10.1109/CVPR.2010.5540077 https://doi.ieeecomputersociety.org/10.1109/CVPR.2010.5540077 conf/cvpr/2010 db/conf/cvpr/cvpr2010.html#FelzenszwalbPTZ10

Sándor Baran Gyula Pap On the least squares estimator in a nearly unstable sequence of stationary spatial AR models. 686-698 2009 100 J. Multivar. Anal. 4 https://doi.org/10.1016/j.jmva.2008.07.003 db/journals/ma/ma100.html#BaranP09

Gyula Pap Weighted restricted 2-matching. 305-329 2009 119 Math. Program. 2 https://doi.org/10.1007/s10107-008-0211-3 db/journals/mp/mp119.html#Pap09

Zdenek Dvorák 0001 Stanislav Jendrol' Daniel Král Gyula Pap Matchings and Nonrainbow Colorings. 344-348 2009 23 SIAM J. Discret. Math. 1 https://doi.org/10.1137/060675927 https://www.wikidata.org/entity/Q57601468 db/journals/siamdm/siamdm23.html#DvorakJKP09

Gyula Pap Packing non-returning A-paths algorithmically. 1472-1488 2008 308 Discret. Math. 8 https://doi.org/10.1016/j.disc.2007.07.073 db/journals/dm/dm308.html#Pap08

Gyula Pap Packing Non-Returning <i>A</i>-Paths. 247-251 2007 27 Comb. 2 https://doi.org/10.1007/s00493-007-0056-z db/journals/combinatorica/combinatorica27.html#Pap07

Gyula Pap László Szegö Matchings of cycles and paths in directed graphs. 383-398 2007 27 Comb. 3 https://doi.org/10.1007/s00493-007-2131-x db/journals/combinatorica/combinatorica27.html#PapS07

Gyula Pap Combinatorial algorithms for matchings, even factors and square-free 2-factors. 57-69 2007 110 Math. Program. 1 https://doi.org/10.1007/s10107-006-0053-9 db/journals/mp/mp110.html#Pap07

Márton Makai Gyula Pap Jácint Szabó Matching Problems in Polymatroids Without Double Circuits. 167-181 2007 conf/ipco/2007 IPCO https://doi.org/10.1007/978-3-540-72792-7_14 db/conf/ipco/ipco2007.html#MakaiPS07 Gyula Pap Some new results on node-capacitated packing of A-paths. 599-604 2007 conf/stoc/2007 STOC https://doi.org/10.1145/1250790.1250878 db/conf/stoc/stoc2007.html#Pap07

József Gáll Gyula Pap Martien C. A. van Zuijlen Forward interest rate curves in discrete time settings driven by random fields. 387-396 2006 51 Comput. Math. Appl. 3-4 https://doi.org/10.1016/j.camwa.2005.10.002 db/journals/cma/cma51.html#GallPZ06

Gyula Pap Packings and 2-packings of A-paths. 391-400 2005 22 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2005.06.070 db/journals/endm/endm22.html#Pap05

Mátyás Barczy Gyula Pap Connection between deriving bridges and radial parts from multidimensional Ornstein-Uhlenbeck processes. 47-60 2005 50 Period. Math. Hung. 1-2 https://doi.org/10.1007/s10998-005-0002-z db/journals/pmh/pmh50.html#BarczyP05

Gyula Pap A Combinatorial Algorithm to Find a Maximum Even Factor. 66-80 2005 conf/ipco/2005 IPCO https://doi.org/10.1007/11496915_6 db/conf/ipco/ipco2005.html#Pap05

Gyula Pap László Szegö On the maximum even factor in weakly symmetric graphs. 201-213 2004 91 J. Comb. Theory B 2 https://doi.org/10.1016/j.jctb.2004.01.001 db/journals/jct/jctb91.html#PapS04

Gyula Pap A TDI Description of Restricted 2-Matching Polytopes. 139-151 https://doi.org/10.1007/978-3-540-25960-2_11 2004 conf/ipco/2004 IPCO db/conf/ipco/ipco2004.html#Pap04

Gyula Pap Marc Yor The Accuracy of Cauchy Approximation for the Windings of Planar Brownian Motion. 213-226 2000 41 Period. Math. Hung. 1-2 https://doi.org/10.1023/A%3A1010380808797 db/journals/pmh/pmh41.html#PapY00

Sándor Baran Mátyás Barczy Kristóf Bérczi Attila Bernáth Zdenek Dvorák 0001 Pedro F. Felzenszwalb József Gáll Dion Gijswijt Hiroshi Hirai 0001 Florian Hörsch Stanislav Jendrol' Alpár Jüttner Csaba Király 0001 Tamás Király Kristóf Körmendi Erika R. Kovács Daniel Král Gergely Mádi-Nagy Márton Makai Lydia Mirabel Mendoza-Cadena Gábor Péter Nagy Júlia Pap Ildikó Schlotter Jácint Szabó László Szegö Ágnes Szendrei Éva Tardos Eszter Tisljár-SzabóEszter Szabó József Varnyú László A. Végh Yutaro Yamaguchi 0001 Marc Yor Ramin Zabih Martien C. A. van Zuijlen