Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Gyula Pap
@article{DBLP:journals/corr/abs-2308-12653,
author = {Alp{\'{a}}r J{\"{u}}ttner and
Csaba Kir{\'{a}}ly and
Lydia Mirabel Mendoza Cadena and
Gyula Pap and
Ildik{\'{o}} Schlotter and
Yutaro Yamaguchi},
title = {Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions},
journal = {CoRR},
volume = {abs/2308.12653},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.12653},
doi = {10.48550/ARXIV.2308.12653},
eprinttype = {arXiv},
eprint = {2308.12653},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-12653.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PapV21,
author = {Gyula Pap and
J{\'{o}}zsef Varny{\'{u}}},
title = {Synchronized Traveling Salesman Problem},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {437--459},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00566},
doi = {10.7155/JGAA.00566},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PapV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-00311,
author = {Gyula Pap and
J{\'{o}}zsef Varny{\'{u}}},
title = {Synchronized Traveling Salesman Problem},
journal = {CoRR},
volume = {abs/2012.00311},
year = {2020},
url = {https://arxiv.org/abs/2012.00311},
eprinttype = {arXiv},
eprint = {2012.00311},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-00311.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BercziBKP18,
author = {Krist{\'{o}}f B{\'{e}}rczi and
Attila Bern{\'{a}}th and
Tam{\'{a}}s Kir{\'{a}}ly and
Gyula Pap},
title = {Blocking optimal structures},
journal = {Discret. Math.},
volume = {341},
number = {7},
pages = {1864--1872},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.03.024},
doi = {10.1016/J.DISC.2018.03.024},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BercziBKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BernathP17,
author = {Attila Bern{\'{a}}th and
Gyula Pap},
title = {Blocking optimal arborescences},
journal = {Math. Program.},
volume = {161},
number = {1-2},
pages = {583--601},
year = {2017},
url = {https://doi.org/10.1007/s10107-016-1025-3},
doi = {10.1007/S10107-016-1025-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BernathP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BernathP16,
author = {Attila Bern{\'{a}}th and
Gyula Pap},
title = {Blocking unions of arborescences},
journal = {Discret. Optim.},
volume = {22},
pages = {277--290},
year = {2016},
url = {https://doi.org/10.1016/j.disopt.2016.08.003},
doi = {10.1016/J.DISOPT.2016.08.003},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BernathP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ma/BarczyKP15,
author = {M{\'{a}}ty{\'{a}}s Barczy and
Krist{\'{o}}f K{\"{o}}rmendi and
Gyula Pap},
title = {Statistical inference for 2-type doubly symmetric critical irreducible
continuous state and continuous time branching processes with immigration},
journal = {J. Multivar. Anal.},
volume = {139},
pages = {92--123},
year = {2015},
url = {https://doi.org/10.1016/j.jmva.2015.03.005},
doi = {10.1016/J.JMVA.2015.03.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ma/BarczyKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BernathP15,
author = {Attila Bern{\'{a}}th and
Gyula Pap},
title = {Blocking optimal arborescences},
journal = {CoRR},
volume = {abs/1506.05677},
year = {2015},
url = {http://arxiv.org/abs/1506.05677},
eprinttype = {arXiv},
eprint = {1506.05677},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BernathP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BernathP15a,
author = {Attila Bern{\'{a}}th and
Gyula Pap},
title = {Blocking unions of arborescences},
journal = {CoRR},
volume = {abs/1507.00868},
year = {2015},
url = {http://arxiv.org/abs/1507.00868},
eprinttype = {arXiv},
eprint = {1507.00868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BernathP15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HiraiP14,
author = {Hiroshi Hirai and
Gyula Pap},
title = {Tree metrics and edge-disjoint S-paths},
journal = {Math. Program.},
volume = {147},
number = {1-2},
pages = {81--123},
year = {2014},
url = {https://doi.org/10.1007/s10107-013-0713-5},
doi = {10.1007/S10107-013-0713-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HiraiP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/BernathKKMPPSV13,
author = {Attila Bern{\'{a}}th and
Tam{\'{a}}s Kir{\'{a}}ly and
Erika R. Kov{\'{a}}cs and
Gergely M{\'{a}}di{-}Nagy and
Gyula Pap and
J{\'{u}}lia Pap and
J{\'{a}}cint Szab{\'{o}} and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Algorithms for multiplayer multicommodity flow problems},
journal = {Central Eur. J. Oper. Res.},
volume = {21},
number = {4},
pages = {699--712},
year = {2013},
url = {https://doi.org/10.1007/s10100-012-0255-6},
doi = {10.1007/S10100-012-0255-6},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cejor/BernathKKMPPSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GijswijtP13,
author = {Dion Gijswijt and
Gyula Pap},
title = {An algorithm for weighted fractional matroid matching},
journal = {J. Comb. Theory, Ser. {B}},
volume = {103},
number = {4},
pages = {509--520},
year = {2013},
url = {https://doi.org/10.1016/j.jctb.2013.05.004},
doi = {10.1016/J.JCTB.2013.05.004},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GijswijtP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BernathP13,
author = {Attila Bern{\'{a}}th and
Gyula Pap},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {Blocking Optimal Arborescences},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {74--85},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_7},
doi = {10.1007/978-3-642-36694-9\_7},
timestamp = {Wed, 03 Apr 2024 19:56:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BernathP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ma/BaranP12,
author = {S{\'{a}}ndor Baran and
Gyula Pap},
title = {Parameter estimation in a spatial unilateral unit root autoregressive
model},
journal = {J. Multivar. Anal.},
volume = {107},
pages = {282--305},
year = {2012},
url = {https://doi.org/10.1016/j.jmva.2012.01.022},
doi = {10.1016/J.JMVA.2012.01.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ma/BaranP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pmh/NagyPS11,
author = {G{\'{a}}bor P{\'{e}}ter Nagy and
Gyula Pap and
{\'{A}}gnes Szendrei},
title = {Foreword},
journal = {Period. Math. Hung.},
volume = {63},
number = {2},
pages = {151},
year = {2011},
url = {https://doi.org/10.1007/s10998-011-8151-8},
doi = {10.1007/S10998-011-8151-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pmh/NagyPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cvpr/FelzenszwalbPTZ10,
author = {Pedro F. Felzenszwalb and
Gyula Pap and
{\'{E}}va Tardos and
Ramin Zabih},
title = {Globally optimal pixel labeling algorithms for tree metrics},
booktitle = {The Twenty-Third {IEEE} Conference on Computer Vision and Pattern
Recognition, {CVPR} 2010, San Francisco, CA, USA, 13-18 June 2010},
pages = {3153--3160},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CVPR.2010.5540077},
doi = {10.1109/CVPR.2010.5540077},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cvpr/FelzenszwalbPTZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ma/BaranP09,
author = {S{\'{a}}ndor Baran and
Gyula Pap},
title = {On the least squares estimator in a nearly unstable sequence of stationary
spatial {AR} models},
journal = {J. Multivar. Anal.},
volume = {100},
number = {4},
pages = {686--698},
year = {2009},
url = {https://doi.org/10.1016/j.jmva.2008.07.003},
doi = {10.1016/J.JMVA.2008.07.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ma/BaranP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Pap09,
author = {Gyula Pap},
title = {Weighted restricted 2-matching},
journal = {Math. Program.},
volume = {119},
number = {2},
pages = {305--329},
year = {2009},
url = {https://doi.org/10.1007/s10107-008-0211-3},
doi = {10.1007/S10107-008-0211-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Pap09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DvorakJKP09,
author = {Zdenek Dvor{\'{a}}k and
Stanislav Jendrol' and
Daniel Kr{\'{a}}l and
Gyula Pap},
title = {Matchings and Nonrainbow Colorings},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {344--348},
year = {2009},
url = {https://doi.org/10.1137/060675927},
doi = {10.1137/060675927},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DvorakJKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Pap08,
author = {Gyula Pap},
title = {Packing non-returning A-paths algorithmically},
journal = {Discret. Math.},
volume = {308},
number = {8},
pages = {1472--1488},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.07.073},
doi = {10.1016/J.DISC.2007.07.073},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Pap08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Pap07,
author = {Gyula Pap},
title = {Packing Non-Returning \emph{A}-Paths},
journal = {Comb.},
volume = {27},
number = {2},
pages = {247--251},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-0056-z},
doi = {10.1007/S00493-007-0056-Z},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Pap07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/PapS07,
author = {Gyula Pap and
L{\'{a}}szl{\'{o}} Szeg{\"{o}}},
title = {Matchings of cycles and paths in directed graphs},
journal = {Comb.},
volume = {27},
number = {3},
pages = {383--398},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-2131-x},
doi = {10.1007/S00493-007-2131-X},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/PapS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Pap07,
author = {Gyula Pap},
title = {Combinatorial algorithms for matchings, even factors and square-free
2-factors},
journal = {Math. Program.},
volume = {110},
number = {1},
pages = {57--69},
year = {2007},
url = {https://doi.org/10.1007/s10107-006-0053-9},
doi = {10.1007/S10107-006-0053-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Pap07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MakaiPS07,
author = {M{\'{a}}rton Makai and
Gyula Pap and
J{\'{a}}cint Szab{\'{o}}},
editor = {Matteo Fischetti and
David P. Williamson},
title = {Matching Problems in Polymatroids Without Double Circuits},
booktitle = {Integer Programming and Combinatorial Optimization, 12th International
{IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4513},
pages = {167--181},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72792-7\_14},
doi = {10.1007/978-3-540-72792-7\_14},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MakaiPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Pap07,
author = {Gyula Pap},
editor = {David S. Johnson and
Uriel Feige},
title = {Some new results on node-capacitated packing of A-paths},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {599--604},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250878},
doi = {10.1145/1250790.1250878},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Pap07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cma/GallPZ06,
author = {J{\'{o}}zsef G{\'{a}}ll and
Gyula Pap and
Martien C. A. van Zuijlen},
title = {Forward interest rate curves in discrete time settings driven by random
fields},
journal = {Comput. Math. Appl.},
volume = {51},
number = {3-4},
pages = {387--396},
year = {2006},
url = {https://doi.org/10.1016/j.camwa.2005.10.002},
doi = {10.1016/J.CAMWA.2005.10.002},
timestamp = {Wed, 12 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cma/GallPZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Pap05,
author = {Gyula Pap},
title = {Packings and 2-packings of A-paths},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {391--400},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.070},
doi = {10.1016/J.ENDM.2005.06.070},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Pap05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pmh/BarczyP05,
author = {M{\'{a}}ty{\'{a}}s Barczy and
Gyula Pap},
title = {Connection between deriving bridges and radial parts from multidimensional
Ornstein-Uhlenbeck processes},
journal = {Period. Math. Hung.},
volume = {50},
number = {1-2},
pages = {47--60},
year = {2005},
url = {https://doi.org/10.1007/s10998-005-0002-z},
doi = {10.1007/S10998-005-0002-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pmh/BarczyP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Pap05,
author = {Gyula Pap},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {A Combinatorial Algorithm to Find a Maximum Even Factor},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {66--80},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_6},
doi = {10.1007/11496915\_6},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Pap05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PapS04,
author = {Gyula Pap and
L{\'{a}}szl{\'{o}} Szeg{\"{o}}},
title = {On the maximum even factor in weakly symmetric graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {91},
number = {2},
pages = {201--213},
year = {2004},
url = {https://doi.org/10.1016/j.jctb.2004.01.001},
doi = {10.1016/J.JCTB.2004.01.001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/PapS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Pap04,
author = {Gyula Pap},
editor = {George L. Nemhauser and
Daniel Bienstock},
title = {A {TDI} Description of Restricted 2-Matching Polytopes},
booktitle = {Integer Programming and Combinatorial Optimization, 10th International
{IPCO} Conference, New York, NY, USA, June 7-11, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3064},
pages = {139--151},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-25960-2\_11},
doi = {10.1007/978-3-540-25960-2\_11},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Pap04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pmh/PapY00,
author = {Gyula Pap and
Marc Yor},
title = {The Accuracy of Cauchy Approximation for the Windings of Planar Brownian
Motion},
journal = {Period. Math. Hung.},
volume = {41},
number = {1-2},
pages = {213--226},
year = {2000},
url = {https://doi.org/10.1023/A\%3A1010380808797},
doi = {10.1023/A\%3A1010380808797},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pmh/PapY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 17:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
