 | 2012 |
|---|
| 38 |       | Penny E. Haxell,
Alexandr V. Kostochka,
Stéphan Thomassé:
A stability theorem on fractional covering of triangles by edges.
Eur. J. Comb. 33(5): 799-806 (2012) |
| 2010 |
|---|
| 37 | | Penny E. Haxell,
Jacques Verstraëte:
List Coloring Hypergraphs.
Electr. J. Comb. 17(1): (2010) |
| 36 | | Penny E. Haxell,
Gordon T. Wilfong:
On the Stable Paths Problem.
SIAM J. Discrete Math. 24(3): 1137-1152 (2010) |
| 2009 |
|---|
| 35 | | Penny E. Haxell,
Tomasz Luczak,
Yuejian Peng,
Vojtech Rödl,
Andrzej Rucinski,
Jozef Skokan:
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability & Computing 18(1-2): 165-203 (2009) |
| 34 | | András Gyárfás,
Penny E. Haxell:
Large monochromatic components in colorings of complete 3-uniform hypergraphs.
Discrete Mathematics 309(10): 3156-3160 (2009) |
| 2008 |
|---|
| 33 | | Penny E. Haxell,
Gordon T. Wilfong:
A fractional model of the border gateway protocol (BGP).
SODA 2008: 193-199 |
| 32 | | Penny E. Haxell,
Oleg Pikhurko,
Andrew Thomason:
Maximum acyclic and fragmented sets in regular graphs.
Journal of Graph Theory 57(2): 149-156 (2008) |
| 31 | | Penny E. Haxell:
An improved bound for the strong chromatic number.
Journal of Graph Theory 58(2): 148-158 (2008) |
| 30 | | Penny E. Haxell,
Brendan Nagle,
Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method.
SIAM J. Comput. 37(6): 1728-1776 (2008) |
| 2007 |
|---|
| 29 | | Peter Hamburger,
Penny E. Haxell,
Alexandr V. Kostochka:
On Directed Triangles in Digraphs.
Electr. J. Comb. 14(1): (2007) |
| 28 | | Penny E. Haxell,
Ben Seamone,
Jacques Verstraëte:
Independent dominating sets and hamiltonian cycles.
Journal of Graph Theory 54(3): 233-244 (2007) |
| 2006 |
|---|
| 27 | | Penny E. Haxell,
Tibor Szabó:
Odd Independent Transversals are Odd.
Combinatorics, Probability & Computing 15(1-2): 193-211 (2006) |
| 26 | | Penny E. Haxell,
Tomasz Luczak,
Yuejian Peng,
Vojtech Rödl,
Andrzej Rucinski,
Miklós Simonovits,
Jozef Skokan:
The Ramsey number for hypergraph cycles I.
J. Comb. Theory, Ser. A 113(1): 67-83 (2006) |
| 2005 |
|---|
| 25 | | Penny E. Haxell,
Brendan Nagle,
Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method.
FOCS 2005: 439-448 |
| 24 | | Jair Donadelli,
Penny E. Haxell,
Yoshiharu Kohayakawa:
A note on the Size-Ramsey number of long subdivisions of graphs.
ITA 39(1): 191-206 (2005) |
| 2004 |
|---|
| 23 | | Penny E. Haxell:
On the Strong Chromatic Number.
Combinatorics, Probability & Computing 13(6): 857-865 (2004) |
| 22 | | William H. Cunningham,
Penny E. Haxell,
R. Bruce Richter,
Nicholas C. Wormald,
Andrew Thomason:
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory, Ser. B 90(1): 1 (2004) |
| 2003 |
|---|
| 21 | | Penny E. Haxell,
Tibor Szabó,
Gábor Tardos:
Bounded size components--partitions and transversals.
J. Comb. Theory, Ser. B 88(2): 281-297 (2003) |
| 20 | | 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) |
| 2002 |
|---|
| 19 | | Penny E. Haxell,
April Rasala,
Gordon T. Wilfong,
Peter Winkler:
Wide-Sense Nonblocking WDM Cross-Connects.
ESA 2002: 538-549 |
| 18 | | Penny E. Haxell,
Tomasz Luczak,
P. W. Tingley:
Ramsey Numbers for Trees of Small Maximum Degree.
Combinatorica 22(2): 287-320 (2002) |
| 17 | | Ronald J. Gould,
Penny E. Haxell,
A. D. Scott:
A Note on Cycle Lengths in Graphs.
Graphs and Combinatorics 18(3): 491-498 (2002) |
| 16 | | Y. Dementieva,
Penny E. Haxell,
Brendan Nagle,
Vojtech Rödl:
On characterizing hypergraph regularity.
Random Struct. Algorithms 21(3-4): 293-335 (2002) |
| 2001 |
|---|
| 15 | | Penny E. Haxell,
Vojtech Rödl:
Integer and Fractional Packings in Dense Graphs.
Combinatorica 21(1): 13-38 (2001) |
| 2000 |
|---|
| 14 | | Penny E. Haxell,
Tomasz Luczak:
Embedding trees into graphs of large girth.
Discrete Mathematics 216(1-3): 273-278 (2000) |
| 1999 |
|---|
| 13 | | Penny E. Haxell:
Packing and covering triangles in graphs.
Discrete Mathematics 195(1-3): 251-254 (1999) |
| 1998 |
|---|
| 12 | | Penny E. Haxell,
Yoshiharu Kohayakawa:
Packing and Covering Triangles in Tripartite Graphs.
Graphs and Combinatorics 14(1): 1-10 (1998) |
| 1997 |
|---|
| 11 | | Penny E. Haxell,
Martin Loebl:
On Defect Sets in Bipartite Graphs (Extended Abstract).
ISAAC 1997: 334-343 |
| 10 | | Penny E. Haxell:
Partitioning Complete Bipartite Graphs by Monochromatic Cycles, .
J. Comb. Theory, Ser. B 69(2): 210-218 (1997) |
| 9 | | Bo Yu,
Joseph Cheriyan,
Penny E. Haxell:
Hypercubes and Multicommodity Flows.
SIAM J. Discrete Math. 10(2): 190-200 (1997) |
| 1996 |
|---|
| 8 | | Penny E. Haxell,
Yoshiharu Kohayakawa,
Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Combinatorica 16(1): 107-122 (1996) |
| 7 | | Penny E. Haxell:
Atoms of set systems with a fixed number of pairwise unions.
Discrete Mathematics 150(1-3): 155-166 (1996) |
| 6 | | Penny E. Haxell,
Yoshiharu Kohayakawa:
Partitioning by Monochromatic Trees.
J. Comb. Theory, Ser. B 68(2): 218-222 (1996) |
| 1995 |
|---|
| 5 | | Penny E. Haxell,
Yoshiharu Kohayakawa,
Tomasz Luczak:
The Induced Size-Ramsey Number of Cycles.
Combinatorics, Probability & Computing 4: 217-239 (1995) |
| 4 | | Penny E. Haxell:
A note on a conjecture of Gallai.
Graphs and Combinatorics 11(1): 53-57 (1995) |
| 3 | | Penny E. Haxell:
A condition for matchability in hypergraphs.
Graphs and Combinatorics 11(3): 245-248 (1995) |
| 2 | | Penny E. Haxell,
Yoshiharu Kohayakawa,
Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory, Ser. B 64(2): 273-287 (1995) |
| 1 | | Penny E. Haxell,
Yoshiharu Kohayakawa:
On the Anti-Ramsey Property of Ramanujan Graphs.
Random Struct. Algorithms 6(4): 417-432 (1995) |
Data released under the ODC-BY 1.0 license — See also our legal information page