Gyula Pap

34 papers A* 2B 4Journal 28
YearRankTypeTitle / Venue / Authors
2025 J jnl
Odd and Even Harder Problems on Cycle-Factors.
CoRR
Florian Hörsch, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Eszter Szabó, Yutaro Yamaguchi
2024 J jnl
Shortest odd paths in undirected graphs with conservative weight functions.
Discret. Appl. Math.
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
2023 J jnl
Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions.
CoRR
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
2021 J jnl
Synchronized Traveling Salesman Problem.
J. Graph Algorithms Appl.
Gyula Pap, József Varnyú
2020 J jnl
Synchronized Traveling Salesman Problem.
CoRR
Gyula Pap, József Varnyú
2018 J jnl
Blocking optimal structures.
Discret. Math.
Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap
2017 J jnl
Blocking optimal arborescences.
Math. Program.
Attila Bernáth, Gyula Pap
2016 J jnl
Blocking unions of arborescences.
Discret. Optim.
Attila Bernáth, Gyula Pap
2015 J jnl
Blocking optimal arborescences.
CoRR
Attila Bernáth, Gyula Pap
2015 J jnl
Blocking unions of arborescences.
CoRR
Attila Bernáth, Gyula Pap
2015 J jnl
Statistical inference for 2-type doubly symmetric critical irreducible continuous state and continuous time branching processes with immigration.
J. Multivar. Anal.
Mátyás Barczy, Kristóf Körmendi, Gyula Pap
2014 J jnl
Tree metrics and edge-disjoint S-paths.
Math. Program.
Hiroshi Hirai, Gyula Pap
2013 J jnl
Algorithms for multiplayer multicommodity flow problems.
Central Eur. J. Oper. Res.
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
2013 J jnl
An algorithm for weighted fractional matroid matching.
J. Comb. Theory B
Dion Gijswijt, Gyula Pap
2013 B conf
Blocking Optimal Arborescences.
IPCO
Attila Bernáth, Gyula Pap
2012 J jnl
Parameter estimation in a spatial unilateral unit root autoregressive model.
J. Multivar. Anal.
Sándor Baran, Gyula Pap
2011 J jnl
Foreword.
Period. Math. Hung.
Gábor Péter Nagy, Gyula Pap, Ágnes Szendrei
2010 A* conf
Globally optimal pixel labeling algorithms for tree metrics.
CVPR
Pedro F. Felzenszwalb, Gyula Pap, Éva Tardos, Ramin Zabih
2009 J jnl
Matchings and Nonrainbow Colorings.
SIAM J. Discret. Math.
Zdenek Dvorák, Stanislav Jendrol', Daniel Král, Gyula Pap
2009 J jnl
On the least squares estimator in a nearly unstable sequence of stationary spatial AR models.
J. Multivar. Anal.
Sándor Baran, Gyula Pap
2009 J jnl
Weighted restricted 2-matching.
Math. Program.
Gyula Pap
2008 J jnl
Packing non-returning A-paths algorithmically.
Discret. Math.
Gyula Pap
2007 J jnl
Combinatorial algorithms for matchings, even factors and square-free 2-factors.
Math. Program.
Gyula Pap
2007 B conf
Matching Problems in Polymatroids Without Double Circuits.
IPCO
Márton Makai, Gyula Pap, Jácint Szabó
2007 J jnl
Matchings of cycles and paths in directed graphs.
Comb.
Gyula Pap, László Szegö
2007 J jnl
Packing Non-Returning
Comb.
Gyula Pap
2007 A* conf
Some new results on node-capacitated packing of A-paths.
STOC
Gyula Pap
2006 J jnl
Forward interest rate curves in discrete time settings driven by random fields.
Comput. Math. Appl.
József Gáll, Gyula Pap, Martien C. A. van Zuijlen
2005 B conf
A Combinatorial Algorithm to Find a Maximum Even Factor.
IPCO
Gyula Pap
2005 J jnl
Connection between deriving bridges and radial parts from multidimensional Ornstein-Uhlenbeck processes.
Period. Math. Hung.
Mátyás Barczy, Gyula Pap
2005 J jnl
Packings and 2-packings of A-paths.
Electron. Notes Discret. Math.
Gyula Pap
2004 B conf
A TDI Description of Restricted 2-Matching Polytopes.
IPCO
Gyula Pap
2004 J jnl
On the maximum even factor in weakly symmetric graphs.
J. Comb. Theory B
Gyula Pap, László Szegö
2000 J jnl
The Accuracy of Cauchy Approximation for the Windings of Planar Brownian Motion.
Period. Math. Hung.
Gyula Pap, Marc Yor