Penny E. Haxell

Penny Haxell

Department of Combinatorics and Optimization, University of Waterloo, ON, Canada

	2013
j44		Subir Kumar Ghosh, Penny E. Haxell: Packing and covering tetrahedra. Discrete Applied Mathematics 161(9): 1209-1215 (2013)
	2012
j43		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. Combinatorics, Probability & Computing 21(1-2): 113-127 (2012)
j42		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)
j41		Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé: Packing and Covering Triangles in K 4-free Planar Graphs. Graphs and Combinatorics 28(5): 653-662 (2012)
j40		Penny Haxell, Jessica McDonald: On characterizing Vizing's edge colouring bound. Journal of Graph Theory 69(2): 160-168 (2012)
j39		Robert Berke, Penny E. Haxell, Tibor Szabó: Bounded transversals in multipartite graphs. Journal of Graph Theory 70(3): 318-331 (2012)
	2011
j38		Fidel Barrera-Cruz, Penny Haxell: A Note on Schnyder's Theorem. Order 28(2): 221-226 (2011)
j37		Penny Haxell: On Forming Committees. The American Mathematical Monthly 118(9): 777-788 (2011)
	2010
j36		Penny E. Haxell, Jacques Verstraëte: List Coloring Hypergraphs. Electr. J. Comb. 17(1) (2010)
j35		Penny E. Haxell, Gordon T. Wilfong: On the Stable Paths Problem. SIAM J. Discrete Math. 24(3): 1137-1152 (2010)
	2009
j34		Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Combinatorics, Probability & Computing 18(1-2): 165-203 (2009)
j33		András Gyárfás, Penny E. Haxell: Large monochromatic components in colorings of complete 3-uniform hypergraphs. Discrete Mathematics 309(10): 3156-3160 (2009)
j32		Qing Cui, Penny Haxell, Will Ma: Packing and Covering Triangles in Planar Graphs. Graphs and Combinatorics 25(6): 817-824 (2009)
	2008
j31		Penny E. Haxell, Oleg Pikhurko, Andrew Thomason: Maximum acyclic and fragmented sets in regular graphs. Journal of Graph Theory 57(2): 149-156 (2008)
j30		Penny E. Haxell: An improved bound for the strong chromatic number. Journal of Graph Theory 58(2): 148-158 (2008)
j29		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
j28		Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka: On Directed Triangles in Digraphs. Electr. J. Comb. 14(1) (2007)
j27		Penny E. Haxell, Ben Seamone, Jacques Verstraëte: Independent dominating sets and hamiltonian cycles. Journal of Graph Theory 54(3): 233-244 (2007)
	2006
j26		Penny E. Haxell, Tibor Szabó: Odd Independent Transversals are Odd. Combinatorics, Probability & Computing 15(1-2): 193-211 (2006)
j25		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): 67-83 (2006)
	2005
j24		Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa: A note on the Size-Ramsey number of long subdivisions of graphs. ITA 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
j23		Penny E. Haxell: On the Strong Chromatic Number. Combinatorics, Probability & Computing 13(6): 857-865 (2004)
j22		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): 1 (2004)
	2003
j21		Penny E. Haxell, Tibor Szabó, Gábor Tardos: Bounded size components--partitions and transversals. J. Comb. Theory, Ser. B 88(2): 281-297 (2003)
j20		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
j19		Penny E. Haxell, Tomasz Luczak, P. W. Tingley: Ramsey Numbers for Trees of Small Maximum Degree. Combinatorica 22(2): 287-320 (2002)
j18		Ronald J. Gould, Penny E. Haxell, A. D. Scott: A Note on Cycle Lengths in Graphs. Graphs and Combinatorics 18(3): 491-498 (2002)
j17		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
j16		Penny E. Haxell, Vojtech Rödl: Integer and Fractional Packings in Dense Graphs. Combinatorica 21(1): 13-38 (2001)
j15		Penny E. Haxell: Tree embeddings. Journal of Graph Theory 36(3): 121-130 (2001)
	2000
j14		Penny E. Haxell, Tomasz Luczak: Embedding trees into graphs of large girth. Discrete Mathematics 216(1-3): 273-278 (2000)
j13		Ron Aharoni, Penny Haxell: Hall's theorem for hypergraphs. Journal of Graph Theory 35(2): 83-88 (2000)
	1999
j12		Penny E. Haxell: Packing and covering triangles in graphs. Discrete Mathematics 195(1-3): 251-254 (1999)
	1998
j11		Penny E. Haxell, Yoshiharu Kohayakawa: Packing and Covering Triangles in Tripartite Graphs. Graphs and Combinatorics 14(1): 1-10 (1998)
	1997
j10		Penny E. Haxell: Partitioning Complete Bipartite Graphs by Monochromatic Cycles, . J. Comb. Theory, Ser. B 69(2): 210-218 (1997)
j9		Bo Yu, Joseph Cheriyan, Penny E. Haxell: Hypercubes and Multicommodity Flows. SIAM J. Discrete 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. Combinatorica 16(1): 107-122 (1996)
j7		Penny E. Haxell: Atoms of set systems with a fixed number of pairwise unions. Discrete Mathematics 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. Combinatorics, Probability & Computing 4: 217-239 (1995)
j4		Penny E. Haxell: A note on a conjecture of Gallai. Graphs and Combinatorics 11(1): 53-57 (1995)
j3		Penny E. Haxell: A condition for matchability in hypergraphs. Graphs and Combinatorics 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, Ser. 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

Colors in the list of coauthors

Last update Mon May 20 17:23:40 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page