default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré E. Kézdy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j34]André E. Kézdy
, Jeno Lehel:
An asymptotic resolution of a conjecture of Szemerédi and Petruska. Discret. Math. 346(8): 113469 (2023)- 2022
- [j33]Adam S. Jobson, André E. Kézdy, Kevin G. Milans, Douglas B. West, D. Jacob Wildstrom:
Systems of Overlap Representation for Families of Intervals. Graphs Comb. 38(2): 36 (2022) - [i2]André E. Kézdy, Jeno Lehel:
An asymptotic resolution of a conjecture of Szemerédi and Petruska. CoRR abs/2208.11573 (2022) - 2021
- [j32]Adam S. Jobson, André E. Kézdy:
All Minor-Minimal Apex Obstructions with Connectivity Two. Electron. J. Comb. 28(1): 1 (2021) - [j31]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Eckhoff's Problem on Convex Sets in the Plane. Electron. J. Comb. 28(3) (2021) - [j30]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Minimal 2-connected graphs satisfying the even cut condition. Inf. Process. Lett. 167: 106080 (2021) - [j29]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Path-pairability of infinite planar grids. Period. Math. Hung. 83(2): 220-232 (2021) - 2020
- [j28]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Note on the bisection width of cubic graphs. Discret. Appl. Math. 285: 434-442 (2020) - [j27]Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth:
Petruska's question on planar convex sets. Discret. Math. 343(9): 111956 (2020)
2010 – 2019
- 2019
- [j26]Adam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros:
The path-pairability number of products of stars. Discuss. Math. Graph Theory 39(4): 909-924 (2019) - 2018
- [j25]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
The minimum size of graphs satisfying cut conditions. Discret. Appl. Math. 237: 89-96 (2018) - [j24]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Linkage on the infinite grid. Inf. Process. Lett. 137: 51-56 (2018) - [i1]Adam S. Jobson, André E. Kézdy:
All minor-minimal apex obstructions with connectivity two. CoRR abs/1808.05940 (2018) - 2016
- [j23]Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White:
Detour trees. Discret. Appl. Math. 206: 73-80 (2016) - 2014
- [j22]Timothy M. Brauch, André E. Kézdy, Hunter S. Snevily:
The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs. Ars Comb. 114: 461-475 (2014) - [j21]Adam S. Jobson, André E. Kézdy, Susan C. White:
Connected matchings in chordal bipartite graphs. Discret. Optim. 14: 34-45 (2014)
2000 – 2009
- 2009
- [j20]André E. Kézdy, Hunter S. Snevily, Susan C. White:
Generalized Schur Numbers for x1 + x2 + c = 3x3. Electron. J. Comb. 16(1) (2009) - 2008
- [j19]Maria Axenovich, André E. Kézdy, Ryan R. Martin:
On the editing distance of graphs. J. Graph Theory 58(2): 123-138 (2008) - 2006
- [j18]András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Odd cycles and Theta-cycles in hypergraphs. Discret. Math. 306(19-20): 2481-2491 (2006) - [j17]André E. Kézdy:
rho-Valuations for some stunted trees. Discret. Math. 306(21): 2786-2789 (2006) - 2004
- [j16]André E. Kézdy, Hunter S. Snevily:
Polynomials that Vanish on Distinct nth Roots of Unity. Comb. Probab. Comput. 13(1): 37-59 (2004) - 2003
- [j15]André E. Kézdy, Jenö Lehel, Robert C. Powers:
Heavy Transversals and Indecomposable Hypergraphs. Comb. 23(2): 303-310 (2003) - 2002
- [j14]André E. Kézdy, Hunter S. Snevily:
Distinct Sums Modulo N And Tree Embeddings. Comb. Probab. Comput. 11(1): 35-42 (2002) - [j13]András Gyárfás, André E. Kézdy, Jenö Lehel:
A finite basis characterization of ?-split colorings. Discret. Math. 257(2-3): 415-421 (2002) - 2001
- [j12]André E. Kézdy, Matthew Scobee:
A proof of Hougardy's conjecture for diamond-free graphs. Discret. Math. 240(1-3): 83-95 (2001) - 2000
- [j11]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. Discret. Math. 219(1-3): 17-26 (2000)
1990 – 1999
- 1999
- [j10]Michael S. Jacobson, André E. Kézdy, Jeno Lehel:
Scenic graphs II: non-traceable graphs. Australas. J Comb. 19: 287- (1999) - [j9]André E. Kézdy, Chi Wang:
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. Discret. Math. 194(1-3): 261-265 (1999) - 1998
- [j8]Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Scenic Graphs I: Traceable Graphs. Ars Comb. 49 (1998) - [j7]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) - [j6]Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Tough enough chordal graphs are Hamiltonian. Networks 31(1): 29-38 (1998) - 1997
- [j5]Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. 13(4): 359-367 (1997) - [j4]André E. Kézdy, Hunter S. Snevily:
On Extensions of a Conjecture of Gallai. J. Comb. Theory B 70(2): 317-324 (1997) - 1996
- [j3]André E. Kézdy, Hunter S. Snevily, Chi Wang:
Partitioning Permutations into Increasing and Decreasing Subsequences. J. Comb. Theory A 73(2): 353-359 (1996) - 1995
- [j2]Michael S. Jacobson, André E. Kézdy, Douglas B. West:
The 2-intersection number of paths and bounded-degree trees. J. Graph Theory 19(4): 461-469 (1995) - 1992
- [c1]André E. Kézdy, Patrick McGuinness:
Sequential and Parallel Algorithms to Find a K5 Minor. SODA 1992: 345-356 - 1991
- [j1]André E. Kézdy, Patrick McGuinness:
Do 3n - 5 edges force a subdivision of K5? J. Graph Theory 15(4): 389-406 (1991)
Coauthor Index
aka: Jeno Lehel
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
