default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRicardo C. Corrêa
Person information
- affiliation: Federal Rural University of Rio de Janeiro, Nova Iguaçu, RJ, Brazil
- affiliation (former): Federal University of Ceará, Department of Computing, Fortaleza, CE, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Paulo Henrique Macêdo de Araújo
, Manoel B. Campêlo, Ricardo C. Corrêa, Martine Labbé:
Integer programming models and polyhedral study for the geodesic classification problem on graphs. Eur. J. Oper. Res. 314(3): 894-911 (2024)- 2023
- [j27]Paulo Henrique Macêdo de Araújo, Ricardo C. Corrêa, Manoel B. Campêlo:
A parallel lagrangian heuristic for the fractional chromatic number of a graph. RAIRO Oper. Res. 57(4): 1821-1841 (2023)
2010 – 2019
- 2019
- [j26]Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco:
On the combinatorics of the 2-class classification problem. Discret. Optim. 31: 40-55 (2019) - [c13]Paulo Henrique Macêdo de Araújo, Manoel B. Campêlo, Ricardo C. Corrêa, Martine Labbé:
The Geodesic Classification Problem on Graphs. LAGOS 2019: 65-76 - [c12]Ricardo C. Corrêa, Manuela Blaum, Javier Marenco, Ivo Koch, Marcelo Mydlarz:
An Integer Programming Approach for the 2-class Single-group Classification Problem. LAGOS 2019: 321-331 - 2018
- [j25]Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch, Javier Marenco:
General cut-generating procedures for the stable set polytope. Discret. Appl. Math. 245: 28-41 (2018) - [j24]Ricardo Cordeiro Corrêa, Carlos Hoppen, Rudini Menezes Sampaio:
Limits of k-dimensional poset sequences. Discret. Appl. Math. 245: 208-219 (2018) - [c11]Allberson Bruno de Oliveira Dantas, Ricardo C. Corrêa, Lucas B. de Vasconcelos:
MParCO: A Minimalist Parallel Framework for Combinatorial Optimization Applications. WSCAD 2018: 243-251 - 2017
- [j23]Ricardo C. Corrêa, Pablo Mayckon Silva Farias:
Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence. Theor. Comput. Sci. 661: 8-17 (2017) - [i9]Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco:
On the combinatorics of the 2-class classification problem. CoRR abs/1706.06214 (2017) - 2016
- [j22]Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Marcelo Mydlarz:
A polyhedral study of the maximum stable set problem with weights on vertex-subsets. Discret. Appl. Math. 210: 223-234 (2016) - 2015
- [j21]Manoel B. Campêlo, Ricardo C. Corrêa, Cláudia Linhares Sales, Rudini M. Sampaio:
Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium. Electron. Notes Discret. Math. 50: 1-2 (2015) - [j20]Ricardo C. Corrêa, Javier Marenco, Diego Delle Donne, Ivo Koch:
A Strengthened General Cut-Generating Procedure for the Stable Set Polytope. Electron. Notes Discret. Math. 50: 261-266 (2015) - [i8]Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Annegret Wagler:
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation. CoRR abs/1509.02485 (2015) - [i7]Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch, Javier Marenco:
General Cut-Generating Procedures for the Stable Set Polytope. CoRR abs/1512.08757 (2015) - 2014
- [i6]Ricardo C. Corrêa, Philippe Michelon, Bertrand Le Cun, Thierry Mautor, Diego Delle Donne:
A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph. CoRR abs/1407.1209 (2014) - 2013
- [j19]Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos:
On optimal k-fold colorings of webs and antiwebs. Discret. Appl. Math. 161(1-2): 60-70 (2013) - [j18]Pablo Mayckon Silva Farias, Ricardo C. Corrêa:
Linear time computation of the maximal sums of insertions into all positions of a sequence. Electron. Notes Discret. Math. 44: 245-250 (2013) - [j17]Ricardo C. Corrêa, Pablo Mayckon Silva Farias, Críston P. de Souza:
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence. J. Discrete Algorithms 21: 1-10 (2013) - [i5]Pablo Mayckon Silva Farias, Ricardo C. Corrêa:
Linear Time Computation of the Maximal (Circular) Sums of Multiple Independent Insertions of Numbers into a Sequence. CoRR abs/1307.1447 (2013) - 2012
- [c10]Paulo Henrique Lopes Silva, Gisele Azevedo de Araújo Freitas, Francisco Heron de Carvalho Junior, Ricardo C. Corrêa:
Connection Mechanisms of CCA Components for Parallel Applications. WSCAD-SSC 2012: 210-217 - [i4]Ricardo C. Corrêa, Pablo Mayckon Silva Farias, Críston P. de Souza:
Insertion and Sorting in a Sequence of Numbers Minimizing the Maximum Sum of a Contiguous Subsequence. CoRR abs/1210.5955 (2012) - 2011
- [j16]Ricardo C. Corrêa, Carlos Hoppen, Yoshiharu Kohayakawa, Rudini Menezes Sampaio:
A note on random k-dimensional posets. Electron. Notes Discret. Math. 37: 51-56 (2011) - [i3]Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos:
Optimal k-fold colorings of webs and antiwebs. CoRR abs/1108.5757 (2011) - 2010
- [j15]Manoel B. Campêlo, Ricardo C. Corrêa:
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems. Electron. Notes Discret. Math. 36: 503-510 (2010) - [c9]Francisco Heron de Carvalho Junior, Ricardo Cordeiro Corrêa:
The design of a CCA framework with distribution, parallelism, and recursive composition. GRID 2010: 339-348
2000 – 2009
- 2009
- [j14]Ricardo C. Corrêa, Frédéric Havet, Jean-Sébastien Sereni:
About a Brooks-type theorem for improper colouring. Australas. J Comb. 43: 219-230 (2009) - [j13]Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu:
Optimal gathering protocols on paths under interference constraints. Discret. Math. 309(18): 5574-5587 (2009) - [j12]Ricardo C. Corrêa, Valmir Carneiro Barbosa:
Partially ordered distributed computations on asynchronous point-to-point networks. Parallel Comput. 35(1): 12-28 (2009) - [i2]Manoel B. Campêlo, Ricardo C. Corrêa:
A Lagrangian Relaxation for the Maximum Stable Set Problem. CoRR abs/0903.1407 (2009) - 2008
- [j11]Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa:
On the asymmetric representatives formulation for the vertex coloring problem. Discret. Appl. Math. 156(7): 1097-1111 (2008) - 2007
- [j10]Francisco Heron de Carvalho Junior, Rafael Dueire Lins, Ricardo Cordeiro Corrêa, Gisele Azevedo Araújo:
Towards an architecture for component-oriented parallel programming. Concurr. Comput. Pract. Exp. 19(5): 697-719 (2007) - [c8]Francisco Heron de Carvalho Junior, Ricardo Cordeiro Corrêa, Gisele Azevedo Araújo, Jefferson de Carvalho Silva, Rafael Dueire Lins:
High-Level Service Connectors for Component-Based High Performance Computing. SBAC-PAD 2007: 237-244 - 2006
- [c7]Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu:
Gathering Algorithms on Paths Under Interference Constraints. CIAC 2006: 115-126 - [c6]Francisco Heron de Carvalho Junior, Rafael Dueire Lins, Ricardo Cordeiro Corrêa, Gisele Azevedo Araújo, Chanderlie Freire de Santiago:
Design and Implementation of an Environment for Component-Based Parallel Programming. VECPAR 2006: 184-197 - [i1]Ricardo C. Corrêa, Valmir Carneiro Barbosa:
Partially ordered distributed computations on asynchronous point-to-point networks. CoRR abs/cs/0611165 (2006) - 2005
- [j9]Ricardo C. Corrêa, Jayme Luiz Szwarcfiter:
On extensions, linear extensions, upsets and downsets of ordered sets. Discret. Math. 295(1-3): 13-30 (2005) - [j8]Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa:
On the asymmetric representatives formulation for the vertex coloring problem. Electron. Notes Discret. Math. 19: 337-343 (2005) - 2004
- [j7]Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota:
Cliques, holes and the vertex coloring polytope. Inf. Process. Lett. 89(4): 159-164 (2004) - 2003
- [j6]Ricardo C. Corrêa, Fernando de Carvalho Gomes, Carlos A. S. Oliveira, Panos M. Pardalos:
A parallel implementation of an asynchronous team to the point-to-point connection problem. Parallel Comput. 29(4): 447-466 (2003) - 2001
- [j5]Manoel B. Campêlo, Ricardo C. Corrêa, Nelson Maculan, Fábio Protti:
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors. Electron. Notes Discret. Math. 7: 166-169 (2001) - 2000
- [j4]Ricardo C. Corrêa, Jayme Luiz Szwarcfiter:
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). Electron. Notes Discret. Math. 5: 71-74 (2000) - [j3]Ricardo C. Corrêa:
A parallel approximation scheme for the multiprocessor scheduling problem. Parallel Comput. 26(1): 47-72 (2000)
1990 – 1999
- 1999
- [j2]Ricardo C. Corrêa, Afonso Ferreira, Pascal Rebreyend:
Scheduling Multiprocessor Tasks with Genetic Algorithms. IEEE Trans. Parallel Distributed Syst. 10(8): 825-837 (1999) - [c5]Ricardo C. Corrêa, Afonso Ferreira:
A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem. Euro-Par 1999: 272-279 - 1996
- [c4]Ricardo C. Corrêa, Afonso Ferreira:
Parallel best-first branch-and-bound in discrete optimization: a framework. Solving Combinatorial Optimization Problems in Parallel 1996: 171-200 - [c3]Ricardo C. Corrêa, Afonso Ferreira, Pascal Rebreyend:
Integrating list heuristics into genetic algorithms for multiprocessor scheduling. SPDP 1996: 462-469 - 1995
- [j1]Ricardo C. Corrêa, Afonso Ferreira:
On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms. Parallel Process. Lett. 5: 375-386 (1995) - [c2]Ricardo C. Corrêa:
A Parallel Formulatiion for General Branch-and-Bound Algorithms. IRREGULAR 1995: 395-409 - 1994
- [c1]Ricardo C. Corrêa, Afonso Ferreira:
Modeling Parallel Branch-and-Bound for Asynchronous Implementations. Parallel Processing of Discrete Optimization Problems 1994: 45-56
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 2025-03-04 21:06 CET 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:
