The Induced Size-Ramsey Number of Cycles. - Penny E. Haxell; Yoshiharu Kohayakawa; Tomasz Luczak 001 (Comb. Probab. Comput., 1995)

A note on a conjecture of Gallai. - Penny E. Haxell (Graphs Comb., 1995)

A condition for matchability in hypergraphs. - Penny E. Haxell (Graphs Comb., 1995)

Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. - Penny E. Haxell; Yoshiharu Kohayakawa; Tomasz Luczak 001 (J. Comb. Theory B, 1995)

On the Anti-Ramsey Property of Ramanujan Graphs. - Penny E. Haxell; Yoshiharu Kohayakawa (Random Struct. Algorithms, 1995)

Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. - Penny E. Haxell; Yoshiharu Kohayakawa; Tomasz Luczak 001 (Comb., 1996)

Atoms of set systems with a fixed number of pairwise unions. - Penny E. Haxell (Discret. Math., 1996)

Partitioning by Monochromatic Trees. - Penny E. Haxell; Yoshiharu Kohayakawa (J. Comb. Theory, Ser. B, 1996)

On Defect Sets in Bipartite Graphs (Extended Abstract). - Penny E. Haxell; Martin Loebl (ISAAC, 1997)

Partitioning Complete Bipartite Graphs by Monochromatic Cycles, . - Penny E. Haxell (J. Comb. Theory B, 1997)

Hypercubes and Multicommodity Flows. - Bo Yu 001; Joseph Cheriyan; Penny E. Haxell (SIAM J. Discret. Math., 1997)

Packing and Covering Triangles in Tripartite Graphs. - Penny E. Haxell; Yoshiharu Kohayakawa (Graphs Comb., 1998)

Packing and covering triangles in graphs. - Penny E. Haxell (Discret. Math., 1999)

Embedding trees into graphs of large girth. - Penny E. Haxell; Tomasz Luczak 001 (Discret. Math., 2000)

Hall's theorem for hypergraphs. - Ron Aharoni; Penny Haxell (J. Graph Theory, 2000)

Integer and Fractional Packings in Dense Graphs. - Penny E. Haxell; Vojtech Rödl (Comb., 2001)

A Note on Vertex List Colouring. - Penny E. Haxell (Comb. Probab. Comput., 2001)

Tree embeddings. - Penny E. Haxell (J. Graph Theory, 2001)

Wide-Sense Nonblocking WDM Cross-Connects. - Penny E. Haxell; April Rasala; Gordon T. Wilfong; Peter Winkler 001 (ESA, 2002)

Ramsey Numbers for Trees of Small Maximum Degree. - Penny E. Haxell; Tomasz Luczak 001; P. W. Tingley (Comb., 2002)

A Note on Cycle Lengths in Graphs. - Ronald J. Gould; Penny E. Haxell; Alex D. Scott (Graphs Comb., 2002)

On characterizing hypergraph regularity. - Y. Dementieva; Penny E. Haxell; Brendan Nagle; Vojtech Rödl (Random Struct. Algorithms, 2002)

Bounded size components–partitions and transversals. - Penny E. Haxell; Tibor Szabó; Gábor Tardos (J. Comb. Theory B, 2003)

Integer and fractional packings in dense 3-uniform hypergraphs. - Penny E. Haxell; Brendan Nagle; Vojtech Rödl (Random Struct. Algorithms, 2003)

On the Strong Chromatic Number. - Penny E. Haxell (Comb. Probab. Comput., 2004)

To Adrian Bondy and U. S. R. Murty. - William H. Cunningham; Penny E. Haxell; R. Bruce Richter; Nicholas C. Wormald; Andrew Thomason 001 (J. Comb. Theory B, 2004)

A note on the Size-Ramsey number of long subdivisions of graphs. - Jair Donadelli; Penny E. Haxell; Yoshiharu Kohayakawa (RAIRO Theor. Informatics Appl., 2005)

Odd Independent Transversals are Odd. - Penny E. Haxell; Tibor Szabó (Comb. Probab. Comput., 2006)

The Ramsey number for hypergraph cycles I. - Penny E. Haxell; Tomasz Luczak 001; Yuejian Peng; Vojtech Rödl; Andrzej Rucinski 001; Miklós Simonovits; Jozef Skokan (J. Comb. Theory A, 2006)

On Directed Triangles in Digraphs. - Peter Hamburger; Penny E. Haxell; Alexandr V. Kostochka (Electron. J. Comb., 2007)

Independent dominating sets and hamiltonian cycles. - Penny E. Haxell; Ben Seamone; Jacques Verstraëte (J. Graph Theory, 2007)

A fractional model of the border gateway protocol (BGP). - Penny E. Haxell; Gordon T. Wilfong (SODA, 2008)

An improved bound for the strong chromatic number. - Penny E. Haxell (J. Graph Theory, 2008)

Maximum acyclic and fragmented sets in regular graphs. - Penny E. Haxell; Oleg Pikhurko; Andrew Thomason 001 (J. Graph Theory, 2008)

An Algorithmic Version of the Hypergraph Regularity Method. - Penny E. Haxell; Brendan Nagle; Vojtech Rödl (SIAM J. Comput., 2008)

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. - Penny E. Haxell; Tomasz Luczak 001; Yuejian Peng; Vojtech Rödl; Andrzej Rucinski 001; Jozef Skokan (Comb. Probab. Comput., 2009)

Large monochromatic components in colorings of complete 3-uniform hypergraphs. - András Gyárfás; Penny E. Haxell (Discret. Math., 2009)

Packing and Covering Triangles in Planar Graphs. - Qing Cui; Penny Haxell; Will Ma (Graphs Comb., 2009)

List Coloring Hypergraphs. - Penny E. Haxell; Jacques Verstraëte (Electron. J. Comb., 2010)

On the Stable Paths Problem. - Penny E. Haxell; Gordon T. Wilfong (SIAM J. Discret. Math., 2010)

A Note on Schnyder's Theorem. - Fidel Barrera-Cruz; Penny Haxell (Order, 2011)

On Forming Committees. - Penny Haxell (Am. Math. Mon., 2011)

On Ryser's conjecture. - Penny E. Haxell; Alex D. Scott (Electron. J. Comb., 2012)

On Even-Degree Subgraphs of Linear Hypergraphs. - Domingos Dellamonica Jr.; Penny E. Haxell; Tomasz Luczak 001; Dhruv Mubayi; Brendan Nagle; Yury Person; Vojtech Rödl; Mathias Schacht; Jacques Verstraëte (Comb. Probab. Comput., 2012)

A stability theorem on fractional covering of triangles by edges. - Penny E. Haxell; Alexandr V. Kostochka; Stéphan Thomassé (Eur. J. Comb., 2012)

Packing and Covering Triangles in K 4-free Planar Graphs. - Penny E. Haxell; Alexandr V. Kostochka; Stéphan Thomassé (Graphs Comb., 2012)

Bounded transversals in multipartite graphs. - Robert Berke; Penny E. Haxell; Tibor Szabó (J. Graph Theory, 2012)

On characterizing Vizing's edge colouring bound. - Penny Haxell; Jessica McDonald (J. Graph Theory, 2012)

Packing and covering tetrahedra. - Subir Kumar Ghosh; Penny E. Haxell (Discret. Appl. Math., 2013)

Morphing Planar Graph Drawings with Unidirectional Moves. - Fidel Barrera-Cruz; Penny E. Haxell; Anna Lubiw (CoRR, 2014)

Edge coloring multigraphs without small dense subsets. - Penny E. Haxell; Hal A. Kierstead (Discret. Math., 2015)

A Note on Intersecting Hypergraphs with Large Cover Number. - Penny E. Haxell; Alex D. Scott (Electron. J. Comb., 2017)

Homological connectedness of random hypergraphs. - Oliver Cooley; Penny Haxell; Mihyun Kang; Philipp Sprüssel (Electron. Notes Discret. Math., 2017)

On Lower Bounds for the Matching Number of Subcubic Graphs. - Penny E. Haxell; Alexander D. Scott (J. Graph Theory, 2017)

How to Morph Planar Graph Drawings. - Soroush Alamdari; Patrizio Angelini; Fidel Barrera-Cruz; Timothy M. Chan; Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Penny Haxell; Anna Lubiw; Maurizio Patrignani; Vincenzo Roselli; Sahil Singla 001; et al. (SIAM J. Comput., 2017)

A Stability Theorem for Matchings in Tripartite 3-Graphs. - Penny Haxell; Lothar Narins (Comb. Probab. Comput., 2018)

Ramsey-nice families of graphs. - Ron Aharoni; Noga Alon; Michal Amir; Penny Haxell; Dan Hefetz; Zilin Jiang; Gal Kronenberg; Alon Naor (Eur. J. Comb., 2018)

Extremal hypergraphs for Ryser's Conjecture. - Penny Haxell; Lothar Narins; Tibor Szabó (J. Comb. Theory A, 2018)

Topological connectedness and independent sets in graphs. - Penny Haxell (BCC, 2019)

Morphing Schnyder Drawings of Planar Triangulations. - Fidel Barrera-Cruz; Penny Haxell; Anna Lubiw (Discret. Comput. Geom., 2019)

Goldberg's conjecture is true for random multigraphs. - Penny Haxell; Michael Krivelevich; Gal Kronenberg (J. Comb. Theory B, 2019)

Finding independent transversals efficiently. - Alessandra Graf; Penny Haxell (Comb. Probab. Comput., 2020)

Algorithms for Weighted Independent Transversals and Strong Colouring. - Alessandra Graf; David G. Harris 001; Penny Haxell (ACM Trans. Algorithms, 2022)

A Note on Δ-Critical Graphs. - Penny Haxell; Reza Naserasr (Graphs Comb., 2023)

Large cliques in graphs with high chromatic number. - Penny Haxell; Colter MacDonald (Discret. Math., 2023)

Constructing Graphs with No Independent Transversals. - Penny Haxell; Ronen Wdowinski (Electron. J. Comb., 2024)

Density of 3-critical signed graphs. - Laurent Beaudou; Penny Haxell; Kathryn Nurse; Sagnik Sen 001; Zhouningxin Wang (J. Graph Theory, 2024)

Degree criteria and stability for independent transversals. - Penny Haxell; Ronen Wdowinski (J. Graph Theory, 2024)

A Precise Condition for Independent Transversals in Bipartite Covers. - Stijn Cambie; Penny Haxell; Ross J. Kang; Ronen Wdowinski (SIAM J. Discret. Math., 2024)

A Bounded Diameter Strengthening of Kőnig's Theorem. - Louis DeBiasio; António Girão; Penny Haxell; Maya Stein (SIAM J. Discret. Math., 2025)

Improved Integrality Gap in Max-Min Allocation, or, Topology at the North Pole. - Penny Haxell; Tibor Szabó (Comb., 2025)