default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrendan Nagle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Brendan Nagle, John Theado:
Some Cubic Time Regularity Algorithms for Triple Systems. SIAM J. Discret. Math. 38(1): 668-701 (2024)- 2021
- [j25]Andrzej Czygrinow, Theodore Molla, Brendan Nagle, Roy Oursler:
On odd rainbow cycles in edge-colored graphs. Eur. J. Comb. 94: 103316 (2021) - 2020
- [j24]Gregory Churchill, Brendan Nagle:
Bipartite Hansel results for hypergraphs. Eur. J. Comb. 89: 103136 (2020)
2010 – 2019
- 2018
- [j23]Brendan Nagle, Vojtech Rödl, Mathias Schacht
:
An algorithmic hypergraph regularity lemma. Random Struct. Algorithms 52(2): 301-353 (2018) - 2017
- [j22]Brendan Nagle:
Constructive Packings of Triple Systems. SIAM J. Discret. Math. 31(4): 2479-2516 (2017) - 2016
- [c4]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
An Algorithmic Hypergraph Regularity Lemma. SODA 2016: 1765-1773 - 2015
- [j21]Rodrigo Ferraz de Andrade, Erik Lundberg, Brendan Nagle:
Asymptotics of the extremal excedance set statistic. Eur. J. Comb. 46: 75-88 (2015) - 2014
- [j20]Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle:
Tiling 3-Uniform Hypergraphs With K43-2e. J. Graph Theory 75(2): 124-136 (2014) - 2013
- [j19]Joshua N. Cooper, Erik Lundberg, Brendan Nagle:
Generalized Pattern Frequency in Large Permutations. Electron. J. Comb. 20(1): 28 (2013) - [j18]Jill Dizona, Brendan Nagle:
Constructive Packings by Linear Hypergraphs. Comb. Probab. Comput. 22(6): 829-858 (2013) - 2012
- [j17]Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte:
On Even-Degree Subgraphs of Linear Hypergraphs. Comb. Probab. Comput. 21(1-2): 113-127 (2012) - 2011
- [j16]Andrzej Czygrinow, Brendan Nagle:
On random sampling in uniform hypergraphs. Random Struct. Algorithms 38(4): 422-440 (2011) - 2010
- [j15]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Weak hypergraph regularity and linear hypergraphs. J. Comb. Theory B 100(2): 151-160 (2010) - [j14]Brendan Nagle:
On Computing the Frequencies of Induced Subhypergraphs. SIAM J. Discret. Math. 24(1): 322-329 (2010)
2000 – 2009
- 2009
- [j13]Ryan Dotson, Brendan Nagle:
Hereditary properties of hypergraphs. J. Comb. Theory B 99(2): 460-473 (2009) - [c3]Brendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht:
Hypergraph regularity and quasi-randomness. SODA 2009: 227-235 - 2008
- [j12]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Note on the 3-graph counting lemma. Discret. Math. 308(19): 4501-4517 (2008) - [j11]Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Mathias Schacht:
On the Ramsey Number of Sparse 3-Graphs. Graphs Comb. 24(3): 205-228 (2008) - [j10]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
- [j9]Brendan Nagle, Vojtech Rödl, Mathias Schacht:
The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2): 113-179 (2006) - 2005
- [c2]Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method. FOCS 2005: 439-448 - 2004
- [j8]Andrzej Czygrinow, Brendan Nagle:
Bounding the strong chromatic index of dense random graphs. Discret. Math. 281(1-3): 129-136 (2004) - [j7]Andrzej Czygrinow, Brendan Nagle:
Strong edge colorings of uniform graphs. Discret. Math. 286(3): 219-223 (2004) - 2003
- [j6]Andrzej Czygrinow, Brendan Nagle:
Matrix-Free Proof of a Regularity Characterization. Electron. J. Comb. 10 (2003) - [j5]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl:
Hereditary Properties Of Triple Systems. Comb. Probab. Comput. 12(2): 155-189 (2003) - [j4]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) - [j3]Brendan Nagle, Vojtech Rödl:
Regularity properties for triple systems. Random Struct. Algorithms 23(3): 264-332 (2003) - 2002
- [j2]Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
On characterizing hypergraph regularity. Random Struct. Algorithms 21(3-4): 293-335 (2002) - [c1]Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl:
Efficient Testing of Hypergraphs. ICALP 2002: 1017-1028 - 2001
- [j1]Brendan Nagle, Vojtech Rödl:
The asymptotic number of triple systems not containing a fixed one. Discret. Math. 235(1-3): 271-290 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
