 | 2011 |
|---|
| 20 |       | Manoel B. Campêlo,
Ricardo C. Corrêa,
Phablo F. S. Moura,
Marcio C. Santos:
Optimal k-fold colorings of webs and antiwebs
CoRR abs/1108.5757: (2011) |
| 2010 |
|---|
| 19 | | Manoel B. Campêlo,
Ricardo C. Corrêa:
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems.
Electronic Notes in Discrete Mathematics 36: 503-510 (2010) |
| 2009 |
|---|
| 18 | | Manoel B. Campêlo,
Ricardo C. Corrêa:
A Lagrangian Relaxation for the Maximum Stable Set Problem
CoRR abs/0903.1407: (2009) |
| 17 | | Jean-Claude Bermond,
Ricardo C. Corrêa,
Min-Li Yu:
Optimal gathering protocols on paths under interference constraints.
Discrete Mathematics 309(18): 5574-5587 (2009) |
| 16 | | Ricardo C. Corrêa,
Valmir C. Barbosa:
Partially ordered distributed computations on asynchronous point-to-point networks.
Parallel Computing 35(1): 12-28 (2009) |
| 2008 |
|---|
| 15 | | Manoel B. Campêlo,
Victor A. Campos,
Ricardo C. Corrêa:
On the asymmetric representatives formulation for the vertex coloring problem.
Discrete Applied Mathematics 156(7): 1097-1111 (2008) |
| 2006 |
|---|
| 14 | | Jean-Claude Bermond,
Ricardo C. Corrêa,
Min-Li Yu:
Gathering Algorithms on Paths Under Interference Constraints.
CIAC 2006: 115-126 |
| 13 | | Ricardo C. Corrêa,
Valmir C. Barbosa:
Partially ordered distributed computations on asynchronous point-to-point networks
CoRR abs/cs/0611165: (2006) |
| 2005 |
|---|
| 12 | | Ricardo C. Corrêa,
Jayme Luiz Szwarcfiter:
On extensions, linear extensions, upsets and downsets of ordered sets.
Discrete Mathematics 295(1-3): 13-30 (2005) |
| 11 | | Manoel B. Campêlo,
Victor A. Campos,
Ricardo C. Corrêa:
On the asymmetric representatives formulation for the vertex coloring problem.
Electronic Notes in Discrete Mathematics 19: 337-343 (2005) |
| 2004 |
|---|
| 10 | | 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 |
|---|
| 9 | | 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 Computing 29(4): 447-466 (2003) |
| 2001 |
|---|
| 8 | | 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.
Electronic Notes in Discrete Mathematics 7: 166-169 (2001) |
| 2000 |
|---|
| 7 | | Ricardo C. Corrêa,
Jayme Luiz Szwarcfiter:
On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract).
Electronic Notes in Discrete Mathematics 5: 71-74 (2000) |
| 6 | | Ricardo C. Corrêa:
A parallel approximation scheme for the multiprocessor scheduling problem.
Parallel Computing 26(1): 47-72 (2000) |
| 1999 |
|---|
| 5 | | Ricardo C. Corrêa,
Afonso Ferreira:
A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem.
Euro-Par 1999: 272-279 |
| 4 | | Ricardo C. Corrêa,
Afonso Ferreira,
Pascal Rebreyend:
Scheduling Multiprocessor Tasks with Genetic Algorithms.
IEEE Trans. Parallel Distrib. Syst. 10(8): 825-837 (1999) |
| 1996 |
|---|
| 3 | | 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 |
| 1995 |
|---|
| 2 | | Ricardo C. Corrêa:
A Parallel Formulatiion for General Branch-and-Bound Algorithms.
IRREGULAR 1995: 395-409 |
| 1 |  | Ricardo C. Corrêa,
Afonso Ferreira:
On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms.
Parallel Processing Letters 5: 375-386 (1995) |
Data released under the ODC-BY 1.0 license — See also our legal information page