| Publication | Date of Publication | Type |
|---|
| On Distinct Consecutive Differences | 2022-11-18 | Paper |
| Embedding Graphs into Larger Graphs: Results, Methods, and Problems | 2020-07-08 | Paper |
| Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs | 2019-10-17 | Paper |
| On distinct consecutive differences | 2019-10-04 | Paper |
| Two geometrical applications of the semi-random method | 2019-06-12 | Paper |
| Additive combinatorics and graph theory | 2018-11-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result | 2017-06-14 | Paper |
| On the Hamiltonicity of triple systems with high minimum degree | 2017-04-12 | Paper |
| Structural approach to subset sum problems | 2017-02-01 | Paper |
| Erdős’s Unit Distance Problem | 2016-10-18 | Paper |
| The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs | 2016-03-09 | Paper |
| Arithmetic progressions, different regularity lemmas and removal lemmas | 2015-10-16 | Paper |
| Autobiography | 2015-08-04 | Paper |
| The approximate Loebl-Koml\'os-S\'os Conjecture | 2012-11-13 | Paper |
| A Practical Regularity Partitioning Algorithm and its Applications in Clustering | 2012-09-28 | Paper |
| Monochromatic matchings in the shadow graph of almost complete hypergraphs | 2012-01-24 | Paper |
| Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs | 2011-06-14 | Paper |
| Partitioning 3-colored complete graphs into three monochromatic cycles | 2011-06-01 | Paper |
| A fast algorithm for equitable coloring | 2011-04-26 | Paper |
| Sparse partition universal graphs for graphs of bounded degree | 2011-03-29 | Paper |
| Tight bounds for embedding bounded degree trees | 2010-12-13 | Paper |
| Long monochromatic Berge cycles in colored 4-uniform hypergraphs | 2010-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3568712 | 2010-06-15 | Paper |
| Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs | 2010-04-22 | Paper |
| How to avoid using the regularity Lemma: Pósa's conjecture revisited | 2010-03-29 | Paper |
| Stability of the path-path Ramsey number | 2009-12-10 | Paper |
| Girth of sparse graphs | 2009-12-08 | Paper |
| Three-color Ramsey numbers for paths | 2009-07-20 | Paper |
| Perfect matchings in large uniform hypergraphs with large minimum collective degree | 2009-06-17 | Paper |
| The Ramsey number of diamond-matchings and loose cycles in hypergraphs | 2009-04-07 | Paper |
| An approximate Dirac-type theorem for \(k\)-uniform hypergraphs | 2008-10-21 | Paper |
| Quadripartite version of the Hajnal-Szemerédi theorem | 2008-09-04 | Paper |
| Subset sums modulo a prime | 2008-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431583 | 2007-12-11 | Paper |
| Tripartite Ramsey numbers for paths | 2007-06-11 | Paper |
| One-sided coverings of colored complete bipartite graphs | 2007-03-05 | Paper |
| An improved bound for the monochromatic cycle partition number | 2007-01-16 | Paper |
| Perfect matchings in uniform hypergraphs with large minimum degree | 2006-11-15 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Subset sums in $\BZ_p$ | 2006-10-05 | Paper |
| Finite and infinite arithmetic progressions in sumsets | 2006-08-28 | Paper |
| Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint) | 2006-08-04 | Paper |
| Short paths in quasi-random triple systems with sparse underlying graphs | 2006-07-12 | Paper |
| A Dirac-Type Theorem for 3-Uniform Hypergraphs | 2006-03-13 | Paper |
| On the Number of Monochromatic Solutions of x + y =z 2 | 2006-03-13 | Paper |
| Long arithmetic progressions in sumsets: Thresholds and bounds | 2005-10-06 | Paper |
| On a question of Erdős and Moser | 2005-09-26 | Paper |
| Long arithmetic progressions in sum-sets and the number x-sum-free sets | 2005-04-29 | Paper |
| Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736881 | 2004-08-11 | Paper |
| On the number of Hamiltonian cycles in Dirac graphs | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780792 | 2002-11-21 | Paper |
| Spanning trees in dense graphs | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228443 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228444 | 2002-01-20 | Paper |
| Proof of the Alon-Yuster conjecture | 2001-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234092 | 2001-08-28 | Paper |
| On the running time of the Adleman-Pomerance-Rumely primality test | 2001-06-12 | Paper |
| On size Ramsey numbers of graphs with bounded degree | 2001-04-01 | Paper |
| An algorithmic version of the blow-up lemma | 1999-08-02 | Paper |
| Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles | 1999-07-07 | Paper |
| Proof of the Seymour conjecture for large graphs | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242960 | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230323 | 1999-04-22 | Paper |
| Matching Nuts and Bolts in O(n log n) Time | 1998-09-21 | Paper |
| Blow-up lemma | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347905 | 1997-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347893 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875190 | 1996-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871074 | 1996-08-18 | Paper |
| Proof of a Packing Conjecture of Bollobás | 1996-07-17 | Paper |
| Topological cliques in graphs II | 1996-07-01 | Paper |
| On the Probability That a Random ± 1-Matrix Is Singular | 1996-01-24 | Paper |
| On a problem in additive number theory | 1995-07-18 | Paper |
| Dense graphs without 3-regular subgraphs | 1995-07-02 | Paper |
| A statistical theorem of set addition | 1995-05-15 | Paper |
| Topological Cliques in Graphs | 1995-03-20 | Paper |
| Turán-Ramsey Theorems and Kp-Independence Numbers | 1994-12-07 | Paper |
| Constructing Small Sets that are Uniform in Arithmetic Progressions | 1994-11-20 | Paper |
| Two tapes versus one for off-line Turing machines | 1994-05-08 | Paper |
| Turán-Ramsey theorems and simple asymptotically extremal structures | 1993-08-16 | Paper |
| The number of different distances determined by a set of points in the Euclidean plane | 1992-06-28 | Paper |
| An upper bound on the number of planar \(K\)-sets | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972306 | 1992-06-25 | Paper |
| Integer sets containing no arithmetic progressions | 1990-01-01 | Paper |
| Lower bounds to the complexity of symmetric Boolean functions | 1990-01-01 | Paper |
| Construction of a Thin Set with small Fourier Coefficients | 1990-01-01 | Paper |
| Brooks Coloring in Parallel | 1990-01-01 | Paper |
| Optimal parallel selection has complexity O(log log N) | 1989-01-01 | Paper |
| An Optimal-Time Algorithm for Slope Selection | 1989-01-01 | Paper |
| On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines | 1989-01-01 | Paper |
| On 3-pushdown graphs with large separators | 1989-01-01 | Paper |
| Sorting in Average Time $o(\log \,n)$ | 1989-01-01 | Paper |
| There are no p-complete families of symmetric Boolean functions | 1989-01-01 | Paper |
| Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes | 1989-01-01 | Paper |
| On Sets of Natural Numbers Whose Difference Set Contains No Squares | 1988-01-01 | Paper |
| The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ | 1988-01-01 | Paper |
| Many hard examples for resolution | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795242 | 1988-01-01 | Paper |
| A lower bound for read-once-only branching programs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698835 | 1985-01-01 | Paper |
| On the sum of the reciprocals of cycle lengths in sparse graphs | 1985-01-01 | Paper |
| Storing a Sparse Table with 0 (1) Worst Case Access Time | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5186278 | 1984-01-01 | Paper |
| On coloring graphs with locally small chromatic number | 1984-01-01 | Paper |
| On the distribution of cycle lengths in graphs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218717 | 1984-01-01 | Paper |
| A combinatorial distinction between the Euclidean and projective planes | 1983-01-01 | Paper |
| Extremal problems in discrete geometry | 1983-01-01 | Paper |
| Sorting in \(c \log n\) parallel steps | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041274 | 1983-01-01 | Paper |
| The Ramsey number of a graph with bounded maximum degree | 1983-01-01 | Paper |
| Limit distribution for the existence of Hamiltonian cycles in a random graph | 1983-01-01 | Paper |
| More results on Ramsey-Turán type problems | 1983-01-01 | Paper |
| Short cycles in directed graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3671179 | 1983-01-01 | Paper |
| Extremal uncrowded hypergraphs | 1982-01-01 | Paper |
| Largest random component of a k-cube | 1982-01-01 | Paper |
| A Lower Bound for Heilbronn'S Problem | 1982-01-01 | Paper |
| Upper bound for transversals of tripartite hypergraphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3966165 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956992 | 1982-01-01 | Paper |
| A dense infinite Sidon sequence | 1981-01-01 | Paper |
| On Turan's theorem for sparse graphs | 1981-01-01 | Paper |
| The longest path in a random graph | 1981-01-01 | Paper |
| On Heilbronn's Triangle Problem | 1981-01-01 | Paper |
| A note on Ramsey numbers | 1980-01-01 | Paper |
| Induced subtrees in graphs of large chromatic number | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933074 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910611 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669459 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950589 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4175585 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200109 | 1978-01-01 | Paper |
| Combinatorial properties of systems of sets | 1978-01-01 | Paper |
| Extremal Graphs without Large Forbidden Subgraphs | 1978-01-01 | Paper |
| On subgraph number independence in trees | 1978-01-01 | Paper |
| The analysis of double hashing | 1978-01-01 | Paper |
| There is no fast single hashing algorithm | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4119286 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079680 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4092018 | 1976-01-01 | Paper |
| On a problem of P. Erdős | 1976-01-01 | Paper |
| On sets of integers containing k elements in arithmetic progression | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4155536 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4059020 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4101924 | 1975-01-01 | Paper |
| On complete subgraphs of \(r\)-chromatic graphs | 1975-01-01 | Paper |
| Linear problems in combinatorial number theory | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4091941 | 1975-01-01 | Paper |
| On Sum-Free Subsequences | 1975-01-01 | Paper |
| On sparse graphs with dense long paths | 1975-01-01 | Paper |
| Some additive and multiplicative problem sin number theory | 1975-01-01 | Paper |
| On a problem of Davenport and Schinzel | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401979 | 1973-01-01 | Paper |
| On the difference of consecutive terms of sequences defined by divisibility properties, II | 1973-01-01 | Paper |
| On a problem of P. Erdős | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5680193 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4775928 | 1973-01-01 | Paper |
| On a Ramsey type theorem | 1972-01-01 | Paper |
| A Cure for the Telephone Disease | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5652761 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5636887 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5620621 | 1970-01-01 | Paper |
| On a conjecture of Erdös and Heilbronn | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5614074 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5613128 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5618445 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5582376 | 1969-01-01 | Paper |
| On sets of integers containing no four elements in arithmetic progression | 1969-01-01 | Paper |
| On the divisibility properties of sequences of integers (II) | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5610448 | 1968-01-01 | Paper |
| On the Solvability of Certain Equations in Sequences of Positive Upper Logarithmic Density | 1968-01-01 | Paper |
| On a problem of P. Erdos and S. Stein | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5525916 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5542202 | 1967-01-01 | Paper |
| On An Extremal Problem Concerning Primitive Sequences | 1967-01-01 | Paper |
| On a theorem of Behrend | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5523758 | 1966-01-01 | Paper |
| On the solvability of the equations \([a_i,a_j] = a_r\) and \((a'_i,a'_j) = a'_r\) in sequences of positive density | 1966-01-01 | Paper |
| On the divisibility properties of integers (I) | 1966-01-01 | Paper |
| Über ein Problem von Erdös und Moser | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5536358 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5342495 | 1964-01-01 | Paper |
