André E. Kézdy

	2008
16		Maria Axenovich, André E. Kézdy, Ryan Martin: On the editing distance of graphs. Journal of Graph Theory 58(2): 123-138 (2008)
	2006
15		András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Odd cycles and Theta-cycles in hypergraphs. Discrete Mathematics 306(19-20): 2481-2491 (2006)
14		André E. Kézdy: rho-Valuations for some stunted trees. Discrete Mathematics 306(21): 2786-2789 (2006)
	2004
13		André E. Kézdy, Hunter S. Snevily: Polynomials that Vanish on Distinct nth Roots of Unity. Combinatorics, Probability & Computing 13(1): 37-59 (2004)
	2003
12		André E. Kézdy, Jenö Lehel, Robert C. Powers: Heavy Transversals and Indecomposable Hypergraphs. Combinatorica 23(2): 303-310 (2003)
	2002
11		André E. Kézdy, Hunter S. Snevily: Distinct Sums Modulo N And Tree Embeddings. Combinatorics, Probability & Computing 11(1): (2002)
10		András Gyárfás, André E. Kézdy, Jenö Lehel: A finite basis characterization of ?-split colorings. Discrete Mathematics 257(2-3): 415-421 (2002)
	2001
9		André E. Kézdy, Matthew Scobee: A proof of Hougardy's conjecture for diamond-free graphs. Discrete Mathematics 240(1-3): 83-95 (2001)
	2000
8		Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang: Clique covering the edges of a locally cobipartite graph. Discrete Mathematics 219(1-3): 17-26 (2000)
	1999
7		André E. Kézdy, Chi Wang: Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. Discrete Mathematics 194(1-3): 261-265 (1999)
	1998
6		Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Scenic Graphs I: Traceable Graphs. Ars Comb. 49: (1998)
5		Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. Networks 31(1): 1-10 (1998)
4		Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Tough enough chordal graphs are Hamiltonian. Networks 31(1): 29-38 (1998)
	1997
3		André E. Kézdy, Hunter S. Snevily: On Extensions of a Conjecture of Gallai. J. Comb. Theory, Ser. B 70(2): 317-324 (1997)
	1996
2		André E. Kézdy, Hunter S. Snevily, Chi Wang: Partitioning Permutations into Increasing and Decreasing Subsequences. J. Comb. Theory, Ser. A 73(2): 353-359 (1996)
	1992
1		André E. Kézdy, Patrick McGuinness: Sequential and Parallel Algorithms to Find a K5 Minor. SODA 1992: 345-356

Coauthor Index

1	Maria Axenovich	[16]
2	Guantao Chen	[4] [8]
3	András Gyárfás	[10] [15]
4	Michael S. Jacobson	[4] [5] [6] [8] [15]
5	Jenö Lehel (Jeno Lehel)	[4] [5] [6] [8] [10] [12] [15]
6	Ryan Martin	[16]
7	Patrick McGuinness	[1]
8	Robert C. Powers	[12]
9	Edward R. Scheinerman	[8]
10	Matthew Scobee	[9]
11	Hunter S. Snevily	[2] [3] [11] [13]
12	Chi Wang	[2] [7] [8]

Colors in the list of coauthors