According to our database1, Péter Hajnal authored at least 22 papers between 1983 and 2016.
Legend:Book In proceedings Article PhD thesis Other
On the Staircases of Gyárfás.
Electr. J. Comb., 2016
Saturated Simple and 2-simple Topological Graphs with Few Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
A Bijective Proof of Shapiro's Catalan Convolution.
Electr. J. Comb., 2014
Elementary proof techniques for the maximum number of islands.
Eur. J. Comb., 2011
Simply sequentially additive labelings of 2-regular graphs.
Discrete Mathematics, 2010
Nearest Neighbor Representations of Boolean Functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006
The Arc-Width of a Graph.
Electr. J. Comb., 2001
Analysis of permutation routing algorithms.
European Journal of Operational Research, 2000
Partition problems and kernels of graphs.
Discussiones Mathematicae Graph Theory, 1997
Davenport-Schinzel Sequences and Their Geometric Applications (Micha Sharir and Pankaj K. Agarwal).
SIAM Review, 1996
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.
J. Algorithms, 1993
Davenport-Schinzel theory of matrices.
Discrete Mathematics, 1992
On packing bipartite graphs.
A lower bound on the number of unit distances between the vertices of a convex polygon.
J. Comb. Theory, Ser. A, 1991
An Omega(n4/3) lower bound on the randomized complexity of graph properties.
Brooks Coloring in Parallel.
SIAM J. Discrete Math., 1990
On the Power of Randomness in the Decision Tree Model.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990
Analysis of an Infinite Product Algorithm.
SIAM J. Discrete Math., 1989
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci., 1987
Two lower bounds for branching programs
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Partition of graphs with condition on the connectivity and minimum degree.