![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Renato Carmo
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes, Raphael C. S. Machado, Celina M. H. de Figueiredo:
The hardness of recognising poorly matchable graphs and the hunting of the d-snark. RAIRO Oper. Res. 58(3): 2055-2073 (2024) - 2020
- [j6]Leandro M. Zatesko, Alesom Zorzi, Renato Carmo, André Luiz Pires Guedes
:
Edge-colouring graphs with bounded local degree sums. Discret. Appl. Math. 281: 268-283 (2020)
2010 – 2019
- 2018
- [j5]Alexandre Prusch Züge, Renato Carmo:
On comparing algorithms for the maximum clique problem. Discret. Appl. Math. 247: 1-13 (2018) - [j4]Alane Marie de Lima, Renato Carmo:
Exact Algorithms for the Graph Coloring Problem. RITA 25(4): 57-73 (2018) - [c6]Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes
:
Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs. ICORES 2018: 247-253 - 2012
- [j3]Renato Carmo, Alexandre Prusch Züge:
Branch and bound algorithms for the maximum clique problem under a unified framework. J. Braz. Comput. Soc. 18(2): 137-151 (2012) - [c5]Renato Carmo, Roberto A. Hexsel:
Unpopular Addresses Should Not Pollute the Cache. WSCAD-SSC 2012: 95-102 - 2011
- [c4]Jaime Cohen, Luiz A. Rodrigues, Fabiano Silva
, Renato Carmo, André Luiz Pires Guedes
, Elias P. Duarte Jr.:
Parallel Implementations of Gusfield's Cut Tree Algorithm. ICA3PP (1) 2011: 258-269 - 2010
- [c3]Elias P. Duarte Jr., Thiago Garrett
, Luis C. E. Bona
, Renato Carmo, Alexandre Prusch Züge:
Finding stable cliques of PlanetLab nodes. DSN 2010: 317-322
2000 – 2009
- 2007
- [j2]Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas:
Querying priced information in databases: The conjunctive case. ACM Trans. Algorithms 3(1): 9:1-9:22 (2007) - 2004
- [j1]Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa
, Eduardo Sany Laber:
Searching in random partially ordered sets. Theor. Comput. Sci. 321(1): 41-57 (2004) - [c2]Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohayakawa
:
Querying Priced Information in Databases: The Conjunctive Case. LATIN 2004: 6-15 - 2002
- [c1]Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa
, Eduardo Sany Laber:
Searching in Random Partially Ordered Sets. LATIN 2002: 278-292
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-12 22:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint