Brendan Nagle

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Some Cubic Time Regularity Algorithms for Triple Systems.
SIAM J. Discret. Math., March, 2024

2021
On odd rainbow cycles in edge-colored graphs.
Eur. J. Comb., 2021

2020
Bipartite Hansel results for hypergraphs.
Eur. J. Comb., 2020

2018
An algorithmic hypergraph regularity lemma.
Random Struct. Algorithms, 2018

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

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

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

2013
Constructive Packings by Linear Hypergraphs.
Comb. Probab. Comput., 2013

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

2012
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012

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

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

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

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

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

2008
An Algorithmic Version of the Hypergraph Regularity Method.
SIAM J. Comput., 2008

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

Note on the 3-graph counting lemma.
Discret. Math., 2008

2006
The counting lemma for regular <i>k</i>-uniform hypergraphs.
Random Struct. Algorithms, 2006

2004
Strong edge colorings of uniform graphs.
Discret. Math., 2004

Bounding the strong chromatic index of dense random graphs.
Discret. Math., 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.
Comb. Probab. Comput., 2003

Matrix-Free Proof of a Regularity Characterization.
Electron. 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.
Discret. Math., 2001


  Loading...