Péter Hajnal

33 papers A* 2B 1Journal 28Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Binary Numeration System with Alternating Signed Digits and Its Graph Theoretical Relationship.
Algorithms
Péter Hajnal
2024 J jnl
Representations of Finite Groups by Posets of Small Height.
Order
Gergo Gyenizse, Péter Hajnal, László Zádori
2023 J jnl
A short note on Zeckendorf type numeration systems with negative digits allowed.
Bull. ICA
Péter Hajnal
2022 J jnl
Nearest neighbor representations of Boolean functions.
Inf. Comput.
Péter Hajnal, Zhihao Liu, György Turán
2020 J jnl
Nearest neighbor representations of Boolean functions.
CoRR
Péter Hajnal, Zhihao Liu, György Turán
2018 J jnl
Poly-Bernoulli Numbers and Eulerian Numbers.
J. Integer Seq.
Beáta Bényi, Péter Hajnal
2018 J jnl
Saturated simple and 2-simple topological graphs with few edges.
J. Graph Algorithms Appl.
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
2017 J jnl
Combinatorial Properties of Poly-Bernoulli Relatives.
Integers
Beáta Bényi, Péter Hajnal
2016 J jnl
On the Staircases of Gyárfás.
Electron. J. Comb.
János Csányi, Péter Hajnal, Gábor V. Nagy
2015 J jnl
Convex Polygons and Common Transversals.
Am. Math. Mon.
Péter Hajnal, László I. Szabó, Vilmos Totik
2015 B conf
Saturated Simple and 2-simple Topological Graphs with Few Edges.
WG
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
2015 J jnl
Saturated simple and 2-simple topological graphs with few edges.
CoRR
Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
2014 J jnl
A Bijective Proof of Shapiro's Catalan Convolution.
Electron. J. Comb.
Péter Hajnal, Gábor V. Nagy
2011 J jnl
Elementary proof techniques for the maximum number of islands.
Eur. J. Comb.
János Barát, Péter Hajnal, Eszter K. Horváth
2010 J jnl
Simply sequentially additive labelings of 2-regular graphs.
Discret. Math.
Péter Hajnal, Gábor V. Nagy
2006 — conf
Nearest Neighbor Representations of Boolean Functions.
AI&M
Péter Hajnal, Zhihao Liu, György Turán
2001 J jnl
Operations Which Preserve Path-Width at Most Two.
Comb. Probab. Comput.
János Barát, Péter Hajnal
2001 J jnl
The Arc-Width of a Graph.
Electron. J. Comb.
János Barát, Péter Hajnal
2000 J jnl
Analysis of permutation routing algorithms.
Eur. J. Oper. Res.
József Békési, Gábor Galambos, Péter Hajnal
1997 J jnl
Partition problems and kernels of graphs.
Discuss. Math. Graph Theory
Izak Broere, Péter Hajnal, Peter Mihók
1996 J jnl
Davenport-Schinzel Sequences and Their Geometric Applications (Micha Sharir and Pankaj K. Agarwal).
SIAM Rev.
Péter Hajnal
1993 J jnl
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.
J. Algorithms
Elias Dahlhaus, Péter Hajnal, Marek Karpinski
1992 J jnl
Davenport-Schinzel theory of matrices.
Discret. Math.
Zoltán Füredi, Péter Hajnal
1992 J jnl
On packing bipartite graphs.
Comb.
Péter Hajnal, Mario Szegedy
1991 J jnl
A lower bound on the number of unit distances between the vertices of a convex polygon.
J. Comb. Theory A
Herbert Edelsbrunner, Péter Hajnal
1991 J jnl
An Omega(n
Comb.
Péter Hajnal
1990 J jnl
Brooks Coloring in Parallel.
SIAM J. Discret. Math.
Péter Hajnal, Endre Szemerédi
1990 — conf
On the Power of Randomness in the Decision Tree Model.
SCT
Péter Hajnal
1989 J jnl
Analysis of an Infinite Product Algorithm.
SIAM J. Discret. Math.
Jean-Paul Allouche, Péter Hajnal, Jeffrey O. Shallit
1988 A* conf
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
FOCS
Elias Dahlhaus, Péter Hajnal, Marek Karpinski
1987 J jnl
A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci.
László Babai, Péter Hajnal, Endre Szemerédi, György Turán
1986 A* conf
Two lower bounds for branching programs
STOC
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
1983 J jnl
Partition of graphs with condition on the connectivity and minimum degree.
Comb.
Péter Hajnal