default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcelo Henriques de Carvalho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j28]Phelipe A. Fabres, Nishad Kothari
, Marcelo Henriques de Carvalho:
Minimal braces. J. Graph Theory 96(4): 490-509 (2021)- 2020
- [j27]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) - [j26]Nishad Kothari, Marcelo Henriques de Carvalho:
Generating simple near-bipartite bricks. J. Graph Theory 95(4): 594-637 (2020) - [j25]Marcelo Henriques de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin:
Birkhoff-von Neumann Graphs that are PM-Compact. SIAM J. Discret. Math. 34(3): 1769-1790 (2020)
2010 – 2019
- 2018
- [j24]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) - 2016
- [j23]Marcelo Henriques de Carvalho, C. H. C. Little:
A characterization of minimal non-Seymour graphs. Discret. Math. 339(2): 547-559 (2016) - [j22]Willian Paraguassu Amorim, Alexandre X. Falcão, João P. Papa, Marcelo Henriques de Carvalho:
Improving semi-supervised learning through optimum connectivity. Pattern Recognit. 60: 72-85 (2016) - 2015
- [j21]Cláudio Leonardo Lucchesi, Marcelo Henriques de Carvalho, Uppaluri S. R. Murty:
Thin Edges in Braces. Electron. J. Comb. 22(4): 4 (2015) - 2014
- [j20]Marcelo Henriques de Carvalho, Charles H. C. Little:
Matching Covered Graphs with Three Removable Classes. Electron. J. Comb. 21(2): 2 (2014) - [j19]Marcelo Henriques de Carvalho, Charles H. C. Little:
The Parity of a Thicket. Electron. J. Comb. 21(2): 2 (2014) - [j18]Xiumei Wang, Weiping Shang, Yixun Lin, Marcelo Henriques de Carvalho:
A Characterization of PM-Compact claw-Free cubic graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - [c5]Priscila T. M. Saito, Willian Paraguassu Amorim, Alexandre X. Falcão, Pedro Jussieu de Rezende, Celso T. N. Suzuki, Jancarlo F. Gomes, Marcelo Henriques de Carvalho:
Active Semi-supervised Learning Using Optimum-Path Forest. ICPR 2014: 3798-3803 - [c4]Willian Paraguassu Amorim, Alexandre Xavier Falcão, Marcelo Henriques de Carvalho:
Semi-supervised Pattern Classification Using Optimum-Path Forest. SIBGRAPI 2014: 111-118 - 2013
- [j17]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) - [j16]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) - [c3]Willian Paraguassu Amorim, Marcelo Henriques de Carvalho, Valguima Victoria Viana Aguiar Odakura:
Face Recognition Using Optimum-Path Forest Local Analysis. BRACIS 2013: 242-248 - 2012
- [j15]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
A generalization of Little's Theorem on Pfaffian orientations. J. Comb. Theory B 102(6): 1241-1266 (2012) - [c2]Willian Paraguassu Amorim, Marcelo Henriques de Carvalho:
Supervised Learning Using Local Analysis in an Optimal-Path Forest. SIBGRAPI 2012: 330-335 - 2011
- [j14]Luciano L. Silveira, Marcelo Henriques de Carvalho:
Ear decompositions of join covered graphs. Electron. Notes Discret. Math. 37: 171-176 (2011)
2000 – 2009
- 2009
- [j13]Marcelo Henriques de Carvalho, C. H. C. Little:
Circuit decompositions of join-covered graphs. J. Graph Theory 62(3): 220-233 (2009) - 2008
- [j12]Marcelo Henriques de Carvalho, C. H. C. Little:
Vector Spaces and the Petersen Graph. Electron. J. Comb. 15(1) (2008) - [j11]Marcelo Henriques de Carvalho, C. H. C. Little:
Ear Decompositions in Combed Graphs. Electron. J. Comb. 15(1) (2008) - 2006
- [j10]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
How to build a brick. Discret. Math. 306(19-20): 2383-2410 (2006) - 2005
- [j9]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) - [j8]Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
Graphs with independent perfect matchings. J. Graph Theory 48(1): 19-50 (2005) - [j7]Marcelo Henriques de Carvalho, Joseph Cheriyan:
An O(VE) algorithm for ear decompositions of matching-covered graphs. ACM Trans. Algorithms 1(2): 324-337 (2005) - [c1]Marcelo Henriques de Carvalho, Joseph Cheriyan:
An O(VE) algorithm for ear decompositions of matching-covered graphs. SODA 2005: 415-423 - 2004
- [j6]Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
The perfect matching polytope and solid bricks. J. Comb. Theory B 92(2): 319-324 (2004) - 2002
- [j5]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 B 85(1): 59-93 (2002) - [j4]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 B 85(1): 94-136 (2002) - [j3]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 B 85(1): 137-180 (2002)
1990 – 1999
- 1999
- [j2]Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty:
Ear Decompositions of Matching Covered Graphs. Comb. 19(2): 151-174 (1999) - 1996
- [j1]Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi:
Matching Covered Graphs and Subdivisions ofK4and[formula]. J. Comb. Theory B 66(2): 263-268 (1996)
Coauthor Index
aka: Cláudio Leonardo Lucchesi
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 21:19 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:
