The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

André E. Kézdy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002