Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Péter Hajnal
@article{DBLP:journals/algorithms/Hajnal24,
author = {P{\'{e}}ter Hajnal},
title = {Binary Numeration System with Alternating Signed Digits and Its Graph
Theoretical Relationship},
journal = {Algorithms},
volume = {17},
number = {2},
pages = {55},
year = {2024},
url = {https://doi.org/10.3390/a17020055},
doi = {10.3390/A17020055},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/Hajnal24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bullica/Hajnal23,
author = {P{\'{e}}ter Hajnal},
title = {A short note on Zeckendorf type numeration systems with negative digits
allowed},
journal = {Bull. {ICA}},
volume = {97},
pages = {54--66},
year = {2023},
url = {http://bica.the-ica.org/Volumes/97/Reprints/BICA2022-31-Reprint.pdf},
timestamp = {Fri, 03 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bullica/Hajnal23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HajnalLT22,
author = {P{\'{e}}ter Hajnal and
Zhihao Liu and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Nearest neighbor representations of Boolean functions},
journal = {Inf. Comput.},
volume = {285},
number = {Part},
pages = {104879},
year = {2022},
url = {https://doi.org/10.1016/j.ic.2022.104879},
doi = {10.1016/J.IC.2022.104879},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/HajnalLT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-01741,
author = {P{\'{e}}ter Hajnal and
Zhihao Liu and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Nearest neighbor representations of Boolean functions},
journal = {CoRR},
volume = {abs/2004.01741},
year = {2020},
url = {https://arxiv.org/abs/2004.01741},
eprinttype = {arXiv},
eprint = {2004.01741},
timestamp = {Wed, 08 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-01741.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HajnalIRS18,
author = {P{\'{e}}ter Hajnal and
Alexander Igamberdiev and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Saturated simple and 2-simple topological graphs with few edges},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {117--138},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00460},
doi = {10.7155/JGAA.00460},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HajnalIRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jintseq/BenyiH18,
author = {Be{\'{a}}ta B{\'{e}}nyi and
P{\'{e}}ter Hajnal},
title = {Poly-Bernoulli Numbers and Eulerian Numbers},
journal = {J. Integer Seq.},
volume = {21},
number = {6},
pages = {18.6.1},
year = {2018},
url = {https://cs.uwaterloo.ca/journals/JIS/VOL21/Benyi/benyi4.html},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jintseq/BenyiH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/int/BenyiH17,
author = {Be{\'{a}}ta B{\'{e}}nyi and
P{\'{e}}ter Hajnal},
title = {Combinatorial Properties of Poly-Bernoulli Relatives},
journal = {Integers},
volume = {17},
pages = {A31},
year = {2017},
url = {http://math.colgate.edu/\%7Eintegers/r31/r31.Abstract.html},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/int/BenyiH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CsanyiHN16,
author = {J{\'{a}}nos Cs{\'{a}}nyi and
P{\'{e}}ter Hajnal and
G{\'{a}}bor V. Nagy},
title = {On the Staircases of Gy{\'{a}}rf{\'{a}}s},
journal = {Electron. J. Comb.},
volume = {23},
number = {2},
pages = {2},
year = {2016},
url = {https://doi.org/10.37236/5697},
doi = {10.37236/5697},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CsanyiHN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/HajnalST15,
author = {P{\'{e}}ter Hajnal and
L{\'{a}}szl{\'{o}} I. Szab{\'{o}} and
Vilmos Totik},
title = {Convex Polygons and Common Transversals},
journal = {Am. Math. Mon.},
volume = {122},
number = {9},
pages = {836--844},
year = {2015},
url = {https://doi.org/10.4169/amer.math.monthly.122.9.836},
doi = {10.4169/AMER.MATH.MONTHLY.122.9.836},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tamm/HajnalST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HajnalIR015,
author = {P{\'{e}}ter Hajnal and
Alexander Igamberdiev and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
editor = {Ernst W. Mayr},
title = {Saturated Simple and 2-simple Topological Graphs with Few Edges},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {391--405},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_28},
doi = {10.1007/978-3-662-53174-7\_28},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HajnalIR015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HajnalIR015,
author = {P{\'{e}}ter Hajnal and
Alexander Igamberdiev and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Saturated simple and 2-simple topological graphs with few edges},
journal = {CoRR},
volume = {abs/1503.01386},
year = {2015},
url = {http://arxiv.org/abs/1503.01386},
eprinttype = {arXiv},
eprint = {1503.01386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HajnalIR015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HajnalN14,
author = {P{\'{e}}ter Hajnal and
G{\'{a}}bor V. Nagy},
title = {A Bijective Proof of Shapiro's Catalan Convolution},
journal = {Electron. J. Comb.},
volume = {21},
number = {2},
pages = {2},
year = {2014},
url = {https://doi.org/10.37236/3909},
doi = {10.37236/3909},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HajnalN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BaratHH11,
author = {J{\'{a}}nos Bar{\'{a}}t and
P{\'{e}}ter Hajnal and
Eszter K. Horv{\'{a}}th},
title = {Elementary proof techniques for the maximum number of islands},
journal = {Eur. J. Comb.},
volume = {32},
number = {2},
pages = {276--281},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2010.10.001},
doi = {10.1016/J.EJC.2010.10.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BaratHH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HajnalN10,
author = {P{\'{e}}ter Hajnal and
G{\'{a}}bor V. Nagy},
title = {Simply sequentially additive labelings of 2-regular graphs},
journal = {Discret. Math.},
volume = {310},
number = {4},
pages = {922--928},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.10.010},
doi = {10.1016/J.DISC.2009.10.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HajnalN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/HajnalLT06,
author = {P{\'{e}}ter Hajnal and
Zhihao Liu and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Nearest Neighbor Representations of Boolean Functions},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
AI{\&}Math 2006, Fort Lauderdale, Florida, USA, January 4-6, 2006},
year = {2006},
url = {http://anytime.cs.umass.edu/aimath06/proceedings/P44.pdf},
timestamp = {Tue, 08 Feb 2022 09:27:30 +0100},
biburl = {https://dblp.org/rec/conf/isaim/HajnalLT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BaratH01,
author = {J{\'{a}}nos Bar{\'{a}}t and
P{\'{e}}ter Hajnal},
title = {The Arc-Width of a Graph},
journal = {Electron. J. Comb.},
volume = {8},
number = {1},
year = {2001},
url = {https://doi.org/10.37236/1578},
doi = {10.37236/1578},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BaratH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BaratH01,
author = {J{\'{a}}nos Bar{\'{a}}t and
P{\'{e}}ter Hajnal},
title = {Operations Which Preserve Path-Width at Most Two},
journal = {Comb. Probab. Comput.},
volume = {10},
number = {4},
pages = {277--291},
year = {2001},
url = {https://doi.org/10.1017/S0963548301004709},
doi = {10.1017/S0963548301004709},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BaratH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BekesiGH00,
author = {J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
G{\'{a}}bor Galambos and
P{\'{e}}ter Hajnal},
title = {Analysis of permutation routing algorithms},
journal = {Eur. J. Oper. Res.},
volume = {125},
number = {2},
pages = {249--256},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00455-5},
doi = {10.1016/S0377-2217(99)00455-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/BekesiGH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroereHM97,
author = {Izak Broere and
P{\'{e}}ter Hajnal and
Peter Mih{\'{o}}k},
title = {Partition problems and kernels of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {17},
number = {2},
pages = {311--313},
year = {1997},
url = {https://doi.org/10.7151/dmgt.1058},
doi = {10.7151/DMGT.1058},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroereHM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/Hajnal96,
author = {P{\'{e}}ter Hajnal},
title = {Davenport-Schinzel Sequences and Their Geometric Applications (Micha
Sharir and Pankaj K. Agarwal)},
journal = {{SIAM} Rev.},
volume = {38},
number = {4},
pages = {689--691},
year = {1996},
url = {https://doi.org/10.1137/1038138},
doi = {10.1137/1038138},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/Hajnal96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DahlhausHK93,
author = {Elias Dahlhaus and
P{\'{e}}ter Hajnal and
Marek Karpinski},
title = {On the Parallel Complexity of Hamiltonian Cycle and Matching Problem
on Dense Graphs},
journal = {J. Algorithms},
volume = {15},
number = {3},
pages = {367--384},
year = {1993},
url = {https://doi.org/10.1006/jagm.1993.1046},
doi = {10.1006/JAGM.1993.1046},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/DahlhausHK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HajnalS92,
author = {P{\'{e}}ter Hajnal and
Mario Szegedy},
title = {On packing bipartite graphs},
journal = {Comb.},
volume = {12},
number = {3},
pages = {295--301},
year = {1992},
url = {https://doi.org/10.1007/BF01285818},
doi = {10.1007/BF01285818},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HajnalS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FurediH92,
author = {Zolt{\'{a}}n F{\"{u}}redi and
P{\'{e}}ter Hajnal},
title = {Davenport-Schinzel theory of matrices},
journal = {Discret. Math.},
volume = {103},
number = {3},
pages = {233--251},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90316-8},
doi = {10.1016/0012-365X(92)90316-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FurediH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Hajnal91,
author = {P{\'{e}}ter Hajnal},
title = {An Omega(n\({}^{\mbox{4/3}}\)) lower bound on the randomized complexity
of graph properties},
journal = {Comb.},
volume = {11},
number = {2},
pages = {131--143},
year = {1991},
url = {https://doi.org/10.1007/BF01206357},
doi = {10.1007/BF01206357},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Hajnal91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/EdelsbrunnerH91,
author = {Herbert Edelsbrunner and
P{\'{e}}ter Hajnal},
title = {A lower bound on the number of unit distances between the vertices
of a convex polygon},
journal = {J. Comb. Theory, Ser. {A}},
volume = {56},
number = {2},
pages = {312--316},
year = {1991},
url = {https://doi.org/10.1016/0097-3165(91)90042-F},
doi = {10.1016/0097-3165(91)90042-F},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/EdelsbrunnerH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HajnalS90,
author = {P{\'{e}}ter Hajnal and
Endre Szemer{\'{e}}di},
title = {Brooks Coloring in Parallel},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {1},
pages = {74--80},
year = {1990},
url = {https://doi.org/10.1137/0403008},
doi = {10.1137/0403008},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HajnalS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Hajnal90,
author = {P{\'{e}}ter Hajnal},
title = {On the Power of Randomness in the Decision Tree Model},
booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
8-11, 1990},
pages = {66--77},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/SCT.1990.113955},
doi = {10.1109/SCT.1990.113955},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Hajnal90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlloucheHS89,
author = {Jean{-}Paul Allouche and
P{\'{e}}ter Hajnal and
Jeffrey O. Shallit},
title = {Analysis of an Infinite Product Algorithm},
journal = {{SIAM} J. Discret. Math.},
volume = {2},
number = {1},
pages = {1--15},
year = {1989},
url = {https://doi.org/10.1137/0402001},
doi = {10.1137/0402001},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlloucheHS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DahlhausHK88,
author = {Elias Dahlhaus and
P{\'{e}}ter Hajnal and
Marek Karpinski},
title = {Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense
Graphs},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {186--193},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21936},
doi = {10.1109/SFCS.1988.21936},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DahlhausHK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BabaiHST87,
author = {L{\'{a}}szl{\'{o}} Babai and
P{\'{e}}ter Hajnal and
Endre Szemer{\'{e}}di and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {A Lower Bound for Read-Once-Only Branching Programs},
journal = {J. Comput. Syst. Sci.},
volume = {35},
number = {2},
pages = {153--162},
year = {1987},
url = {https://doi.org/10.1016/0022-0000(87)90010-9},
doi = {10.1016/0022-0000(87)90010-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BabaiHST87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AjtaiBHKPRST86,
author = {Mikl{\'{o}}s Ajtai and
L{\'{a}}szl{\'{o}} Babai and
P{\'{e}}ter Hajnal and
J{\'{a}}nos Koml{\'{o}}s and
Pavel Pudl{\'{a}}k and
Vojtech R{\"{o}}dl and
Endre Szemer{\'{e}}di and
Gy{\"{o}}rgy Tur{\'{a}}n},
editor = {Juris Hartmanis},
title = {Two lower bounds for branching programs},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {30--38},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12134},
doi = {10.1145/12130.12134},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AjtaiBHKPRST86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Hajnal83,
author = {P{\'{e}}ter Hajnal},
title = {Partition of graphs with condition on the connectivity and minimum
degree},
journal = {Comb.},
volume = {3},
number = {1},
pages = {95--99},
year = {1983},
url = {https://doi.org/10.1007/BF02579344},
doi = {10.1007/BF02579344},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Hajnal83.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-25 02:27 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:
