The SCEAS System
Navigation Menu

Search the dblp DataBase


Claudio L. Lucchesi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Claudio L. Lucchesi, Sylvia L. Osborn
    Candidate Keys for Relations. [Citation Graph (10, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:17, n:2, pp:270-279 [Journal]
  2. Claudio L. Lucchesi, Tomasz Kowaltowski
    Applications of Finite Automata Representing Large Vocabularies. [Citation Graph (1, 0)][DBLP]
    Softw., Pract. Exper., 1993, v:23, n:1, pp:15-30 [Journal]
  3. Jaime Cohen, Claudio L. Lucchesi
    Minimax relations for T-join packing problems. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:38-44 [Conf]
  4. Claudio L. Lucchesi, Maria Cecilia M. T. Giglio
    On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  5. Marcelo H. de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty
    How to build a brick. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2383-2410 [Journal]
  6. Claudio L. Lucchesi
    Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2001, v:7, n:3, pp:9-22 [Journal]
  7. Marcelo H. de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty
    Graphs with independent perfect matchings. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:1, pp:19-50 [Journal]
  8. Claudio L. Lucchesi, Jeffrey A. Ross
    Superfluous paths in strong digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:267-273 [Journal]

  9. A lower bound on the number of removable ears of 1-extendable graphs. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002