Brendan T. Nagle

Professor

CONTACT

Office: CMC 360
Phone: (813) 974-9724
Email

EDUCATION

Ph.D., Mathematics, Emory University, 1999
M.S., Mathematics, Emory University, 1999
B.S. (High Honors), Mathematics/Philosophy, Emory University, 1994

RESEARCH

Extremal combinatorics, hypergraph regularity methods.

Publications

submitted
(w/ A. Czygrinow, T. Molla, and R. Oursler)

submitted
(w/ A. Czygrinow, T. Molla, and R. Oursler)


European Journal of Combinatorics, to appear
(w/ G. Churchill)


Random Structures and Algorithms, 52 (2018), no. 2, 301--353.
(w/ V. Rodl and M. Schacht)


SIAM J. Discrete Math., 31 (2017), no. 4, 2479--2516.


Congr. Numer. 227 (2016), 269--275
(w/ G. Churchill)


Theory and Applications of Graphs 3 (2016), no. 1, 6pp.
(w/ J. Goldwasser and A. Saez)


Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (2016), 1765--1773 (ACM Press)
(w/ V. Rodl and M. Schacht)


European J. Combinatorics 46 (2015), 75-88
(w/ R. Ferraz de Andrade and E. Lundberg)


Journal of Graph Theory 75 (2014) no.4, 124-136
(w/ A. Czygrinow and L. DeBiasio)


Combin. Probab. Comput., 22 (2013) no. 6, 829-858
(w/ J. Dizona)


Electron. J. Combin. 20(1) (2013), #P28
(w/ J. Cooper and E. Lundberg)


Journal of Combinatorics 3 (2012) no. 1, 49-62
(w/ Dellamonica, Haxell, Luczak, Mubayi, Person, Rodl, Schacht)


Combin. Probab. Comput. 21 (2012), 113-127
(w/ Dellamonica, Haxell, Luczak, Mubayi, Person, Rodl, Schacht, Verstraete)

A hypergraph regularity method for linear hypergraphs
Lambert Academic Publishing (2011), 1-56 (w/ S. Khan)


Random Structures Algorithms 38 (2011), 422-440.
(w/ A. Czygrinow)


SIAM J. Discrete Math. 24 no.1, 322-329 (2010)


J. Combin. Theory Ser. B 100 (2010) no.2, 1510-160
(w/ Y. Kohayakawa, V. Rodl and M. Schacht)


20th Annual ACM-SIAM Symposium on Discrete Algorithms (2009), 227-235.
(ACM Press) (w/ A. Poerschke, V. Rodl and M. Schacht)


J. Combin. Theory Ser. B 99 (2009), 460-473 (w/ R. Dotson)


Graphs Combin. 24 (2008) no.3, 205-228.
(w/ S. Olsen, V. Rodl and M. Schacht)


SIAM J. Comput. 37 (2008), no.6, 1728-1776
(w/ P. Haxell and V. Rodl)


Discrete Math. 308 (2008), 4501-4517 (w/ V. Rodl and M. Schacht)


Topics in Discrete Mathematics 26, Algorithms Combin., 247-278, Springer, Berlin (w/ V. Rodl and M. Schacht)


Random Structures Algorithms 28 (2006), no. 2, 113-179
(w/ V. Rodl and M. Schacht)


Proceedings of the National Academy of Science 102 (2005)
no. 23, 8109-8113 (w/ Rodl, Skokan, Schacht and Kohayakawa)


46th Annual IEEE Symposium on Foundations of Computer Science, 2005, 439-448 (w/ P. Haxell and V. Rodl)


Discrete Math. 281 (2004), no. 1-3, 129-136 (w/ A. Czygrinow)


Discrete Math. 286 (2004), no. 3, 219-223 (w/ A. Czygrinow)


Electron. J. Combin. 10 (2003), Research Paper 39, 11 pp
(w/ A. Czygrinow)


Combin. Probab. Comput. 12 (2003), 248-310
(w/ Y. Kohayakawa and V. Rodl)


Random Structures Algorithms 23 (2003), no. 3, 264-332
(w/ V. Rodl)


Random Structures Algorithms 21 (2002), no. 3-4, 293-335
(w/ Y. Dementieva, P. Haxell and V. Rodl)


Random Structures Algorithms 22 (2002), no. 3, 293-335
(w/ P. Haxell and V. Rodl)


29th International Coll. Automata, Languages and Programming
Lecture Notes in Computer Science 2286, Springer, Berlin (2002), 278-293 (w/ Y. Kohayakawa and V. Rodl)


Bull. Inst. Combin. Appl. 32 (2001), 63-69 (w/ A. Czygrinow)


Discrete Math. 235 (2001), 271-290 (w/ V. Rodl)


Congr. Numer. 136 (1999), 119-127.