André E. Kézdy - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2023

An asymptotic resolution of a conjecture of Szemerédi and PetruskaAndré E. Kézdy, Jeno Lehel. DM, 346(8):113469, August 2023. [doi]

2022

Systems of Overlap Representation for Families of IntervalsAdam S. Jobson, André E. Kézdy, Kevin G. Milans, Douglas B. West, D. Jacob Wildstrom. gc, 38(2):36, 2022. [doi]

2021

2020

Note on the bisection width of cubic graphsAdam S. Jobson, André E. Kézdy, Jeno Lehel. DAM, 285:434-442, 2020. [doi]

Petruska's question on planar convex setsAdam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth 0001. DM, 343(9):111956, 2020. [doi]

2019

The path-pairability number of products of starsAdam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros. dmgt, 39(4):909-924, 2019. [doi]

2018

The minimum size of graphs satisfying cut conditionsAdam S. Jobson, André E. Kézdy, Jeno Lehel. DAM, 237:89-96, 2018. [doi]

Linkage on the infinite gridAdam S. Jobson, André E. Kézdy, Jeno Lehel. ipl, 137:51-56, 2018. [doi]

2016

Detour treesAdam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White. DAM, 206:73-80, 2016. [doi]

2014

The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite GraphsTimothy M. Brauch, André E. Kézdy, Hunter S. Snevily. arscom, 114:461-475, 2014.

Connected matchings in chordal bipartite graphsAdam S. Jobson, André E. Kézdy, Susan C. White. disopt, 14:34-45, 2014. [doi]

2009

3André E. Kézdy, Hunter S. Snevily, Susan C. White. combinatorics, 16(1), 2009. [doi]

2008

On the editing distance of graphsMaria Axenovich, André E. Kézdy, Ryan Martin. jgt, 58(2):123-138, 2008. [doi]

2006

Odd cycles and Theta-cycles in hypergraphsAndrás Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel. DM, 306(19-20):2481-2491, 2006. [doi]

rho-Valuations for some stunted treesAndré E. Kézdy. DM, 306(21):2786-2789, 2006. [doi]

2004

Polynomials that Vanish on Distinct nth Roots of UnityAndré E. Kézdy, Hunter S. Snevily. cpc, 13(1):37-59, 2004.

2003

Heavy Transversals and Indecomposable HypergraphsAndré E. Kézdy, Jenö Lehel, Robert C. Powers. combinatorica, 23(2):303-310, 2003. [doi]

2002

A finite basis characterization of ?-split coloringsAndrás Gyárfás, André E. Kézdy, Jenö Lehel. DM, 257(2-3):415-421, 2002. [doi]

Distinct Sums Modulo N And Tree EmbeddingsAndré E. Kézdy, Hunter S. Snevily. cpc, 11(1):35-42, 2002.

2001

A proof of Hougardy s conjecture for diamond-free graphsAndré E. Kézdy, Matthew Scobee. DM, 240(1-3):83-95, 2001. [doi]

2000

Clique covering the edges of a locally cobipartite graphGuantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang. DM, 219(1-3):17-26, 2000. [doi]

1999

Scenic graphs II: non-traceable graphsMichael S. Jacobson, André E. Kézdy, Jeno Lehel. ajc, 19:287, 1999. [doi]

Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labelingAndré E. Kézdy, Chi Wang. DM, 194(1-3):261-265, 1999. [doi]

1998

Tough enough chordal graphs are HamiltonianGuantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel. networks, 31(1):29-38, 1998. [doi]

Recognizing triangle-free graphs with induced path-cycle double covers is NP-completeMichael S. Jacobson, André E. Kézdy, Jenö Lehel. networks, 31(1):1-10, 1998. [doi]

Scenic Graphs I: Traceable GraphsMichael S. Jacobson, André E. Kézdy, Jenö Lehel. arscom, 49, 1998.

1997

Recognizing Intersection Graphs of Linear Uniform HypergraphsMichael S. Jacobson, André E. Kézdy, Jenö Lehel. gc, 13(4):359-367, 1997. [doi]

On Extensions of a Conjecture of GallaiAndré E. Kézdy, Hunter S. Snevily. JCT, 70(2):317-324, 1997. [doi]

1996

Partitioning Permutations into Increasing and Decreasing SubsequencesAndré E. Kézdy, Hunter S. Snevily, Chi Wang. JCT, 73(2):353-359, 1996. [doi]

1995

The 2-intersection number of paths and bounded-degree treesMichael S. Jacobson, André E. Kézdy, Douglas B. West. jgt, 19(4):461-469, 1995. [doi]

1992

Sequential and Parallel Algorithms to Find a K::5:: MinorAndré E. Kézdy, Patrick McGuinness. soda 1992: 345-356 [doi]

1991

5?André E. Kézdy, Patrick McGuinness. jgt, 15(4):389-406, 1991. [doi]

Sign in or sign up to see more results.

runs on WebDSL