Péter Hajnal

According to our database, Péter Hajnal authored at least 28 papers between 1983 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Binary Numeration System with Alternating Signed Digits and Its Graph Theoretical Relationship.

Péter Hajnal

Algorithms, 2024

2023

A short note on Zeckendorf type numeration systems with negative digits allowed.

Péter Hajnal

Bull. ICA, 2023

2022

Nearest neighbor representations of Boolean functions.

Péter Hajnal, Zhihao Liu, György Turán

Inf. Comput., 2022

2018

Poly-Bernoulli Numbers and Eulerian Numbers.

Beáta Bényi, Péter Hajnal

J. Integer Seq., 2018

Saturated simple and 2-simple topological graphs with few edges.

Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz

J. Graph Algorithms Appl., 2018

2017

Combinatorial Properties of Poly-Bernoulli Relatives.

Beáta Bényi, Péter Hajnal

Integers, 2017

2016

On the Staircases of Gyárfás.

János Csányi, Péter Hajnal, Gábor V. Nagy

Electron. J. Comb., 2016

2015

Convex Polygons and Common Transversals.

Péter Hajnal, László I. Szabó, Vilmos Totik

Am. Math. Mon., 2015

2014

A Bijective Proof of Shapiro's Catalan Convolution.

Péter Hajnal, Gábor V. Nagy

Electron. J. Comb., 2014

2011

Elementary proof techniques for the maximum number of islands.

János Barát, Péter Hajnal, Eszter K. Horváth

Eur. J. Comb., 2011

2010

Simply sequentially additive labelings of 2-regular graphs.

Péter Hajnal, Gábor V. Nagy

Discret. Math., 2010

2001

Operations Which Preserve Path-Width at Most Two.

János Barát, Péter Hajnal

Comb. Probab. Comput., 2001

The Arc-Width of a Graph.

János Barát, Péter Hajnal

Electron. J. Comb., 2001

2000

Analysis of permutation routing algorithms.

József Békési, Gábor Galambos, Péter Hajnal

Eur. J. Oper. Res., 2000

1997

Partition problems and kernels of graphs.

Izak Broere, Péter Hajnal, Peter Mihók

Discuss. Math. Graph Theory, 1997

1996

Davenport-Schinzel Sequences and Their Geometric Applications (Micha Sharir and Pankaj K. Agarwal).

Péter Hajnal

SIAM Rev., 1996

1993

On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.

Elias Dahlhaus, Péter Hajnal, Marek Karpinski

J. Algorithms, 1993

1992

Davenport-Schinzel theory of matrices.

Zoltán Füredi, Péter Hajnal

Discret. Math., 1992

On packing bipartite graphs.

Péter Hajnal, Mario Szegedy

Comb., 1992

1991

A lower bound on the number of unit distances between the vertices of a convex polygon.

Herbert Edelsbrunner, Péter Hajnal

J. Comb. Theory, Ser. A, 1991

An Omega(n^4/3) lower bound on the randomized complexity of graph properties.

Péter Hajnal

Comb., 1991

1990

Brooks Coloring in Parallel.

Péter Hajnal, Endre Szemerédi

SIAM J. Discret. Math., 1990

On the Power of Randomness in the Decision Tree Model.

Péter Hajnal

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989

Analysis of an Infinite Product Algorithm.

Jean-Paul Allouche, Péter Hajnal, Jeffrey O. Shallit

SIAM J. Discret. Math., 1989

1988

Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs

Elias Dahlhaus, Péter Hajnal, Marek Karpinski

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

A Lower Bound for Read-Once-Only Branching Programs.

László Babai, Péter Hajnal, Endre Szemerédi, György Turán

J. Comput. Syst. Sci., 1987

1986

Two lower bounds for branching programs

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

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1983

Partition of graphs with condition on the connectivity and minimum degree.

Péter Hajnal

Comb., 1983