Brendan Nagle

	2011
19		Andrzej Czygrinow, Brendan Nagle: On random sampling in uniform hypergraphs. Random Struct. Algorithms 38(4): 422-440 (2011)
	2010
18		Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht: Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory, Ser. B 100(2): 151-160 (2010)
17		Brendan Nagle: On Computing the Frequencies of Induced Subhypergraphs. SIAM J. Discrete Math. 24(1): 322-329 (2010)
	2009
16		Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht: Hypergraph regularity and quasi-randomness. SODA 2009: 227-235
15		Ryan Dotson, Brendan Nagle: Hereditary properties of hypergraphs. J. Comb. Theory, Ser. B 99(2): 460-473 (2009)
	2008
14		Brendan Nagle, Vojtech Rödl, Mathias Schacht: Note on the 3-graph counting lemma. Discrete Mathematics 308(19): 4501-4517 (2008)
13		Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht: On the Ramsey Number of Sparse 3-Graphs. Graphs and Combinatorics 24(3): 205-228 (2008)
12		Penny E. Haxell, Brendan Nagle, Vojtech Rödl: An Algorithmic Version of the Hypergraph Regularity Method. SIAM J. Comput. 37(6): 1728-1776 (2008)
	2006
11		Brendan Nagle, Vojtech Rödl, Mathias Schacht: The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2): 113-179 (2006)
	2005
10		Penny E. Haxell, Brendan Nagle, Vojtech Rödl: An Algorithmic Version of the Hypergraph Regularity Method. FOCS 2005: 439-448
	2004
9		Andrzej Czygrinow, Brendan Nagle: Bounding the strong chromatic index of dense random graphs. Discrete Mathematics 281(1-3): 129-136 (2004)
8		Andrzej Czygrinow, Brendan Nagle: Strong edge colorings of uniform graphs. Discrete Mathematics 286(3): 219-223 (2004)
	2003
7		Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl: Hereditary Properties Of Triple Systems. Combinatorics, Probability & Computing 12(2): 155-189 (2003)
6		Andrzej Czygrinow, Brendan Nagle: Matrix-Free Proof of a Regularity Characterization. Electr. J. Comb. 10: (2003)
5		Penny E. Haxell, Brendan Nagle, Vojtech Rödl: Integer and fractional packings in dense 3-uniform hypergraphs. Random Struct. Algorithms 22(3): 248-310 (2003)
4		Brendan Nagle, Vojtech Rödl: Regularity properties for triple systems. Random Struct. Algorithms 23(3): 264-332 (2003)
	2002
3		Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl: Efficient Testing of Hypergraphs. ICALP 2002: 1017-1028
2		Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl: On characterizing hypergraph regularity. Random Struct. Algorithms 21(3-4): 293-335 (2002)
	2001
1		Brendan Nagle, Vojtech Rödl: The asymptotic number of triple systems not containing a fixed one. Discrete Mathematics 235(1-3): 271-290 (2001)

Coauthor Index

1	Andrzej Czygrinow	[6] [8] [9] [19]
2	Y. Dementieva	[2]
3	Ryan Dotson	[15]
4	Penny E. Haxell	[2] [5] [10] [12]
5	Yoshiharu Kohayakawa	[3] [7] [18]
6	Sayaka Olsen	[13]
7	Annika Poerschke	[16]
8	Vojtech Rödl	[1] [2] [3] [4] [5] [7] [10] [11] [12] [13] [14] [16] [18]
9	Mathias Schacht	[11] [13] [14] [16] [18]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page