default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Hajnal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Péter Hajnal
:
Binary Numeration System with Alternating Signed Digits and Its Graph Theoretical Relationship. Algorithms 17(2): 55 (2024)- 2023
- [j24]Péter Hajnal:
A short note on Zeckendorf type numeration systems with negative digits allowed. Bull. ICA 97: 54-66 (2023) - 2022
- [j23]Péter Hajnal, Zhihao Liu, György Turán:
Nearest neighbor representations of Boolean functions. Inf. Comput. 285(Part): 104879 (2022) - 2020
- [i2]Péter Hajnal, Zhihao Liu, György Turán:
Nearest neighbor representations of Boolean functions. CoRR abs/2004.01741 (2020)
2010 – 2019
- 2018
- [j22]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated simple and 2-simple topological graphs with few edges. J. Graph Algorithms Appl. 22(1): 117-138 (2018) - [j21]Beáta Bényi, Péter Hajnal:
Poly-Bernoulli Numbers and Eulerian Numbers. J. Integer Seq. 21(6): 18.6.1 (2018) - 2017
- [j20]Beáta Bényi, Péter Hajnal:
Combinatorial Properties of Poly-Bernoulli Relatives. Integers 17: A31 (2017) - 2016
- [j19]János Csányi, Péter Hajnal, Gábor V. Nagy:
On the Staircases of Gyárfás. Electron. J. Comb. 23(2): 2 (2016) - 2015
- [j18]Péter Hajnal, László I. Szabó, Vilmos Totik:
Convex Polygons and Common Transversals. Am. Math. Mon. 122(9): 836-844 (2015) - [c5]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated Simple and 2-simple Topological Graphs with Few Edges. WG 2015: 391-405 - [i1]Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz:
Saturated simple and 2-simple topological graphs with few edges. CoRR abs/1503.01386 (2015) - 2014
- [j17]Péter Hajnal, Gábor V. Nagy:
A Bijective Proof of Shapiro's Catalan Convolution. Electron. J. Comb. 21(2): 2 (2014) - 2011
- [j16]János Barát, Péter Hajnal, Eszter K. Horváth:
Elementary proof techniques for the maximum number of islands. Eur. J. Comb. 32(2): 276-281 (2011) - 2010
- [j15]Péter Hajnal, Gábor V. Nagy:
Simply sequentially additive labelings of 2-regular graphs. Discret. Math. 310(4): 922-928 (2010)
2000 – 2009
- 2006
- [c4]Péter Hajnal, Zhihao Liu, György Turán:
Nearest Neighbor Representations of Boolean Functions. AI&M 2006 - 2001
- [j14]János Barát, Péter Hajnal:
The Arc-Width of a Graph. Electron. J. Comb. 8(1) (2001) - [j13]János Barát, Péter Hajnal:
Operations Which Preserve Path-Width at Most Two. Comb. Probab. Comput. 10(4): 277-291 (2001) - 2000
- [j12]József Békési, Gábor Galambos, Péter Hajnal:
Analysis of permutation routing algorithms. Eur. J. Oper. Res. 125(2): 249-256 (2000)
1990 – 1999
- 1997
- [j11]Izak Broere, Péter Hajnal, Peter Mihók:
Partition problems and kernels of graphs. Discuss. Math. Graph Theory 17(2): 311-313 (1997) - 1996
- [j10]Péter Hajnal:
Davenport-Schinzel Sequences and Their Geometric Applications (Micha Sharir and Pankaj K. Agarwal). SIAM Rev. 38(4): 689-691 (1996) - 1993
- [j9]Elias Dahlhaus, Péter Hajnal, Marek Karpinski:
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. J. Algorithms 15(3): 367-384 (1993) - 1992
- [j8]Péter Hajnal, Mario Szegedy:
On packing bipartite graphs. Comb. 12(3): 295-301 (1992) - [j7]Zoltán Füredi, Péter Hajnal:
Davenport-Schinzel theory of matrices. Discret. Math. 103(3): 233-251 (1992) - 1991
- [j6]Péter Hajnal:
An Omega(n4/3) lower bound on the randomized complexity of graph properties. Comb. 11(2): 131-143 (1991) - [j5]Herbert Edelsbrunner, Péter Hajnal:
A lower bound on the number of unit distances between the vertices of a convex polygon. J. Comb. Theory A 56(2): 312-316 (1991) - 1990
- [j4]Péter Hajnal, Endre Szemerédi:
Brooks Coloring in Parallel. SIAM J. Discret. Math. 3(1): 74-80 (1990) - [c3]Péter Hajnal:
On the Power of Randomness in the Decision Tree Model. SCT 1990: 66-77
1980 – 1989
- 1989
- [j3]Jean-Paul Allouche, Péter Hajnal, Jeffrey O. Shallit:
Analysis of an Infinite Product Algorithm. SIAM J. Discret. Math. 2(1): 1-15 (1989) - 1988
- [c2]Elias Dahlhaus, Péter Hajnal, Marek Karpinski:
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs. FOCS 1988: 186-193 - 1987
- [j2]László Babai, Péter Hajnal, Endre Szemerédi, György Turán:
A Lower Bound for Read-Once-Only Branching Programs. J. Comput. Syst. Sci. 35(2): 153-162 (1987) - 1986
- [c1]Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán:
Two lower bounds for branching programs. STOC 1986: 30-38 - 1983
- [j1]Péter Hajnal:
Partition of graphs with condition on the connectivity and minimum degree. Comb. 3(1): 95-99 (1983)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 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:
