| 2008 |
|---|
| 22 | EE | José R. Correa,
Marcos A. Kiwi:
Foreword.
Algorithmica 50(4): 415-417 (2008) |
| 21 | EE | José R. Correa,
Leah Epstein:
Bin packing with controllable item sizes.
Inf. Comput. 206(8): 1003-1016 (2008) |
| 20 | EE | José R. Correa,
Martín Matamala:
Some remarks about factors of graphs.
Journal of Graph Theory 57(4): 265-274 (2008) |
| 19 | EE | Wolfgang W. Bein,
José R. Correa,
Xin Han:
A fast asymptotic approximation scheme for bin packing with rejection.
Theor. Comput. Sci. 393(1-3): 14-22 (2008) |
| 2007 |
|---|
| 18 | EE | Wolfgang W. Bein,
José R. Correa,
Xin Han:
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection.
ESCAPE 2007: 209-218 |
| 17 | EE | José R. Correa,
Cristina G. Fernandes,
Martín Matamala,
Yoshiko Wakabayashi:
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
WAOA 2007: 184-192 |
| 16 | EE | José R. Correa,
Samuel Fiorini,
Nicolás E. Stier Moses:
A note on the precedence-constrained class sequencing problem.
Discrete Applied Mathematics 155(3): 257-259 (2007) |
| 15 | EE | José R. Correa,
Michel X. Goemans:
Improved Bounds on Nonblocking 3-Stage Clos Networks.
SIAM J. Comput. 37(3): 870-894 (2007) |
| 2006 |
|---|
| 14 | | José R. Correa,
Alejandro Hevia,
Marcos A. Kiwi:
LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
Springer 2006 |
| 13 | EE | Roberto Cominetti,
José R. Correa,
Nicolás E. Stier Moses:
Network Games with Atomic Players.
ICALP (1) 2006: 525-536 |
| 12 | EE | José R. Correa,
Cristina G. Fernandes,
Yoshiko Wakabayashi:
Approximating Rational Objectives Is as Easy as Approximating Linear Ones.
SWAT 2006: 351-362 |
| 11 | EE | Mourad Baïou,
José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation.
Discrete Optimization 3(2): 123-135 (2006) |
| 10 | EE | José R. Correa:
Resource augmentation in two-dimensional packing with orthogonal rotations.
Oper. Res. Lett. 34(1): 85-93 (2006) |
| 2005 |
|---|
| 9 | EE | José R. Correa,
Andreas S. Schulz,
Nicolás E. Stier Moses:
On the Inefficiency of Equilibria in Congestion Games.
IPCO 2005: 167-181 |
| 8 | EE | José R. Correa,
Michael R. Wagner:
LP-Based Online Scheduling: From Single to Parallel Machines.
IPCO 2005: 196-209 |
| 7 | EE | Mourad Baïou,
José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation.
Electronic Notes in Discrete Mathematics 19: 103-109 (2005) |
| 2004 |
|---|
| 6 | EE | José R. Correa,
Andreas S. Schulz:
Single Machine Scheduling with Precedence Constraints: Extended Abstract.
IPCO 2004: 283-297 |
| 5 | EE | José R. Correa,
Andreas S. Schulz,
Nicolás E. Stier Moses:
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract.
IPCO 2004: 59-73 |
| 4 | EE | José R. Correa,
Claire Kenyon:
Approximation schemes for multidimensional packing.
SODA 2004: 186-195 |
| 3 | EE | José R. Correa,
Michel X. Goemans:
An approximate König's theorem for edge-coloring weighted bipartite graphs.
STOC 2004: 398-406 |
| 2 | EE | José R. Correa:
Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations.
Electronic Notes in Discrete Mathematics 18: 89-95 (2004) |
| 1 | EE | José R. Correa,
Andreas S. Schulz,
Nicolás E. Stier Moses:
Selfish Routing in Capacitated Networks.
Math. Oper. Res. 29(4): 961-976 (2004) |
