Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Haxell, P.E.
Nagle, B.
and
Rodl, V.
2005.
An Algorithmic Version of the Hypergraph Regularity Method.
p.
439.
Rödl, V.
Nagle, B.
Skokan, J.
Schacht, M.
and
Kohayakawa, Y.
2005.
The hypergraph regularity method and its applications.
Proceedings of the National Academy of Sciences,
Vol. 102,
Issue. 23,
p.
8109.
Rödl, Vojtěch
and
Skokan, Jozef
2006.
Applications of the regularity lemma for uniform hypergraphs.
Random Structures & Algorithms,
Vol. 28,
Issue. 2,
p.
180.
Solymosi, József
2006.
Dense Arrangements are Locally Very Dense. I.
SIAM Journal on Discrete Mathematics,
Vol. 20,
Issue. 3,
p.
623.
Tao, Terence
2006.
The Gaussian primes contain arbitrarily shaped constellations.
Journal d'Analyse Mathématique,
Vol. 99,
Issue. 1,
p.
109.
Tao, Terence
2006.
A variant of the hypergraph removal lemma.
Journal of Combinatorial Theory, Series A,
Vol. 113,
Issue. 7,
p.
1257.
Rödl, V.
Tengan, E.
Schacht, M.
and
Tokushige, N.
2006.
Density theorems and extremal hypergraph problems.
Israel Journal of Mathematics,
Vol. 152,
Issue. 1,
p.
371.
Nagle, Brendan
Rödl, Vojtěch
and
Schacht, Mathias
2006.
Topics in Discrete Mathematics.
Vol. 26,
Issue. ,
p.
247.
Nagle, Brendan
Rödl, Vojtěch
and
Schacht, Mathias
2006.
The counting lemma for regular k‐uniform hypergraphs.
Random Structures & Algorithms,
Vol. 28,
Issue. 2,
p.
113.
RÖDL, VOJTĚCH
and
SCHACHT, MATHIAS
2007.
Regular Partitions of Hypergraphs: Regularity Lemmas.
Combinatorics, Probability and Computing,
Vol. 16,
Issue. 6,
p.
833.
Nagle, Brendan
Rödl, Vojtěch
and
Schacht, Mathias
2008.
Note on the 3-graph counting lemma.
Discrete Mathematics,
Vol. 308,
Issue. 19,
p.
4501.
Iosevich, A.
and
Jaming, P.
2008.
Distance sets that are a shift of the integers and Fourier basis for planar convex sets.
Acta Mathematica Hungarica,
Vol. 121,
Issue. 1-2,
p.
107.
Haxell, P. E.
Nagle, B.
and
Rödl, V.
2008.
An Algorithmic Version of the Hypergraph Regularity Method.
SIAM Journal on Computing,
Vol. 37,
Issue. 6,
p.
1728.
Král', Daniel
Serra, Oriol
and
Vena, Lluís
2009.
A combinatorial proof of the Removal Lemma for Groups.
Journal of Combinatorial Theory, Series A,
Vol. 116,
Issue. 4,
p.
971.
Rödl, Vojtěch
and
Schacht, Mathias
2009.
Generalizations of the removal lemma.
Combinatorica,
Vol. 29,
Issue. 4,
p.
467.
Rödl, Vojtěch
and
Schacht, Mathias
2010.
Fete of Combinatorics and Computer Science.
Vol. 20,
Issue. ,
p.
287.
Gowers, W. T.
2010.
An Irregular Mind.
Vol. 21,
Issue. ,
p.
659.
Li, Jian Lin
2011.
Distance sets relating to orthogonal exponentials.
Acta Mathematica Sinica, English Series,
Vol. 27,
Issue. 12,
p.
2409.
Cooper, Joshua
Fenner, Stephen
and
Purewal, Semmy
2011.
Monochromatic Boxes in Colored Grids.
SIAM Journal on Discrete Mathematics,
Vol. 25,
Issue. 3,
p.
1054.
Elek, Gábor
and
Szegedy, Balázs
2012.
A measure-theoretic approach to the theory of dense hypergraphs.
Advances in Mathematics,
Vol. 231,
Issue. 3-4,
p.
1731.