Claudio L. Lucchesi Home Page Coauthor index DBLP Vis pubzone.org

Cláudio Leonardo Lucchesi

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCândida Nunes da Silva, Cláudio Leonardo Lucchesi: Flow-Critical Graphs. Electronic Notes in Discrete Mathematics 30: 165-170 (2008)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi: A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs. Electronic Notes in Discrete Mathematics 30: 171-176 (2008)
2006
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty: How to build a brick. Discrete Mathematics 306(19-20): 2383-2410 (2006)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito: A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory, Ser. B 96(3): 315-324 (2006)
2005
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty: On the number of dissimilar pfaffian orientations of graphs. ITA 39(1): 93-113 (2005)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty: Graphs with independent perfect matchings. Journal of Graph Theory 48(1): 19-50 (2005)
2004
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty: The perfect matching polytope and solid bricks. J. Comb. Theory, Ser. B 92(2): 319-324 (2004)
2002
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty: On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic. J. Comb. Theory, Ser. B 85(1): 137-180 (2002)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty: Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice. J. Comb. Theory, Ser. B 85(1): 59-93 (2002)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty: On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph. J. Comb. Theory, Ser. B 85(1): 94-136 (2002)
2001
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClaudio L. Lucchesi: Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science. J. Braz. Comp. Soc. 7(3): 9-22 (2001)
1999
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty: Ear Decompositions of Matching Covered Graphs. Combinatorica 19(2): 151-174 (1999)
1998
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClaudio L. Lucchesi, Arnaldo V. Moura: LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings Springer 1998
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter: On clique-complete graphs. Discrete Mathematics 183(1-3): 247-254 (1998)
1997
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJaime Cohen, Claudio L. Lucchesi: Minimax relations for T-join packing problems. ISTCS 1997: 38-44
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClaudio L. Lucchesi, Maria Cecilia M. T. Giglio: On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem. Ars Comb. 47: (1997)
1996
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcelo H. de Carvalho, Cláudio Leonardo Lucchesi: Matching Covered Graphs and Subdivisions ofK4and[formula]. J. Comb. Theory, Ser. B 66(2): 263-268 (1996)
1993
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClaudio L. Lucchesi, Tomasz Kowaltowski: Applications of Finite Automata Representing Large Vocabularies. Softw., Pract. Exper. 23(1): 15-30 (1993)
1983
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClaudio L. Lucchesi, Jeffrey A. Ross: Superfluous paths in strong digraphs. Discrete Mathematics 47: 267-273 (1983)
1978
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClaudio L. Lucchesi, Sylvia L. Osborn: Candidate Keys for Relations. J. Comput. Syst. Sci. 17(2): 270-279 (1978)

Coauthor Index

1Marcelo H. de Carvalho [4] [9] [11] [12] [13] [14] [15] [16] [18]
2Jaime Cohen [6]
3Shinya Fujita [17]
4Maria Cecilia M. T. Giglio [5]
5Ken-ichi Kawarabayashi [17]
6Tomasz Kowaltowski [3]
7Célia Picinin de Mello [7]
8Alberto Alexandre Assis Miranda [19]
9Arnaldo V. Moura [8]
10Uppaluri S. R. Murty [9] [11] [12] [13] [14] [15] [16] [18]
11Sylvia L. Osborn [1]
12Katsuhiro Ota [17]
13Michael D. Plummer [17]
14Jeffrey A. Ross [2]
15Akira Saito [17]
16Cândida Nunes da Silva [20]
17Jayme Luiz Szwarcfiter [7]

Colors in the list of coauthors

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)