Penny E. Haxell

Publication Activity (10 Years)

Years Active: 1995-2017
Publications (10 Years): 3

Top Topics

Volumetric Data

Top Venues

Electron. J. Comb.

J. Graph Theory

Comb. Probab. Comput.

Publications

Penny E. Haxell, Alex D. Scott
A Note on Intersecting Hypergraphs with Large Cover Number. Electron. J. Comb. 24 (3) (2017)
Penny E. Haxell, Alexander D. Scott
On Lower Bounds for the Matching Number of Subcubic Graphs. J. Graph Theory 85 (2) (2017)
Penny E. Haxell, Hal A. Kierstead
Edge coloring multigraphs without small dense subsets. Discret. Math. 338 (12) (2015)
Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw
Morphing Planar Graph Drawings with Unidirectional Moves. CoRR (2014)
Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw
Morphing Schnyder Drawings of Planar Triangulations. Graph Drawing (2014)
Subir Kumar Ghosh, Penny E. Haxell
Packing and covering tetrahedra. Discret. Appl. Math. 161 (9) (2013)
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
A stability theorem on fractional covering of triangles by edges. Eur. J. Comb. 33 (5) (2012)
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
Packing and Covering Triangles in K 4-free Planar Graphs. Graphs Comb. 28 (5) (2012)
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) (2012)
Penny E. Haxell, Alex D. Scott
On Ryser's conjecture. Electron. J. Comb. 19 (1) (2012)
Robert Berke, Penny E. Haxell, Tibor Szabó
Bounded transversals in multipartite graphs. J. Graph Theory 70 (3) (2012)
Penny E. Haxell, Gordon T. Wilfong
On the Stable Paths Problem. SIAM J. Discret. Math. 24 (3) (2010)
Penny E. Haxell, Jacques Verstraëte
List Coloring Hypergraphs. Electron. J. Comb. 17 (1) (2010)
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Comb. Probab. Comput. 18 (1-2) (2009)
András Gyárfás, Penny E. Haxell
Large monochromatic components in colorings of complete 3-uniform hypergraphs. Discret. Math. 309 (10) (2009)
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
An Algorithmic Version of the Hypergraph Regularity Method. SIAM J. Comput. 37 (6) (2008)
Penny E. Haxell, Gordon T. Wilfong
A fractional model of the border gateway protocol (BGP). SODA (2008)
Penny E. Haxell
An improved bound for the strong chromatic number. J. Graph Theory 58 (2) (2008)
Penny E. Haxell, Oleg Pikhurko, Andrew Thomason
Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory 57 (2) (2008)
Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka
On Directed Triangles in Digraphs. Electron. J. Comb. 14 (1) (2007)
Penny E. Haxell, Ben Seamone, Jacques Verstraëte
Independent dominating sets and hamiltonian cycles. J. Graph Theory 54 (3) (2007)
Penny E. Haxell, Tibor Szabó
Odd Independent Transversals are Odd. Comb. Probab. Comput. 15 (1-2) (2006)
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) (2006)
Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa
A note on the Size-Ramsey number of long subdivisions of graphs. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
An Algorithmic Version of the Hypergraph Regularity Method. FOCS (2005)
Penny E. Haxell
On the Strong Chromatic Number. Comb. Probab. Comput. 13 (6) (2004)
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) (2004)
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
Integer and fractional packings in dense 3-uniform hypergraphs. Random Struct. Algorithms 22 (3) (2003)
Penny E. Haxell, Tibor Szabó, Gábor Tardos
Bounded size components--partitions and transversals. J. Comb. Theory, Ser. B 88 (2) (2003)
Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler
Wide-Sense Nonblocking WDM Cross-Connects. ESA (2002)
Ronald J. Gould, Penny E. Haxell, Alex D. Scott
A Note on Cycle Lengths in Graphs. Graphs Comb. 18 (3) (2002)
Penny E. Haxell, Tomasz Luczak, P. W. Tingley
Ramsey Numbers for Trees of Small Maximum Degree. Comb. 22 (2) (2002)
Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl
On characterizing hypergraph regularity. Random Struct. Algorithms 21 (3-4) (2002)
Penny E. Haxell
A Note on Vertex List Colouring. Comb. Probab. Comput. 10 (4) (2001)
Penny E. Haxell, Vojtech Rödl
Integer and Fractional Packings in Dense Graphs. Comb. 21 (1) (2001)
Penny E. Haxell
Tree embeddings. J. Graph Theory 36 (3) (2001)
Penny E. Haxell, Tomasz Luczak
Embedding trees into graphs of large girth. Discret. Math. 216 (1-3) (2000)
Penny E. Haxell
Packing and covering triangles in graphs. Discret. Math. 195 (1-3) (1999)
Penny E. Haxell, Yoshiharu Kohayakawa
Packing and Covering Triangles in Tripartite Graphs. Graphs Comb. 14 (1) (1998)
Penny E. Haxell
. J. Comb. Theory, Ser. B 69 (2) (1997)
Penny E. Haxell, Martin Loebl
On Defect Sets in Bipartite Graphs (Extended Abstract). ISAAC (1997)
Bo Yu, Joseph Cheriyan, Penny E. Haxell
Hypercubes and Multicommodity Flows. SIAM J. Discret. Math. 10 (2) (1997)
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. Comb. 16 (1) (1996)
Penny E. Haxell, Yoshiharu Kohayakawa
Partitioning by Monochromatic Trees. J. Comb. Theory, Ser. B 68 (2) (1996)
Penny E. Haxell
Atoms of set systems with a fixed number of pairwise unions. Discret. Math. 150 (1-3) (1996)
Penny E. Haxell, Yoshiharu Kohayakawa
On the Anti-Ramsey Property of Ramanujan Graphs. Random Struct. Algorithms 6 (4) (1995)
Penny E. Haxell
A note on a conjecture of Gallai. Graphs Comb. 11 (1) (1995)
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) (1995)
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
The Induced Size-Ramsey Number of Cycles. Comb. Probab. Comput. 4 (1995)
Penny E. Haxell
A condition for matchability in hypergraphs. Graphs Comb. 11 (3) (1995)