Penny E. Haxell

50 papers A* 2A 2B 1Journal 45
YearRankTypeTitle / Venue / Authors
2017 J jnl
A Note on Intersecting Hypergraphs with Large Cover Number.
Electron. J. Comb.
Penny E. Haxell, Alex D. Scott
2017 J jnl
On Lower Bounds for the Matching Number of Subcubic Graphs.
J. Graph Theory
Penny E. Haxell, Alexander D. Scott
2015 J jnl
Edge coloring multigraphs without small dense subsets.
Discret. Math.
Penny E. Haxell, Hal A. Kierstead
2014 J jnl
Morphing Planar Graph Drawings with Unidirectional Moves.
CoRR
Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw
2014 A conf
Morphing Schnyder Drawings of Planar Triangulations.
GD
Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw
2013 J jnl
Packing and covering tetrahedra.
Discret. Appl. Math.
Subir Kumar Ghosh, Penny E. Haxell
2012 J jnl
A stability theorem on fractional covering of triangles by edges.
Eur. J. Comb.
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
2012 J jnl
Bounded transversals in multipartite graphs.
J. Graph Theory
Robert Berke, Penny E. Haxell, Tibor Szabó
2012 J jnl
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput.
Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte
2012 J jnl
On Ryser's conjecture.
Electron. J. Comb.
Penny E. Haxell, Alex D. Scott
2012 J jnl
Packing and Covering Triangles in K 4-free Planar Graphs.
Graphs Comb.
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
2010 J jnl
List Coloring Hypergraphs.
Electron. J. Comb.
Penny E. Haxell, Jacques Verstraëte
2010 J jnl
On the Stable Paths Problem.
SIAM J. Discret. Math.
Penny E. Haxell, Gordon T. Wilfong
2009 J jnl
Large monochromatic components in colorings of complete 3-uniform hypergraphs.
Discret. Math.
András Gyárfás, Penny E. Haxell
2009 J jnl
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput.
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan
2008 A* conf
A fractional model of the border gateway protocol (BGP).
SODA
Penny E. Haxell, Gordon T. Wilfong
2008 J jnl
An Algorithmic Version of the Hypergraph Regularity Method.
SIAM J. Comput.
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2008 J jnl
An improved bound for the strong chromatic number.
J. Graph Theory
Penny E. Haxell
2008 J jnl
Maximum acyclic and fragmented sets in regular graphs.
J. Graph Theory
Penny E. Haxell, Oleg Pikhurko, Andrew Thomason
2007 J jnl
Independent dominating sets and hamiltonian cycles.
J. Graph Theory
Penny E. Haxell, Ben Seamone, Jacques Verstraëte
2007 J jnl
On Directed Triangles in Digraphs.
Electron. J. Comb.
Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka
2006 J jnl
Odd Independent Transversals are Odd.
Comb. Probab. Comput.
Penny E. Haxell, Tibor Szabó
2006 J jnl
The Ramsey number for hypergraph cycles I.
J. Comb. Theory A
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
2005 J jnl
A note on the Size-Ramsey number of long subdivisions of graphs.
RAIRO Theor. Informatics Appl.
Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa
2005 A* conf
An Algorithmic Version of the Hypergraph Regularity Method.
FOCS
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2004 J jnl
On the Strong Chromatic Number.
Comb. Probab. Comput.
Penny E. Haxell
2004 J jnl
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory B
William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
2003 J jnl
Bounded size components--partitions and transversals.
J. Comb. Theory B
Penny E. Haxell, Tibor Szabó, Gábor Tardos
2003 J jnl
Integer and fractional packings in dense 3-uniform hypergraphs.
Random Struct. Algorithms
Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2002 J jnl
A Note on Cycle Lengths in Graphs.
Graphs Comb.
Ronald J. Gould, Penny E. Haxell, Alex D. Scott
2002 J jnl
On characterizing hypergraph regularity.
Random Struct. Algorithms
Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl
2002 J jnl
Ramsey Numbers for Trees of Small Maximum Degree.
Comb.
Penny E. Haxell, Tomasz Luczak, P. W. Tingley
2002 A conf
Wide-Sense Nonblocking WDM Cross-Connects.
ESA
Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler
2001 J jnl
A Note on Vertex List Colouring.
Comb. Probab. Comput.
Penny E. Haxell
2001 J jnl
Integer and Fractional Packings in Dense Graphs.
Comb.
Penny E. Haxell, Vojtech Rödl
2001 J jnl
Tree embeddings.
J. Graph Theory
Penny E. Haxell
2000 J jnl
Embedding trees into graphs of large girth.
Discret. Math.
Penny E. Haxell, Tomasz Luczak
1999 J jnl
Packing and covering triangles in graphs.
Discret. Math.
Penny E. Haxell
1998 J jnl
Packing and Covering Triangles in Tripartite Graphs.
Graphs Comb.
Penny E. Haxell, Yoshiharu Kohayakawa
1997 J jnl
Hypercubes and Multicommodity Flows.
SIAM J. Discret. Math.
Bo Yu, Joseph Cheriyan, Penny E. Haxell
1997 B conf
On Defect Sets in Bipartite Graphs (Extended Abstract).
ISAAC
Penny E. Haxell, Martin Loebl
1997 J jnl
Partitioning Complete Bipartite Graphs by Monochromatic Cycles
J. Comb. Theory B
Penny E. Haxell
1996 J jnl
Atoms of set systems with a fixed number of pairwise unions.
Discret. Math.
Penny E. Haxell
1996 J jnl
Partitioning by Monochromatic Trees.
J. Comb. Theory, Ser. B
Penny E. Haxell, Yoshiharu Kohayakawa
1996 J jnl
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Comb.
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
1995 J jnl
A condition for matchability in hypergraphs.
Graphs Comb.
Penny E. Haxell
1995 J jnl
A note on a conjecture of Gallai.
Graphs Comb.
Penny E. Haxell
1995 J jnl
On the Anti-Ramsey Property of Ramanujan Graphs.
Random Struct. Algorithms
Penny E. Haxell, Yoshiharu Kohayakawa
1995 J jnl
The Induced Size-Ramsey Number of Cycles.
Comb. Probab. Comput.
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
1995 J jnl
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory B
Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak