Spanning Trees in Dense Graphs
KOMLoS, JANOS, SARKoZY, GABOR N, SZEMEREDI, ENDRE
Published in Combinatorics, probability & computing (01.09.2001)
Published in Combinatorics, probability & computing (01.09.2001)
Get full text
Journal Article
The Generalization of Dirac’s Theorem for Hypergraphs
SZEMEREDI, Endre, RUCINSKI, Andrzej, RÖDL, Vojtech
Published in Lecture notes in computer science (2005)
Published in Lecture notes in computer science (2005)
Get full text
Book Chapter
Conference Proceeding
A Dirac-Type Theorem for 3-Uniform Hypergraphs
RÖDL, VOJTECH, RUCINSKI, ANDRZEJ, SZEMERÉDI, ENDRE
Published in Combinatorics, probability & computing (01.01.2006)
Published in Combinatorics, probability & computing (01.01.2006)
Get full text
Journal Article
An optimal-time algorithm for slope selection
COLE, R, SALOWE, J. S, STEIGER, W. L, SZEMEREDI, E
Published in SIAM journal on computing (01.08.1989)
Published in SIAM journal on computing (01.08.1989)
Get full text
Journal Article
Universality and tolerance
Alon, N., Capalbo, M., Kohayakawa, Y., Rodl, V., Rucinski, A., Szemeredi, E.
Published in Annual Symposium on Foundations of Computer Science (2000)
Published in Annual Symposium on Foundations of Computer Science (2000)
Get full text
Conference Proceeding
Journal Article
An algorithmic version of the blow-up lemma
Komlós, János, Sarkozy, Gabor N., Szemerédi, Endre
Published in Random structures & algorithms (01.05.1998)
Published in Random structures & algorithms (01.05.1998)
Get full text
Journal Article
On the square of a Hamiltonian cycle in dense graphs
Koml s, J nos, S rk zy, G bor N., Szemer di, Endre
Published in Random structures & algorithms (01.08.1996)
Published in Random structures & algorithms (01.08.1996)
Get full text
Journal Article
An upper bound on the number of planar k-sets
Pach, J., Steiger, W., Szemeredi, E.
Published in 30th Annual Symposium on Foundations of Computer Science (1989)
Published in 30th Annual Symposium on Foundations of Computer Science (1989)
Get full text
Conference Proceeding
Optimal parallel selection has complexity O(Log Log N)
Ajtai, Miklós, Komlós, János, Steiger, W.L., Szemerédi, Endre
Published in Journal of computer and system sciences (01.02.1989)
Published in Journal of computer and system sciences (01.02.1989)
Get full text
Journal Article
A lower bound for read-once-only branching programs
Babai, László, Hajnal, Péter, Szemerédi, Endre, Turán, György
Published in Journal of computer and system sciences (01.10.1987)
Published in Journal of computer and system sciences (01.10.1987)
Get full text
Journal Article