According to our database
1,
Penny E. Haxell
authored at least 67 papers
between 1995 and 2023.
Collaborative distances:
2023
Large cliques in graphs with high chromatic number.
Discret. Math., November, 2023
A Note on Δ-Critical Graphs.
Graphs Comb., October, 2023
A precise condition for independent transversals in bipartite covers.
CoRR, 2023
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Algorithms for Weighted Independent Transversals and Strong Colouring.
ACM Trans. Algorithms, 2022
2020
Finding independent transversals efficiently.
Comb. Probab. Comput., 2020
2019
Goldberg's conjecture is true for random multigraphs.
J. Comb. Theory, Ser. B, 2019
Morphing Schnyder Drawings of Planar Triangulations.
Discret. Comput. Geom., 2019
Topological connectedness and independent sets in graphs.
Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019
2018
Extremal hypergraphs for Ryser's Conjecture.
J. Comb. Theory, Ser. A, 2018
Ramsey-nice families of graphs.
Eur. J. Comb., 2018
A Stability Theorem for Matchings in Tripartite 3-Graphs.
Comb. Probab. Comput., 2018
2017
How to Morph Planar Graph Drawings.
,
,
,
,
,
,
,
,
,
,
,
,
SIAM J. Comput., 2017
On Lower Bounds for the Matching Number of Subcubic Graphs.
J. Graph Theory, 2017
Homological connectedness of random hypergraphs.
Electron. Notes Discret. Math., 2017
A Note on Intersecting Hypergraphs with Large Cover Number.
Electron. J. Comb., 2017
2015
Edge coloring multigraphs without small dense subsets.
Discret. Math., 2015
2014
Morphing Planar Graph Drawings with Unidirectional Moves.
CoRR, 2014
2013
Packing and covering tetrahedra.
Discret. Appl. Math., 2013
2012
On characterizing Vizing's edge colouring bound.
J. Graph Theory, 2012
Bounded transversals in multipartite graphs.
J. Graph Theory, 2012
Packing and Covering Triangles in K 4-free Planar Graphs.
Graphs Comb., 2012
A stability theorem on fractional covering of triangles by edges.
Eur. J. Comb., 2012
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012
2011
A Note on Schnyder's Theorem.
Order, 2011
2010
On the Stable Paths Problem.
SIAM J. Discret. Math., 2010
List Coloring Hypergraphs.
Electron. J. Comb., 2010
2009
Packing and Covering Triangles in Planar Graphs.
Graphs Comb., 2009
Large monochromatic components in colorings of complete 3-uniform hypergraphs.
Discret. Math., 2009
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput., 2009
2008
An Algorithmic Version of the Hypergraph Regularity Method.
SIAM J. Comput., 2008
Maximum acyclic and fragmented sets in regular graphs.
J. Graph Theory, 2008
An improved bound for the strong chromatic number.
J. Graph Theory, 2008
A fractional model of the border gateway protocol (BGP).
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
2007
Independent dominating sets and hamiltonian cycles.
J. Graph Theory, 2007
On Directed Triangles in Digraphs.
Electron. J. Comb., 2007
2006
The Ramsey number for hypergraph cycles I.
J. Comb. Theory, Ser. A, 2006
Odd Independent Transversals are Odd.
Comb. Probab. Comput., 2006
2005
A note on the Size-Ramsey number of long subdivisions of graphs.
RAIRO Theor. Informatics Appl., 2005
2004
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory, Ser. B, 2004
On the Strong Chromatic Number.
Comb. Probab. Comput., 2004
2003
Integer and fractional packings in dense 3-uniform hypergraphs.
Random Struct. Algorithms, 2003
Bounded size components--partitions and transversals.
J. Comb. Theory, Ser. B, 2003
2002
On characterizing hypergraph regularity.
Random Struct. Algorithms, 2002
A Note on Cycle Lengths in Graphs.
Graphs Comb., 2002
Ramsey Numbers for Trees of Small Maximum Degree.
Comb., 2002
Wide-Sense Nonblocking WDM Cross-Connects.
Proceedings of the Algorithms, 2002
2001
A Note on Vertex List Colouring.
Comb. Probab. Comput., 2001
Integer and Fractional Packings in Dense Graphs.
Comb., 2001
2000
Hall's theorem for hypergraphs.
J. Graph Theory, 2000
Embedding trees into graphs of large girth.
Discret. Math., 2000
1999
Packing and covering triangles in graphs.
Discret. Math., 1999
1998
Packing and Covering Triangles in Tripartite Graphs.
Graphs Comb., 1998
1997
Hypercubes and Multicommodity Flows.
SIAM J. Discret. Math., 1997
Partitioning Complete Bipartite Graphs by Monochromatic Cycles<sup>, </sup>.
J. Comb. Theory, Ser. B, 1997
On Defect Sets in Bipartite Graphs (Extended Abstract).
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
1996
Partitioning by Monochromatic Trees.
J. Comb. Theory, Ser. B, 1996
Atoms of set systems with a fixed number of pairwise unions.
Discret. Math., 1996
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Comb., 1996
1995
On the Anti-Ramsey Property of Ramanujan Graphs.
Random Struct. Algorithms, 1995
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory, Ser. B, 1995
A condition for matchability in hypergraphs.
Graphs Comb., 1995
A note on a conjecture of Gallai.
Graphs Comb., 1995
The Induced Size-Ramsey Number of Cycles.
Comb. Probab. Comput., 1995
