Ricardo C. Corrêa

According to our database1, Ricardo C. Corrêa authored at least 42 papers between 1994 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


An Integer Programming Approach for the 2-class Single-group Classification Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

The Geodesic Classification Problem on Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the combinatorics of the 2-class classification problem.
Discret. Optim., 2019

Limits of k-dimensional poset sequences.
Discret. Appl. Math., 2018

General cut-generating procedures for the stable set polytope.
Discret. Appl. Math., 2018

MParCO: A Minimalist Parallel Framework for Combinatorial Optimization Applications.
Proceedings of the Symposium on High Performance Computing Systems, 2018

Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence.
Theor. Comput. Sci., 2017

A polyhedral study of the maximum stable set problem with weights on vertex-subsets.
Discret. Appl. Math., 2016

A Strengthened General Cut-Generating Procedure for the Stable Set Polytope.
Electron. Notes Discret. Math., 2015

Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium.
Electron. Notes Discret. Math., 2015

Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation.
CoRR, 2015

A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph.
CoRR, 2014

Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence.
J. Discrete Algorithms, 2013

Linear time computation of the maximal sums of insertions into all positions of a sequence.
Electron. Notes Discret. Math., 2013

On optimal k-fold colorings of webs and antiwebs.
Discret. Appl. Math., 2013

Linear Time Computation of the Maximal (Circular) Sums of Multiple Independent Insertions of Numbers into a Sequence.
CoRR, 2013

Connection Mechanisms of CCA Components for Parallel Applications.
Proceedings of the 13th Symposium on Computer Systems, 2012

A note on random k-dimensional posets.
Electron. Notes Discret. Math., 2011

A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems.
Electron. Notes Discret. Math., 2010

The design of a CCA framework with distribution, parallelism, and recursive composition.
Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, 2010

Partially ordered distributed computations on asynchronous point-to-point networks.
Parallel Comput., 2009

Optimal gathering protocols on paths under interference constraints.
Discret. Math., 2009

A Lagrangian Relaxation for the Maximum Stable Set Problem
CoRR, 2009

About a Brooks-type theorem for improper colouring.
Australas. J Comb., 2009

Towards an architecture for component-oriented parallel programming.
Concurr. Comput. Pract. Exp., 2007

High-Level Service Connectors for Component-Based High Performance Computing.
Proceedings of the 19th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2007), 2007

Design and Implementation of an Environment for Component-Based Parallel Programming.
Proceedings of the High Performance Computing for Computational Science, 2006

Gathering Algorithms on Paths Under Interference Constraints.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

On the asymmetric representatives formulation for the vertex coloring problem.
Electron. Notes Discret. Math., 2005

On extensions, linear extensions, upsets and downsets of ordered sets.
Discret. Math., 2005

Cliques, holes and the vertex coloring polytope.
Inf. Process. Lett., 2004

A parallel implementation of an asynchronous team to the point-to-point connection problem.
Parallel Comput., 2003

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors.
Electron. Notes Discret. Math., 2001

A parallel approximation scheme for the multiprocessor scheduling problem.
Parallel Comput., 2000

On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract).
Electron. Notes Discret. Math., 2000

Scheduling Multiprocessor Tasks with Genetic Algorithms.
IEEE Trans. Parallel Distributed Syst., 1999

A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

Integrating list heuristics into genetic algorithms for multiprocessor scheduling.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Parallel best-first branch-and-bound in discrete optimization: a framework.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms.
Parallel Process. Lett., 1995

A Parallel Formulatiion for General Branch-and-Bound Algorithms.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

Modeling Parallel Branch-and-Bound for Asynchronous Implementations.
Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994