default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPenny E. Haxell
Person information
- affiliation: Department of Combinatorics and Optimization, University of Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j62]Penny Haxell, Ronen Wdowinski:
Constructing Graphs with No Independent Transversals. Electron. J. Comb. 31(2) (2024)- [j61]Stijn Cambie
, Penny Haxell, Ross J. Kang, Ronen Wdowinski:
A Precise Condition for Independent Transversals in Bipartite Covers. SIAM J. Discret. Math. 38(2): 1451-1461 (2024) - 2023
- [j60]Penny Haxell, Colter MacDonald:
Large cliques in graphs with high chromatic number. Discret. Math. 346(11): 113181 (2023) - [j59]Penny Haxell, Reza Naserasr:
A Note on Δ-Critical Graphs. Graphs Comb. 39(5): 101 (2023) - [c8]Penny Haxell, Tibor Szabó:
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. SODA 2023: 2875-2897 - [i7]Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski:
A precise condition for independent transversals in bipartite covers. CoRR abs/2308.14778 (2023) - 2022
- [j58]Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for Weighted Independent Transversals and Strong Colouring. ACM Trans. Algorithms 18(1): 1:1-1:16 (2022) - [i6]Penny Haxell, Tibor Szabó:
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole. CoRR abs/2202.01143 (2022) - 2021
- [c7]Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for weighted independent transversals and strong colouring. SODA 2021: 662-674 - 2020
- [j57]Alessandra Graf, Penny Haxell:
Finding independent transversals efficiently. Comb. Probab. Comput. 29(5): 780-806 (2020)
2010 – 2019
- 2019
- [j56]Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw:
Morphing Schnyder Drawings of Planar Triangulations. Discret. Comput. Geom. 61(1): 161-184 (2019) - [j55]Penny Haxell, Michael Krivelevich, Gal Kronenberg:
Goldberg's conjecture is true for random multigraphs. J. Comb. Theory B 138: 314-349 (2019) - [c6]Penny Haxell:
Topological connectedness and independent sets in graphs. BCC 2019: 89-114 - [i5]Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for weighted independent transversals and strong colouring. CoRR abs/1907.00033 (2019) - 2018
- [j54]Penny Haxell, Lothar Narins:
A Stability Theorem for Matchings in Tripartite 3-Graphs. Comb. Probab. Comput. 27(5): 774-793 (2018) - [j53]Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg, Alon Naor:
Ramsey-nice families of graphs. Eur. J. Comb. 72: 29-44 (2018) - [j52]Penny Haxell, Lothar Narins, Tibor Szabó:
Extremal hypergraphs for Ryser's Conjecture. J. Comb. Theory A 158: 492-547 (2018) - [i4]Alessandra Graf, Penny Haxell:
Finding Independent Transversals Efficiently. CoRR abs/1811.02687 (2018) - 2017
- [j51]Penny E. Haxell, Alex D. Scott:
A Note on Intersecting Hypergraphs with Large Cover Number. Electron. J. Comb. 24(3): 3 (2017) - [j50]Oliver Cooley, Penny Haxell, Mihyun Kang, Philipp Sprüssel:
Homological connectedness of random hypergraphs. Electron. Notes Discret. Math. 61: 279-285 (2017) - [j49]Penny E. Haxell, Alexander D. Scott:
On Lower Bounds for the Matching Number of Subcubic Graphs. J. Graph Theory 85(2): 336-348 (2017) - [j48]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, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - 2016
- [i3]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, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - 2015
- [j47]Penny E. Haxell, Hal A. Kierstead:
Edge coloring multigraphs without small dense subsets. Discret. Math. 338(12): 2502-2506 (2015) - 2014
- [c5]Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw:
Morphing Schnyder Drawings of Planar Triangulations. GD 2014: 294-305 - [i2]Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw:
Morphing Planar Graph Drawings with Unidirectional Moves. CoRR abs/1411.6185 (2014) - [i1]Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw:
Morphing Schnyder drawings of planar triangulations. CoRR abs/1411.6186 (2014) - 2013
- [j46]Subir Kumar Ghosh, Penny E. Haxell:
Packing and covering tetrahedra. Discret. Appl. Math. 161(9): 1209-1215 (2013) - 2012
- [j45]Penny E. Haxell, Alex D. Scott:
On Ryser's conjecture. Electron. J. Comb. 19(1): 23 (2012) - [j44]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): 113-127 (2012) - [j43]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) - [j42]Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé:
Packing and Covering Triangles in K 4-free Planar Graphs. Graphs Comb. 28(5): 653-662 (2012) - [j41]Penny Haxell, Jessica McDonald:
On characterizing Vizing's edge colouring bound. J. Graph Theory 69(2): 160-168 (2012) - [j40]Robert Berke, Penny E. Haxell, Tibor Szabó:
Bounded transversals in multipartite graphs. J. Graph Theory 70(3): 318-331 (2012) - 2011
- [j39]Fidel Barrera-Cruz, Penny Haxell:
A Note on Schnyder's Theorem. Order 28(2): 221-226 (2011) - [j38]Penny Haxell:
On Forming Committees. Am. Math. Mon. 118(9): 777-788 (2011) - 2010
- [j37]Penny E. Haxell, Jacques Verstraëte:
List Coloring Hypergraphs. Electron. J. Comb. 17(1) (2010) - [j36]Penny E. Haxell, Gordon T. Wilfong:
On the Stable Paths Problem. SIAM J. Discret. Math. 24(3): 1137-1152 (2010)
2000 – 2009
- 2009
- [j35]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): 165-203 (2009) - [j34]András Gyárfás, Penny E. Haxell:
Large monochromatic components in colorings of complete 3-uniform hypergraphs. Discret. Math. 309(10): 3156-3160 (2009) - [j33]Qing Cui, Penny Haxell, Will Ma:
Packing and Covering Triangles in Planar Graphs. Graphs Comb. 25(6): 817-824 (2009) - 2008
- [j32]Penny E. Haxell, Oleg Pikhurko, Andrew Thomason:
Maximum acyclic and fragmented sets in regular graphs. J. Graph Theory 57(2): 149-156 (2008) - [j31]Penny E. Haxell:
An improved bound for the strong chromatic number. J. Graph Theory 58(2): 148-158 (2008) - [j30]Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method. SIAM J. Comput. 37(6): 1728-1776 (2008) - [c4]Penny E. Haxell, Gordon T. Wilfong:
A fractional model of the border gateway protocol (BGP). SODA 2008: 193-199 - 2007
- [j29]Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka:
On Directed Triangles in Digraphs. Electron. J. Comb. 14(1) (2007) - [j28]Penny E. Haxell, Ben Seamone, Jacques Verstraëte:
Independent dominating sets and hamiltonian cycles. J. Graph Theory 54(3): 233-244 (2007) - 2006
- [j27]Penny E. Haxell, Tibor Szabó:
Odd Independent Transversals are Odd. Comb. Probab. Comput. 15(1-2): 193-211 (2006) - [j26]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 A 113(1): 67-83 (2006) - 2005
- [j25]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): 191-206 (2005) - [c3]Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
An Algorithmic Version of the Hypergraph Regularity Method. FOCS 2005: 439-448 - 2004
- [j24]Penny E. Haxell:
On the Strong Chromatic Number. Comb. Probab. Comput. 13(6): 857-865 (2004) - [j23]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 B 90(1): 1 (2004) - 2003
- [j22]Penny E. Haxell, Tibor Szabó, Gábor Tardos:
Bounded size components--partitions and transversals. J. Comb. Theory B 88(2): 281-297 (2003) - [j21]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
- [j20]Penny E. Haxell, Tomasz Luczak, P. W. Tingley:
Ramsey Numbers for Trees of Small Maximum Degree. Comb. 22(2): 287-320 (2002) - [j19]Ronald J. Gould, Penny E. Haxell, Alex D. Scott:
A Note on Cycle Lengths in Graphs. Graphs Comb. 18(3): 491-498 (2002) - [j18]Y. Dementieva, Penny E. Haxell, Brendan Nagle, Vojtech Rödl:
On characterizing hypergraph regularity. Random Struct. Algorithms 21(3-4): 293-335 (2002) - [c2]Penny E. Haxell, April Rasala, Gordon T. Wilfong, Peter Winkler:
Wide-Sense Nonblocking WDM Cross-Connects. ESA 2002: 538-549 - 2001
- [j17]Penny E. Haxell, Vojtech Rödl:
Integer and Fractional Packings in Dense Graphs. Comb. 21(1): 13-38 (2001) - [j16]Penny E. Haxell:
A Note on Vertex List Colouring. Comb. Probab. Comput. 10(4): 345-347 (2001) - [j15]Penny E. Haxell:
Tree embeddings. J. Graph Theory 36(3): 121-130 (2001) - 2000
- [j14]Penny E. Haxell, Tomasz Luczak:
Embedding trees into graphs of large girth. Discret. Math. 216(1-3): 273-278 (2000) - [j13]Ron Aharoni, Penny Haxell:
Hall's theorem for hypergraphs. J. Graph Theory 35(2): 83-88 (2000)
1990 – 1999
- 1999
- [j12]Penny E. Haxell:
Packing and covering triangles in graphs. Discret. Math. 195(1-3): 251-254 (1999) - 1998
- [j11]Penny E. Haxell, Yoshiharu Kohayakawa:
Packing and Covering Triangles in Tripartite Graphs. Graphs Comb. 14(1): 1-10 (1998) - 1997
- [j10]Penny E. Haxell:
Partitioning Complete Bipartite Graphs by Monochromatic Cycles, . J. Comb. Theory B 69(2): 210-218 (1997) - [j9]Bo Yu, Joseph Cheriyan, Penny E. Haxell:
Hypercubes and Multicommodity Flows. SIAM J. Discret. Math. 10(2): 190-200 (1997) - [c1]Penny E. Haxell, Martin Loebl:
On Defect Sets in Bipartite Graphs (Extended Abstract). ISAAC 1997: 334-343 - 1996
- [j8]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. Comb. 16(1): 107-122 (1996) - [j7]Penny E. Haxell:
Atoms of set systems with a fixed number of pairwise unions. Discret. Math. 150(1-3): 155-166 (1996) - [j6]Penny E. Haxell, Yoshiharu Kohayakawa:
Partitioning by Monochromatic Trees. J. Comb. Theory, Ser. B 68(2): 218-222 (1996) - 1995
- [j5]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
The Induced Size-Ramsey Number of Cycles. Comb. Probab. Comput. 4: 217-239 (1995) - [j4]Penny E. Haxell:
A note on a conjecture of Gallai. Graphs Comb. 11(1): 53-57 (1995) - [j3]Penny E. Haxell:
A condition for matchability in hypergraphs. Graphs Comb. 11(3): 245-248 (1995) - [j2]Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak:
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. J. Comb. Theory B 64(2): 273-287 (1995) - [j1]Penny E. Haxell, Yoshiharu Kohayakawa:
On the Anti-Ramsey Property of Ramanujan Graphs. Random Struct. Algorithms 6(4): 417-432 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
