Péter Hajnal

According to our database1, Péter Hajnal authored at least 22 papers between 1983 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
On the Staircases of Gyárfás.
Electr. J. Comb., 2016

2015
Saturated Simple and 2-simple Topological Graphs with Few Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014
A Bijective Proof of Shapiro's Catalan Convolution.
Electr. J. Comb., 2014

2011
Elementary proof techniques for the maximum number of islands.
Eur. J. Comb., 2011

2010
Simply sequentially additive labelings of 2-regular graphs.
Discrete Mathematics, 2010

2006
Nearest Neighbor Representations of Boolean Functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006

2001
The Arc-Width of a Graph.
Electr. J. Comb., 2001

2000
Analysis of permutation routing algorithms.
European Journal of Operational Research, 2000

1997
Partition problems and kernels of graphs.
Discussiones Mathematicae Graph Theory, 1997

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

1993
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.
J. Algorithms, 1993

1992
Davenport-Schinzel theory of matrices.
Discrete Mathematics, 1992

On packing bipartite graphs.
Combinatorica, 1992

1991
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.
Combinatorica, 1991

1990
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

1989
Analysis of an Infinite Product Algorithm.
SIAM J. Discrete Math., 1989

1988
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
A Lower Bound for Read-Once-Only Branching Programs.
J. Comput. Syst. Sci., 1987

1986
Two lower bounds for branching programs
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

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


  Loading...