Brendan Nagle

According to our database1, Brendan Nagle authored at least 25 papers between 2001 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Constructive Packings of Triple Systems.
SIAM J. Discrete Math., 2017

2016
An Algorithmic Hypergraph Regularity Lemma.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Asymptotics of the extremal excedance set statistic.
Eur. J. Comb., 2015

2014
Tiling 3-Uniform Hypergraphs With K43-2e.
Journal of Graph Theory, 2014

2013
Constructive Packings by Linear Hypergraphs.
Combinatorics, Probability & Computing, 2013

Generalized Pattern Frequency in Large Permutations.
Electr. J. Comb., 2013

2012
On Even-Degree Subgraphs of Linear Hypergraphs.
Combinatorics, Probability & Computing, 2012

2011
On random sampling in uniform hypergraphs.
Random Struct. Algorithms, 2011

2010
On Computing the Frequencies of Induced Subhypergraphs.
SIAM J. Discrete Math., 2010

Weak hypergraph regularity and linear hypergraphs.
J. Comb. Theory, Ser. B, 2010

2009
Hereditary properties of hypergraphs.
J. Comb. Theory, Ser. B, 2009

Hypergraph regularity and quasi-randomness.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
On the Ramsey Number of Sparse 3-Graphs.
Graphs and Combinatorics, 2008

Note on the 3-graph counting lemma.
Discrete Mathematics, 2008

2006
The counting lemma for regular k-uniform hypergraphs.
Random Struct. Algorithms, 2006

2005
An Algorithmic Version of the Hypergraph Regularity Method.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Strong edge colorings of uniform graphs.
Discrete Mathematics, 2004

Bounding the strong chromatic index of dense random graphs.
Discrete Mathematics, 2004

2003
Regularity properties for triple systems.
Random Struct. Algorithms, 2003

Integer and fractional packings in dense 3-uniform hypergraphs.
Random Struct. Algorithms, 2003

Hereditary Properties Of Triple Systems.
Combinatorics, Probability & Computing, 2003

Matrix-Free Proof of a Regularity Characterization.
Electr. J. Comb., 2003

2002
On characterizing hypergraph regularity.
Random Struct. Algorithms, 2002

Efficient Testing of Hypergraphs.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
The asymptotic number of triple systems not containing a fixed one.
Discrete Mathematics, 2001


  Loading...