José R. Correa

Michel X. Goemans, José R. Correa (Eds.): Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings. Lecture Notes in Computer Science 7801, Springer 2013, isbn 978-3-642-36693-2

José R. Correa, Martin Skutella, José Verschae: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. Math. Oper. Res. 37(2): 379-398 (2012)

José R. Correa, Omar Larré, José A. Soto: TSP Tours in Cubic Graphs: Beyond 4/3. ESA 2012: 790-801

Mourad Baïou, Francisco Barahona, José R. Correa: On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. SIAM J. Discrete Math. 25(1): 1-20 (2011)

Roberto Cominetti, José R. Correa, Omar Larré: Existence and Uniqueness of Equilibria for Flows over Time. ICALP (2) 2011: 552-563

Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver: Inner product spaces for MinSum coordination mechanisms. STOC 2011: 539-548

Mourad Baïou, Francisco Barahona, José R. Correa: On the p-median polytope of fork-free graphs. Electronic Notes in Discrete Mathematics 36: 143-149 (2010)

Roberto Cominetti, José R. Correa, Thomas Rothvoß, Jaime San Martín: Optimal Selection of Customers for a Last-Minute Offer. Operations Research 58(4-Part-1): 878-888 (2010)

José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi: Approximating a class of combinatorial problems with rational objective function. Math. Program. 124(1-2): 255-269 (2010)

Felipe Balmaceda, Santiago R. Balseiro, José R. Correa, Nicolás E. Stier Moses: The Cost of Moral Hazard and Limited Liability in the Principal-Agent Problem. WINE 2010: 63-74

Roberto Cominetti, José R. Correa, Nicolás E. Stier Moses: The Impact of Oligopolistic Competition in Networks. Operations Research 57(6): 1421-1437 (2009)

José R. Correa, Asaf Levin: Monotone Covering Problems with an Additional Covering Constraint. Math. Oper. Res. 34(1): 238-248 (2009)

José R. Correa, Michael R. Wagner: LP-based online scheduling: from single to parallel machines. Math. Program. 119(1): 109-136 (2009)

José R. Correa, Martin Skutella, José Verschae: The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. APPROX-RANDOM 2009: 84-97

José R. Correa, Nicolas Figueroa: On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design. SAGT 2009: 72-84

José R. Correa, Marcos A. Kiwi: Foreword. Algorithmica 50(4): 415-417 (2008)

José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses: A geometric approach to the price of anarchy in nonatomic congestion games. Games and Economic Behavior 64(2): 457-469 (2008)

José R. Correa, Leah Epstein: Bin packing with controllable item sizes. Inf. Comput. 206(8): 1003-1016 (2008)

José R. Correa, Martín Matamala: Some remarks about factors of graphs. Journal of Graph Theory 57(4): 265-274 (2008)

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)

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)

José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses: Fast, Fair, and Efficient Flows in Networks. Operations Research 55(2): 215-225 (2007)

José R. Correa, Michel X. Goemans: Improved Bounds on Nonblocking 3-Stage Clos Networks. SIAM J. Comput. 37(3): 870-894 (2007)

Wolfgang W. Bein, José R. Correa, Xin Han: A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection. ESCAPE 2007: 209-218

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

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)

Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31(1): 31-49 (2006)

José R. Correa: Resource augmentation in two-dimensional packing with orthogonal rotations. Oper. Res. Lett. 34(1): 85-93 (2006)

Roberto Cominetti, José R. Correa, Nicolás E. Stier Moses: Network Games with Atomic Players. ICALP (1) 2006: 525-536

José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi: Approximating Rational Objectives Is as Easy as Approximating Linear Ones. SWAT 2006: 351-362

José R. Correa, Alejandro Hevia, Marcos A. Kiwi (Eds.): LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings. Lecture Notes in Computer Science 3887, Springer 2006, isbn 3-540-32755-X

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)

José R. Correa, Andreas S. Schulz: Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 30(4): 1005-1021 (2005)

José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses: On the Inefficiency of Equilibria in Congestion Games. IPCO 2005: 167-181

José R. Correa, Michael R. Wagner: LP-Based Online Scheduling: From Single to Parallel Machines. IPCO 2005: 196-209

José R. Correa: Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations. Electronic Notes in Discrete Mathematics 18: 89-95 (2004)

José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses: Selfish Routing in Capacitated Networks. Math. Oper. Res. 29(4): 961-976 (2004)

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

José R. Correa, Andreas S. Schulz: Single Machine Scheduling with Precedence Constraints: Extended Abstract. IPCO 2004: 283-297

José R. Correa, Claire Kenyon: Approximation schemes for multidimensional packing. SODA 2004: 186-195

José R. Correa, Michel X. Goemans: An approximate König's theorem for edge-coloring weighted bipartite graphs. STOC 2004: 398-406

Roberto Cominetti, José R. Correa: Common-Lines and Passenger Assignment in Congested Transit Networks. Transportation Science 35(3): 250-267 (2001)