André E. Kézdy

41 papers A* 1Journal 40
YearRankTypeTitle / Venue / Authors
2026 J jnl
The Schrijver system of the length polyhedron of an interval order.
Discret. Appl. Math.
André E. Kézdy, Jeno Lehel
2026 J jnl
The length polyhedron of an interval order.
Discret. Optim.
Csaba Biró, André E. Kézdy, Jeno Lehel
2026 J jnl
Two-count Interval Representation of a Permutation.
Order
Csaba Biró, André E. Kézdy, Jeno Lehel
2024 J jnl
The Schrijver system of the length polyhedron of an interval order.
CoRR
André E. Kézdy, Jeno Lehel
2023 J jnl
An asymptotic resolution of a conjecture of Szemerédi and Petruska.
Discret. Math.
André E. Kézdy, Jeno Lehel
2022 J jnl
An asymptotic resolution of a conjecture of Szemerédi and Petruska.
CoRR
André E. Kézdy, Jeno Lehel
2022 J jnl
Systems of Overlap Representation for Families of Intervals.
Graphs Comb.
Adam S. Jobson, André E. Kézdy, Kevin G. Milans, Douglas B. West, D. Jacob Wildstrom
2021 J jnl
All Minor-Minimal Apex Obstructions with Connectivity Two.
Electron. J. Comb.
Adam S. Jobson, André E. Kézdy
2021 J jnl
Eckhoff's Problem on Convex Sets in the Plane.
Electron. J. Comb.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2021 J jnl
Minimal 2-connected graphs satisfying the even cut condition.
Inf. Process. Lett.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2021 J jnl
Path-pairability of infinite planar grids.
Period. Math. Hung.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2020 J jnl
Note on the bisection width of cubic graphs.
Discret. Appl. Math.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2020 J jnl
Petruska's question on planar convex sets.
Discret. Math.
Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth
2019 J jnl
The path-pairability number of products of stars.
Discuss. Math. Graph Theory
Adam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros
2018 J jnl
All minor-minimal apex obstructions with connectivity two.
CoRR
Adam S. Jobson, André E. Kézdy
2018 J jnl
Linkage on the infinite grid.
Inf. Process. Lett.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2018 J jnl
The minimum size of graphs satisfying cut conditions.
Discret. Appl. Math.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2016 J jnl
Detour trees.
Discret. Appl. Math.
Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White
2014 J jnl
Connected matchings in chordal bipartite graphs.
Discret. Optim.
Adam S. Jobson, André E. Kézdy, Susan C. White
2014 J jnl
The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs.
Ars Comb.
Timothy M. Brauch, André E. Kézdy, Hunter S. Snevily
2009 J jnl
Generalized Schur Numbers for x
Electron. J. Comb.
André E. Kézdy, Hunter S. Snevily, Susan C. White
2008 J jnl
On the editing distance of graphs.
J. Graph Theory
Maria Axenovich, André E. Kézdy, Ryan R. Martin
2006 J jnl
Odd cycles and Theta-cycles in hypergraphs.
Discret. Math.
András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
2006 J jnl
rho-Valuations for some stunted trees.
Discret. Math.
André E. Kézdy
2004 J jnl
Polynomials that Vanish on Distinct nth Roots of Unity.
Comb. Probab. Comput.
André E. Kézdy, Hunter S. Snevily
2003 J jnl
Heavy Transversals and Indecomposable Hypergraphs.
Comb.
André E. Kézdy, Jenö Lehel, Robert C. Powers
2002 J jnl
A finite basis characterization of ?-split colorings.
Discret. Math.
András Gyárfás, André E. Kézdy, Jenö Lehel
2002 J jnl
Distinct Sums Modulo N And Tree Embeddings.
Comb. Probab. Comput.
André E. Kézdy, Hunter S. Snevily
2001 J jnl
A proof of Hougardy's conjecture for diamond-free graphs.
Discret. Math.
André E. Kézdy, Matthew Scobee
2000 J jnl
Clique covering the edges of a locally cobipartite graph.
Discret. Math.
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang
1999 J jnl
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling.
Discret. Math.
André E. Kézdy, Chi Wang
1999 J jnl
Scenic graphs II: non-traceable graphs.
Australas. J Comb.
Michael S. Jacobson, André E. Kézdy, Jeno Lehel
1998 J jnl
Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.
Networks
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1998 J jnl
Scenic Graphs I: Traceable Graphs.
Ars Comb.
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1998 J jnl
Tough enough chordal graphs are Hamiltonian.
Networks
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1997 J jnl
On Extensions of a Conjecture of Gallai.
J. Comb. Theory B
André E. Kézdy, Hunter S. Snevily
1997 J jnl
Recognizing Intersection Graphs of Linear Uniform Hypergraphs.
Graphs Comb.
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1996 J jnl
Partitioning Permutations into Increasing and Decreasing Subsequences.
J. Comb. Theory A
André E. Kézdy, Hunter S. Snevily, Chi Wang
1995 J jnl
The 2-intersection number of paths and bounded-degree trees.
J. Graph Theory
Michael S. Jacobson, André E. Kézdy, Douglas B. West
1992 A* conf
Sequential and Parallel Algorithms to Find a K
SODA
André E. Kézdy, Patrick McGuinness
1991 J jnl
Do 3
J. Graph Theory
André E. Kézdy, Patrick McGuinness