Brendan Nagle

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