10 citations · 35 across the 8 of their papers we have counts for
9 papers
On the combinatorics of the 2-class classification problem
Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco
A set of points is linearly separable if the convex hulls of and are disjoint, hence there exists a hyperplane separating $X_B…
General Cut-Generating Procedures for the Stable Set Polytope
Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch +1
We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and…
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation
Victor Campos, Ricardo C. Corrêa, Diego Delle Donne +2
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of vi…
A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph
Ricardo C. Corrêa, Philippe Michelon, Bertrand Le Cun +2
Finding the clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated studies to solve it exactly despite its diffic…
Linear Time Computation of the Maximal Linear and Circular Sums of Multiple Independent Insertions into a Sequence
Ricardo C. Corrêa, Pablo M. S. Farias
The maximal sum of a sequence "A" of "n" real numbers is the greatest sum of all elements of any strictly contiguous and possibly empty subsequence of "A", and it can be computed i…
Insertion and Sorting in a Sequence of Numbers Minimizing the Maximum Sum of a Contiguous Subsequence
Ricardo C. Corrêa, Pablo M. S. Farias, Críston P. de Souza
Let be a sequence of real numbers. A subsequence of is a sequence of contiguous elements of . A \emph{maximum scoring subsequence} of is a subsequence wit…