The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Penny E. Haxell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler
    Wide-Sense Nonblocking WDM Cross-Connects. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:538-549 [Conf]
  2. 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]
  3. Penny E. Haxell, Martin Loebl
    On Defect Sets in Bipartite Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:334-343 [Conf]
  4. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:107-122 [Journal]
  5. Penny E. Haxell, Tomasz Luczak, P. W. Tingley
    Ramsey Numbers for Trees of Small Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:2, pp:287-320 [Journal]
  6. Penny E. Haxell, Vojtech Rödl
    Integer and Fractional Packings in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:1, pp:13-38 [Journal]
  7. Penny E. Haxell
    On the Strong Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:857-865 [Journal]
  8. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    The Induced Size-Ramsey Number of Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:217-239 [Journal]
  9. Penny E. Haxell, Tomasz Luczak
    Embedding trees into graphs of large girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:273-278 [Journal]
  10. Ronald J. Gould, Penny E. Haxell, A. D. Scott
    A Note on Cycle Lengths in Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:3, pp:491-498 [Journal]
  11. William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
    To Adrian Bondy and U. S. R. Murty. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:1- [Journal]
  12. Penny E. Haxell
    Partitioning Complete Bipartite Graphs by Monochromatic Cycles, . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:210-218 [Journal]
  13. Penny E. Haxell, Yoshiharu Kohayakawa
    Partitioning by Monochromatic Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:218-222 [Journal]
  14. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:273-287 [Journal]
  15. Penny E. Haxell, Tibor Szabó, Gábor Tardos
    Bounded size components--partitions and transversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:281-297 [Journal]
  16. Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
    The Ramsey number for hypergraph cycles I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:67-83 [Journal]
  17. 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]
  18. Penny E. Haxell, Yoshiharu Kohayakawa
    On the Anti-Ramsey Property of Ramanujan Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:417-432 [Journal]
  19. 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]
  20. Bo Yu, Joseph Cheriyan, Penny E. Haxell
    Hypercubes and Multicommodity Flows. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:190-200 [Journal]
  21. Penny E. Haxell, Ben Seamone, Jacques Verstraëte
    Independent dominating sets and hamiltonian cycles. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:3, pp:233-244 [Journal]
  22. Penny E. Haxell
    Packing and covering triangles in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:251-254 [Journal]
  23. Penny E. Haxell
    Atoms of set systems with a fixed number of pairwise unions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:155-166 [Journal]

  24. A fractional model of the border gateway protocol (BGP). [Citation Graph (, )][DBLP]


  25. On Directed Triangles in Digraphs. [Citation Graph (, )][DBLP]


  26. Odd Independent Transversals are Odd. [Citation Graph (, )][DBLP]


  27. The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. [Citation Graph (, )][DBLP]


  28. Large monochromatic components in colorings of complete 3-uniform hypergraphs. [Citation Graph (, )][DBLP]


Search in 0.064secs, Finished in 0.065secs
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