Brendan Nagle

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 6

Top Topics

Hypergraph Model

Top Venues

SIAM J. Discret. Math.

Random Struct. Algorithms

J. Graph Theory

Publications

Brendan Nagle, John Theado
Some Cubic Time Regularity Algorithms for Triple Systems. SIAM J. Discret. Math. 38 (1) (2024)
Andrzej Czygrinow, Theodore Molla, Brendan Nagle, Roy Oursler
On odd rainbow cycles in edge-colored graphs. Eur. J. Comb. 94 (2021)
Gregory Churchill, Brendan Nagle
Bipartite Hansel results for hypergraphs. Eur. J. Comb. 89 (2020)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52 (2) (2018)
Brendan Nagle
Constructive Packings of Triple Systems. SIAM J. Discret. Math. 31 (4) (2017)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
An Algorithmic Hypergraph Regularity Lemma. SODA (2016)
Rodrigo Ferraz de Andrade, Erik Lundberg, Brendan Nagle
Asymptotics of the extremal excedance set statistic. Eur. J. Comb. 46 (2015)
Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle
Tiling 3-Uniform Hypergraphs With K43-2e. J. Graph Theory 75 (2) (2014)
Joshua N. Cooper, Erik Lundberg, Brendan Nagle
Generalized Pattern Frequency in Large Permutations. Electron. J. Comb. 20 (1) (2013)
Jill Dizona, Brendan Nagle
Constructive Packings by Linear Hypergraphs. Comb. Probab. Comput. 22 (6) (2013)
Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21 (1-2) (2012)
Andrzej Czygrinow, Brendan Nagle
On random sampling in uniform hypergraphs. Random Struct. Algorithms 38 (4) (2011)
Brendan Nagle
On Computing the Frequencies of Induced Subhypergraphs. SIAM J. Discret. Math. 24 (1) (2010)
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory, Ser. B 100 (2) (2010)
Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht
Hypergraph regularity and quasi-randomness. SODA (2009)
Ryan Dotson, Brendan Nagle
Hereditary properties of hypergraphs. J. Comb. Theory, Ser. B 99 (2) (2009)
Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht
On the Ramsey Number of Sparse 3-Graphs. Graphs Comb. 24 (3) (2008)
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
An Algorithmic Version of the Hypergraph Regularity Method. SIAM J. Comput. 37 (6) (2008)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
Note on the 3-graph counting lemma. Discret. Math. 308 (19) (2008)
Brendan Nagle, Vojtech Rödl, Mathias Schacht
-uniform hypergraphs. Random Struct. Algorithms 28 (2) (2006)
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
An Algorithmic Version of the Hypergraph Regularity Method. FOCS (2005)
Andrzej Czygrinow, Brendan Nagle
Bounding the strong chromatic index of dense random graphs. Discret. Math. 281 (1-3) (2004)
Andrzej Czygrinow, Brendan Nagle
Strong edge colorings of uniform graphs. Discret. Math. 286 (3) (2004)
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
Hereditary Properties Of Triple Systems. Comb. Probab. Comput. 12 (2) (2003)
Brendan Nagle, Vojtech Rödl
Regularity properties for triple systems. Random Struct. Algorithms 23 (3) (2003)
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
Integer and fractional packings in dense 3-uniform hypergraphs. Random Struct. Algorithms 22 (3) (2003)
Andrzej Czygrinow, Brendan Nagle
Matrix-Free Proof of a Regularity Characterization. Electron. J. Comb. 10 (2003)
Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl
On characterizing hypergraph regularity. Random Struct. Algorithms 21 (3-4) (2002)
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
Efficient Testing of Hypergraphs. ICALP (2002)
Brendan Nagle, Vojtech Rödl
The asymptotic number of triple systems not containing a fixed one. Discret. Math. 235 (1-3) (2001)