Modeling Parallel Branch-and-Bound for Asynchronous Implementations. - Ricardo C. Corrêa; Afonso Ferreira (Parallel Processing of Discrete Optimization Problems, 1994)

A Parallel Formulatiion for General Branch-and-Bound Algorithms. - Ricardo C. Corrêa (IRREGULAR, 1995)

On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms. - Ricardo C. Corrêa; Afonso Ferreira (Parallel Process. Lett., 1995)

Parallel best-first branch-and-bound in discrete optimization: a framework. - Ricardo C. Corrêa; Afonso Ferreira (Solving Combinatorial Optimization Problems in Parallel, 1996)

Integrating list heuristics into genetic algorithms for multiprocessor scheduling. - Ricardo C. Corrêa; Afonso Ferreira; Pascal Rebreyend (SPDP, 1996)

A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem. - Ricardo C. Corrêa; Afonso Ferreira (Euro-Par, 1999)

Scheduling Multiprocessor Tasks with Genetic Algorithms. - Ricardo C. Corrêa; Afonso Ferreira; Pascal Rebreyend (IEEE Trans. Parallel Distributed Syst., 1999)

On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract). - Ricardo C. Corrêa; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2000)

A parallel approximation scheme for the multiprocessor scheduling problem. - Ricardo C. Corrêa (Parallel Comput., 2000)

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors. - Manoel B. Campêlo; Ricardo C. Corrêa; Nelson Maculan; Fábio Protti (Electron. Notes Discret. Math., 2001)

A parallel implementation of an asynchronous team to the point-to-point connection problem. - Ricardo C. Corrêa; Fernando de Carvalho Gomes; Carlos A. S. Oliveira; Panos M. Pardalos (Parallel Comput., 2003)

Cliques, holes and the vertex coloring polytope. - Manoel B. Campêlo; Ricardo C. Corrêa; Yuri Frota (Inf. Process. Lett., 2004)

On extensions, linear extensions, upsets and downsets of ordered sets. - Ricardo C. Corrêa; Jayme Luiz Szwarcfiter (Discret. Math., 2005)

Gathering Algorithms on Paths Under Interference Constraints. - Jean-Claude Bermond; Ricardo C. Corrêa; Min-Li Yu (CIAC, 2006)

Design and Implementation of an Environment for Component-Based Parallel Programming. - Francisco Heron de Carvalho Junior; Rafael Dueire Lins; Ricardo Cordeiro Corrêa; Gisele Azevedo Araújo; Chanderlie Freire de Santiago (VECPAR, 2006)

High-Level Service Connectors for Component-Based High Performance Computing. - Francisco Heron de Carvalho Junior; Ricardo Cordeiro Corrêa; Gisele Azevedo Araújo; Jefferson de Carvalho Silva; Rafael Dueire Lins (SBAC-PAD, 2007)

Towards an architecture for component-oriented parallel programming. - Francisco Heron de Carvalho Junior; Rafael Dueire Lins; Ricardo Cordeiro Corrêa; Gisele Azevedo Araújo (Concurr. Comput. Pract. Exp., 2007)

On the asymmetric representatives formulation for the vertex coloring problem. - Manoel B. Campêlo; Victor A. Campos; Ricardo C. Corrêa (Discret. Appl. Math., 2008)

About a Brooks-type theorem for improper colouring. - Ricardo C. Corrêa; Frédéric Havet; Jean-Sébastien Sereni (Australas. J Comb., 2009)

A Lagrangian Relaxation for the Maximum Stable Set Problem - Manoel B. Campêlo; Ricardo C. Corrêa (CoRR, 2009)

Optimal gathering protocols on paths under interference constraints. - Jean-Claude Bermond; Ricardo C. Corrêa; Min-Li Yu (Discret. Math., 2009)

Partially ordered distributed computations on asynchronous point-to-point networks. - Ricardo C. Corrêa; Valmir Carneiro Barbosa (Parallel Comput., 2009)

The design of a CCA framework with distribution, parallelism, and recursive composition. - Francisco Heron de Carvalho Junior; Ricardo Cordeiro Corrêa (GRID, 2010)

A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems. - Manoel B. Campêlo; Ricardo C. Corrêa (Electron. Notes Discret. Math., 2010)

A note on random k-dimensional posets. - Ricardo C. Corrêa; Carlos Hoppen; Yoshiharu Kohayakawa; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2011)

Connection Mechanisms of CCA Components for Parallel Applications. - Paulo Henrique Lopes Silva; Gisele Azevedo de Araújo Freitas; Francisco Heron de Carvalho Junior; Ricardo C. Corrêa (WSCAD-SSC, 2012)

Linear Time Computation of the Maximal (Circular) Sums of Multiple Independent Insertions of Numbers into a Sequence. - Pablo Mayckon Silva Farias; Ricardo C. Corrêa (CoRR, 2013)

On optimal k-fold colorings of webs and antiwebs. - Manoel B. Campêlo; Ricardo C. Corrêa; Phablo F. S. Moura; Marcio Costa Santos (Discret. Appl. Math., 2013)

Linear time computation of the maximal sums of insertions into all positions of a sequence. - Pablo Mayckon Silva Farias; Ricardo C. Corrêa (Electron. Notes Discret. Math., 2013)

Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence. - Ricardo C. Corrêa; Pablo Mayckon Silva Farias; Críston P. de Souza (J. Discrete Algorithms, 2013)

A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph. - Ricardo C. Corrêa; Philippe Michelon; Bertrand Le Cun; Thierry Mautor; Diego Delle Donne (CoRR, 2014)

Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation. - Victor A. Campos; Ricardo C. Corrêa; Diego Delle Donne; Javier Marenco; Annegret Wagler (CoRR, 2015)

Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium. - Manoel B. Campêlo; Ricardo C. Corrêa; Cláudia Linhares Sales; Rudini M. Sampaio (Electron. Notes Discret. Math., 2015)

A Strengthened General Cut-Generating Procedure for the Stable Set Polytope. - Ricardo C. Corrêa; Javier Marenco; Diego Delle Donne; Ivo Koch (Electron. Notes Discret. Math., 2015)

A polyhedral study of the maximum stable set problem with weights on vertex-subsets. - Manoel B. Campêlo; Victor A. Campos; Ricardo C. Corrêa; Diego Delle Donne; Javier Marenco; Marcelo Mydlarz (Discret. Appl. Math., 2016)

Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence. - Ricardo C. Corrêa; Pablo Mayckon Silva Farias (Theor. Comput. Sci., 2017)

MParCO: A Minimalist Parallel Framework for Combinatorial Optimization Applications. - Allberson Bruno de Oliveira Dantas; Ricardo C. Corrêa; Lucas B. de Vasconcelos (WSCAD, 2018)

General cut-generating procedures for the stable set polytope. - Ricardo C. Corrêa; Diego Delle Donne; Ivo Koch; Javier Marenco (Discret. Appl. Math., 2018)

Limits of k-dimensional poset sequences. - Ricardo Cordeiro Corrêa; Carlos Hoppen; Rudini Menezes Sampaio (Discret. Appl. Math., 2018)

On the combinatorics of the 2-class classification problem. - Ricardo C. Corrêa; Diego Delle Donne; Javier Marenco (Discret. Optim., 2019)

The Geodesic Classification Problem on Graphs. - Paulo Henrique Macêdo de Araújo; Manoel B. Campêlo; Ricardo C. Corrêa; Martine Labbé (LAGOS, 2019)

An Integer Programming Approach for the 2-class Single-group Classification Problem. - Ricardo C. Corrêa; Manuela Blaum; Javier Marenco; Ivo Koch; Marcelo Mydlarz (LAGOS, 2019)

A parallel lagrangian heuristic for the fractional chromatic number of a graph. - Paulo Henrique Macêdo de Araújo; Ricardo C. Corrêa; Manoel B. Campêlo (RAIRO Oper. Res., 2023)

Integer programming models and polyhedral study for the geodesic classification problem on graphs. - Paulo Henrique Macêdo de Araújo; Manoel B. Campêlo; Ricardo C. Corrêa; Martine Labbé (Eur. J. Oper. Res., 2024)