The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Brendan Nagle: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Penny E. Haxell, Brendan Nagle, Vojtech Rödl
    An Algorithmic Version of the Hypergraph Regularity Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:439-448 [Conf]
  2. Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
    Efficient Testing of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:1017-1028 [Conf]
  3. Andrzej Czygrinow, Brendan Nagle
    Matrix-Free Proof of a Regularity Characterization. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  4. Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl
    Hereditary Properties Of Triple Systems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:2, pp:- [Journal]
  5. Andrzej Czygrinow, Brendan Nagle
    Bounding the strong chromatic index of dense random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:129-136 [Journal]
  6. Andrzej Czygrinow, Brendan Nagle
    Strong edge colorings of uniform graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:219-223 [Journal]
  7. Brendan Nagle, Vojtech Rödl
    The asymptotic number of triple systems not containing a fixed one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:271-290 [Journal]
  8. Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl
    On characterizing hypergraph regularity. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:293-335 [Journal]
  9. Penny E. Haxell, Brendan Nagle, Vojtech Rödl
    Integer and fractional packings in dense 3-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:3, pp:248-310 [Journal]
  10. Brendan Nagle, Vojtech Rödl
    Regularity properties for triple systems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:3, pp:264-332 [Journal]
  11. Brendan Nagle, Vojtech Rödl, Mathias Schacht
    The counting lemma for regular k-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:2, pp:113-179 [Journal]

  12. Hypergraph regularity and quasi-randomness. [Citation Graph (, )][DBLP]


  13. Note on the 3-graph counting lemma. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002