Do 3n - 5 edges force a subdivision of K5? - André E. Kézdy; Patrick McGuinness (J. Graph Theory, 1991)

Sequential and Parallel Algorithms to Find a K5 Minor. - André E. Kézdy; Patrick McGuinness (SODA, 1992)

The 2-intersection number of paths and bounded-degree trees. - Michael S. Jacobson; André E. Kézdy; Douglas B. West (J. Graph Theory, 1995)

Partitioning Permutations into Increasing and Decreasing Subsequences. - André E. Kézdy; Hunter S. Snevily; Chi Wang 002 (J. Comb. Theory A, 1996)

Recognizing Intersection Graphs of Linear Uniform Hypergraphs. - Michael S. Jacobson; André E. Kézdy; Jenö Lehel (Graphs Comb., 1997)

On Extensions of a Conjecture of Gallai. - André E. Kézdy; Hunter S. Snevily (J. Comb. Theory B, 1997)

Scenic Graphs I: Traceable Graphs. - Michael S. Jacobson; André E. Kézdy; Jenö Lehel (Ars Comb., 1998)

Tough enough chordal graphs are Hamiltonian. - Guantao Chen; Michael S. Jacobson; André E. Kézdy; Jenö Lehel (Networks, 1998)

Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. - Michael S. Jacobson; André E. Kézdy; Jenö Lehel (Networks, 1998)

Scenic graphs II: non-traceable graphs. - Michael S. Jacobson; André E. Kézdy; Jeno Lehel (Australas. J Comb., 1999)

Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. - André E. Kézdy; Chi Wang 002 (Discret. Math., 1999)

Clique covering the edges of a locally cobipartite graph. - Guantao Chen; Michael S. Jacobson; André E. Kézdy; Jenö Lehel; Edward R. Scheinerman; Chi Wang 002 (Discret. Math., 2000)

A proof of Hougardy's conjecture for diamond-free graphs. - André E. Kézdy; Matthew Scobee (Discret. Math., 2001)

Distinct Sums Modulo N And Tree Embeddings. - André E. Kézdy; Hunter S. Snevily (Comb. Probab. Comput., 2002)

A finite basis characterization of ?-split colorings. - András Gyárfás; André E. Kézdy; Jenö Lehel (Discret. Math., 2002)

Heavy Transversals and Indecomposable Hypergraphs. - André E. Kézdy; Jenö Lehel; Robert C. Powers (Comb., 2003)

Polynomials that Vanish on Distinct nth Roots of Unity. - André E. Kézdy; Hunter S. Snevily (Comb. Probab. Comput., 2004)

Odd cycles and Theta-cycles in hypergraphs. - András Gyárfás; Michael S. Jacobson; André E. Kézdy; Jenö Lehel (Discret. Math., 2006)

rho-Valuations for some stunted trees. - André E. Kézdy (Discret. Math., 2006)

On the editing distance of graphs. - Maria Axenovich; André E. Kézdy; Ryan R. Martin (J. Graph Theory, 2008)

Generalized Schur Numbers for x1 + x2 + c = 3x3. - André E. Kézdy; Hunter S. Snevily; Susan C. White (Electron. J. Comb., 2009)

The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs. - Timothy M. Brauch; André E. Kézdy; Hunter S. Snevily (Ars Comb., 2014)

Connected matchings in chordal bipartite graphs. - Adam S. Jobson; André E. Kézdy; Susan C. White (Discret. Optim., 2014)

Detour trees. - Adam S. Jobson; André E. Kézdy; Jenö Lehel; Susan C. White (Discret. Appl. Math., 2016)

The minimum size of graphs satisfying cut conditions. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Discret. Appl. Math., 2018)

Linkage on the infinite grid. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Inf. Process. Lett., 2018)

The path-pairability number of products of stars. - Adam S. Jobson; André E. Kézdy; Jeno Lehel; Gábor Mészáros (Discuss. Math. Graph Theory, 2019)

Note on the bisection width of cubic graphs. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Discret. Appl. Math., 2020)

Petruska's question on planar convex sets. - Adam S. Jobson; André E. Kézdy; Jeno Lehel; Timothy J. Pervenecki; Géza Tóth 001 (Discret. Math., 2020)

All Minor-Minimal Apex Obstructions with Connectivity Two. - Adam S. Jobson; André E. Kézdy (Electron. J. Comb., 2021)

Eckhoff's Problem on Convex Sets in the Plane. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Electron. J. Comb., 2021)

Minimal 2-connected graphs satisfying the even cut condition. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Inf. Process. Lett., 2021)

Path-pairability of infinite planar grids. - Adam S. Jobson; André E. Kézdy; Jeno Lehel (Period. Math. Hung., 2021)

Systems of Overlap Representation for Families of Intervals. - Adam S. Jobson; André E. Kézdy; Kevin G. Milans; Douglas B. West; D. Jacob Wildstrom (Graphs Comb., 2022)

An asymptotic resolution of a conjecture of Szemerédi and Petruska. - André E. Kézdy; Jeno Lehel (Discret. Math., 2023)

The Schrijver system of the length polyhedron of an interval order. - André E. Kézdy; Jeno Lehel (Discret. Appl. Math., 2026)