| Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence. | 0 | 0.34 | 2017 |
| A polyhedral study of the maximum stable set problem with weights on vertex-subsets | 0 | 0.34 | 2016 |
| Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation | 1 | 0.36 | 2015 |
| Preface – VIII Latin-american Algorithms, Graphs and Optimization Symposium | 0 | 0.34 | 2015 |
| A Strengthened General Cut-Generating Procedure for the Stable Set Polytope | 0 | 0.34 | 2015 |
| A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph. | 2 | 0.40 | 2014 |
| On optimal k-fold colorings of webs and antiwebs | 3 | 0.42 | 2013 |
| Linear Time Computation of the Maximal (Circular) Sums of Multiple Independent Insertions of Numbers into a Sequence. | 0 | 0.34 | 2013 |
| Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence | 3 | 0.48 | 2013 |
| Linear time computation of the maximal sums of insertions into all positions of a sequence. | 1 | 0.35 | 2013 |
| A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems | 1 | 0.36 | 2010 |
| Partially ordered distributed computations on asynchronous point-to-point networks | 2 | 0.42 | 2009 |
| Optimal gathering protocols on paths under interference constraints | 10 | 0.64 | 2009 |
| A Lagrangian Relaxation for the Maximum Stable Set Problem | 2 | 0.40 | 2009 |
| On the asymmetric representatives formulation for the vertex coloring problem | 46 | 1.91 | 2008 |
| On extensions, linear extensions, upsets and downsets of ordered sets | 1 | 0.36 | 2005 |
| Cliques, holes and the vertex coloring polytope | 33 | 1.92 | 2004 |
| A parallel implementation of an asynchronous team to the point-to-point connection problem | 9 | 0.61 | 2003 |
| ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors | 0 | 0.34 | 2001 |
| A parallel approximation scheme for the multiprocessor scheduling problem | 2 | 0.37 | 2000 |
| A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem | 2 | 0.40 | 1999 |
| Scheduling Multiprocessor Tasks with Genetic Algorithms | 55 | 2.76 | 1999 |
| Integrating list heuristics into genetic algorithms for multiprocessor scheduling. | 16 | 2.14 | 1996 |
| Parallel best-first branch-and-bound in discrete optimization: a framework | 9 | 0.92 | 1996 |
| A Parallel Formulatiion for General Branch-and-Bound Algorithms | 2 | 0.55 | 1995 |
| On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms | 4 | 0.49 | 1995 |
| Modeling Parallel Branch-and-Bound for Asynchronoous Implementations. | 3 | 0.45 | 1994 |
