Brendan Nagle

According to our database, Brendan Nagle authored at least 28 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Some Cubic Time Regularity Algorithms for Triple Systems.

Brendan Nagle, John Theado

SIAM J. Discret. Math., March, 2024

2021

On odd rainbow cycles in edge-colored graphs.

Andrzej Czygrinow, Theodore Molla, Brendan Nagle, Roy Oursler

Eur. J. Comb., 2021

2020

Bipartite Hansel results for hypergraphs.

Gregory Churchill, Brendan Nagle

Eur. J. Comb., 2020

2018

An algorithmic hypergraph regularity lemma.

Brendan Nagle, Vojtech Rödl, Mathias Schacht

Random Struct. Algorithms, 2018

2017

Constructive Packings of Triple Systems.

Brendan Nagle

SIAM J. Discret. Math., 2017

2015

Asymptotics of the extremal excedance set statistic.

Rodrigo Ferraz de Andrade, Erik Lundberg, Brendan Nagle

Eur. J. Comb., 2015

2014

Tiling 3-Uniform Hypergraphs With K43-2e.

Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle

J. Graph Theory, 2014

2013

Constructive Packings by Linear Hypergraphs.

Jill Dizona, Brendan Nagle

Comb. Probab. Comput., 2013

Generalized Pattern Frequency in Large Permutations.

Joshua N. Cooper, Erik Lundberg, Brendan Nagle

Electron. J. Comb., 2013

2012

On Even-Degree Subgraphs of Linear Hypergraphs.

Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte

Comb. Probab. Comput., 2012

2011

On random sampling in uniform hypergraphs.

Andrzej Czygrinow, Brendan Nagle

Random Struct. Algorithms, 2011

2010

On Computing the Frequencies of Induced Subhypergraphs.

Brendan Nagle

SIAM J. Discret. Math., 2010

Weak hypergraph regularity and linear hypergraphs.

Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht

J. Comb. Theory, Ser. B, 2010

2009

Hereditary properties of hypergraphs.

Ryan Dotson, Brendan Nagle

J. Comb. Theory, Ser. B, 2009

Hypergraph regularity and quasi-randomness.

Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

An Algorithmic Version of the Hypergraph Regularity Method.

Penny E. Haxell, Brendan Nagle, Vojtech Rödl

SIAM J. Comput., 2008

On the Ramsey Number of Sparse 3-Graphs.

Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht

Graphs Comb., 2008

Note on the 3-graph counting lemma.

Brendan Nagle, Vojtech Rödl, Mathias Schacht

Discret. Math., 2008

2006

The counting lemma for regular <i>k</i>-uniform hypergraphs.

Brendan Nagle, Vojtech Rödl, Mathias Schacht

Random Struct. Algorithms, 2006

2004

Strong edge colorings of uniform graphs.

Andrzej Czygrinow, Brendan Nagle

Discret. Math., 2004

Bounding the strong chromatic index of dense random graphs.

Andrzej Czygrinow, Brendan Nagle

Discret. Math., 2004

2003

Regularity properties for triple systems.

Brendan Nagle, Vojtech Rödl

Random Struct. Algorithms, 2003

Integer and fractional packings in dense 3-uniform hypergraphs.

Penny E. Haxell, Brendan Nagle, Vojtech Rödl

Random Struct. Algorithms, 2003

Hereditary Properties Of Triple Systems.

Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl

Comb. Probab. Comput., 2003

Matrix-Free Proof of a Regularity Characterization.

Andrzej Czygrinow, Brendan Nagle

Electron. J. Comb., 2003

2002

On characterizing hypergraph regularity.

Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl

Random Struct. Algorithms, 2002

Efficient Testing of Hypergraphs.

Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

The asymptotic number of triple systems not containing a fixed one.

Brendan Nagle, Vojtech Rödl

Discret. Math., 2001