Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudio L. Lucchesi
Person information
- affiliation: University of Campinas, Sao Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j33]Guantao Chen, Xing Feng, Fuliang Lu, Cláudio Leonardo Lucchesi, Lianzhu Zhang:
Laminar tight cuts in matching covered graphs. J. Comb. Theory, Ser. B 150: 177-194 (2021)- 2020
- [j32]Nishad Kothari
, Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Charles H. C. Little:
On Essentially 4-Edge-Connected Cubic Bricks. Electron. J. Comb. 27(1): 1 (2020) - 2018
- [j31]Claudio L. Lucchesi, Marcelo Henriques de Carvalho, Nishad Kothari, Uppaluri S. R. Murty:
On Two Unsolved Problems Concerning Matching Covered Graphs. SIAM J. Discret. Math. 32(2): 1478-1504 (2018) - 2015
- [j30]Cláudio Leonardo Lucchesi, Marcelo Henriques de Carvalho, Uppaluri S. R. Murty:
Thin Edges in Braces. Electron. J. Comb. 22(4): 4 (2015) - [j29]Breno Lima de Freitas, Cândida Nunes da Silva, Cláudio Leonardo Lucchesi:
Hypohamiltonian Snarks Have a 5-Flow. Electron. Notes Discret. Math. 50: 199-204 (2015) - 2014
- [j28]Cândida Nunes da Silva, Claudio L. Lucchesi:
3-Flows and Combs. J. Graph Theory 77(4): 260-277 (2014) - 2013
- [j27]Xiumei Wang, Yixun Lin, Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little:
A characterization of PM-compact bipartite and near-bipartite graphs. Discret. Math. 313(6): 772-783 (2013) - [j26]Cândida Nunes da Silva, Lissa Pesci, Claudio L. Lucchesi:
Snarks and Flow-Critical Graphs. Electron. Notes Discret. Math. 44: 299-305 (2013) - [j25]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
On the Number of Perfect Matchings in a Bipartite Graph. SIAM J. Discret. Math. 27(2): 940-958 (2013) - 2012
- [j24]Cláudio Leonardo Lucchesi:
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science. J. Braz. Comput. Soc. 18(2): 153-165 (2012) - [j23]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
A generalization of Little's Theorem on Pfaffian orientations. J. Comb. Theory, Ser. B 102(6): 1241-1266 (2012) - 2011
- [j22]Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi:
Matching signatures and Pfaffian graphs. Discret. Math. 311(4): 289-294 (2011) - 2010
- [j21]Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi:
Recognizing near-bipartite Pfaffian graphs in polynomial time. Discret. Appl. Math. 158(12): 1275-1278 (2010) - [j20]Shaohui Zhai, Claudio L. Lucchesi, Xiaofeng Guo:
A lower bound on the number of removable ears of 1-extendable graphs. Discret. Math. 310(5): 1123-1126 (2010) - 2009
- [j19]Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi:
On the Pfaffian Number of Graphs. Electron. Notes Discret. Math. 35: 145-150 (2009) - 2008
- [j18]Cândida Nunes da Silva, Cláudio Leonardo Lucchesi:
Flow-Critical Graphs. Electron. Notes Discret. Math. 30: 165-170 (2008) - [j17]Alberto Alexandre Assis Miranda, Cláudio Leonardo Lucchesi:
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs. Electron. Notes Discret. Math. 30: 171-176 (2008) - 2006
- [j16]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
How to build a brick. Discret. Math. 306(19-20): 2383-2410 (2006) - [j15]Shinya 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
- [j14]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
On the number of dissimilar pfaffian orientations of graphs. RAIRO Theor. Informatics Appl. 39(1): 93-113 (2005) - [j13]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
Graphs with independent perfect matchings. J. Graph Theory 48(1): 19-50 (2005) - 2004
- [j12]Marcelo Henriques 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
- [j11]Marcelo Henriques 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) - [j10]Marcelo Henriques 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) - [j9]Marcelo Henriques 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) - 2001
- [j8]Claudio L. Lucchesi:
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science. J. Braz. Comput. Soc. 7(3): 9-22 (2001) - 1999
- [j7]Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
Ear Decompositions of Matching Covered Graphs. Comb. 19(2): 151-174 (1999) - 1998
- [j6]Cláudio Leonardo Lucchesi, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
On clique-complete graphs. Discret. Math. 183(1-3): 247-254 (1998) - 1997
- [j5]Claudio 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
- [j4]Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi:
Matching Covered Graphs and Subdivisions ofK4and[formula]. J. Comb. Theory, Ser. B 66(2): 263-268 (1996) - 1993
- [j3]Claudio L. Lucchesi, Tomasz Kowaltowski:
Applications of Finite Automata Representing Large Vocabularies. Softw. Pract. Exp. 23(1): 15-30 (1993) - 1983
- [j2]Claudio L. Lucchesi, Jeffrey A. Ross:
Superfluous paths in strong digraphs. Discret. Math. 47: 267-273 (1983) - 1978
- [j1]Claudio L. Lucchesi, Sylvia L. Osborn:
Candidate Keys for Relations. J. Comput. Syst. Sci. 17(2): 270-279 (1978)
Conference and Workshop Papers
- 2017
- [c2]Ahcène Boubekki, Ulf Brefeld, Cláudio Leonardo Lucchesi, Wolfgang Stille:
Propagating Maximum Capacities for Recommendation. KI 2017: 72-84 - 1997
- [c1]Jaime Cohen, Claudio L. Lucchesi:
Minimax relations for T-join packing problems. ISTCS 1997: 38-44
Editorship
- 1998
- [e1]Claudio L. Lucchesi, Arnaldo V. Moura:
LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings. Lecture Notes in Computer Science 1380, Springer 1998, ISBN 3-540-64275-7 [contents]
Coauthor Index
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-05-02 23:47 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:
