| 2001 |
|---|
| 13 | EE | János Barát,
Péter Hajnal:
The Arc-Width of a Graph.
Electr. J. Comb. 8(1): (2001) |
| 1993 |
|---|
| 12 | | 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 |
|---|
| 11 | | Péter Hajnal,
Mario Szegedy:
On packing bipartite graphs.
Combinatorica 12(3): 295-301 (1992) |
| 10 | EE | Zoltán Füredi,
Péter Hajnal:
Davenport-Schinzel theory of matrices.
Discrete Mathematics 103(3): 233-251 (1992) |
| 1991 |
|---|
| 9 | | Péter Hajnal:
An Omega(n4/3) lower bound on the randomized complexity of graph properties.
Combinatorica 11(2): 131-143 (1991) |
| 8 | EE | Herbert Edelsbrunner,
Péter Hajnal:
A lower bound on the number of unit distances between the vertices of a convex polygon.
J. Comb. Theory, Ser. A 56(2): 312-316 (1991) |
| 1990 |
|---|
| 7 | | Péter Hajnal:
On the Power of Randomness in the Decision Tree Model.
Structure in Complexity Theory Conference 1990: 66-77 |
| 6 | | Péter Hajnal,
Endre Szemerédi:
Brooks Coloring in Parallel.
SIAM J. Discrete Math. 3(1): 74-80 (1990) |
| 1989 |
|---|
| 5 | | Jean-Paul Allouche,
Péter Hajnal,
Jeffrey Shallit:
Analysis of an Infinite Product Algorithm.
SIAM J. Discrete Math. 2(1): 1-15 (1989) |
| 1988 |
|---|
| 4 | | Elias Dahlhaus,
Péter Hajnal,
Marek Karpinski:
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
FOCS 1988: 186-193 |
| 1987 |
|---|
| 3 | | 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 |
|---|
| 2 | | 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 |
|---|
| 1 | | Péter Hajnal:
Partition of graphs with condition on the connectivity and minimum degree.
Combinatorica 3(1): 95-99 (1983) |
