• R. Cominetti, J.R. Correa, T. Rothvoss, and J. San Martin. "Optimal selection of customers for a last-minute offer."
  • Operations Research, to appear.
• J.R. Correa, C.G. Fernandes and Y. Wakabayashi. "Approximating a Class of Combinatorial Problems with Rational Objective Function."
  • Mathematical Programming B, to appear.
• R. Cominetti, J.R. Correa and N.E. Stier Moses. "The Impact of Oligopolistic Competition in Networks."
  • Operations Research, 57, No 6 (2009), pp. 1421--1437.
• J.R. Correa, and A. Levin. "Monotone covering problems with an additional covering constraint."
  • Mathematics of Operations Research, 34, No 1 (2009), pp. 238--248.
• J.R. Correa and M. Wagner. "LP-Based Online Scheduling: From Single to Parallel Machines."
  • Mathematical Programming, 119, No 1 (2009), pp. 109--136.
• J.R. Correa, A.S. Schulz and N.E. Stier Moses. "A geometric approach to the price of anarchy in nonatomic congestion games."
  • Games and Economic Behavior, 64, No 2 (2008), pp. 457--469.
• J.R. Correa, and L. Epstein. "Bin packing with controllable item sizes."
  • Information and Computation, 206, No 8 (2008), pp. 1003--1016.
• J.R. Correa and M. Matamala. "Some Remarks About Factors of Graphs."
  • Journal of Graph Theory, 57, No 4 (2008), pp. 265--274.
• W. Bein, J.R. Correa and X. Han. "A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection."
  • Theoretical Computer Science, 393, No 1-3 (2008), pp. 14--22.
• J.R. Correa and M.X. Goemans. "Improved Bounds on Nonblocking 3-Satge Clos Networks."
  • SIAM Journal on Computing, 37, No 3 (2007), pp. 870--894.
• J.R. Correa, A.S. Schulz and N.E. Stier Moses. "Fast, Fair and Efficient Flows in Networks
  • Operations Research, 55, No 2 (2007), pp. 215--225.
• J.R. Correa, S. Fiorini, N. Stier Moses. "A Note on the Precedence-Constrained Class Sequencing Problem."
  • Discrete Applied Mathematics, 155, No 3 (2007), pp. 257--259.
• N. Bansal, J.R. Correa, C. Kenyon and M. Sviridenko. "Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes."
  • Mathematics of Operations Research 31, No 1 (2006), pp. 31--49.
• J.R. Correa. "Resource Augmentation in Two-Dimensional Packing with Orthogonal Rotations."
  • Operations Research Letters 34, No 1 (2006), pp. 85--93.
• M. Baiou and J.R. Correa. "The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation."
  • Discrete Optimization 3, No 2 (2006), pp. 123-135.
• J.R. Correa and A.S. Schulz. "Single Machine Scheduling with Precedence Constraints."
  • Mathematics of Operations Research 30, No 4 (2005), pp. 1005--1021.
• J.R. Correa, A.S. Schulz and N.E. Stier Moses. "Selfish Routing in Capacitated Networks."
  • Mathematics of Operations Research 29, No 4 (2004), pp. 961-976.
  • This paper received an honorable mention in the 2006 TSL Best Paper Award competition (INFORMS).
• R. Cominetti and J. Correa. "Common-lines and passenger assignment in congested transit networks."
  • Transportation Science 35, No 3 (2001), pp. 250-267.
  • This paper received the 2002 TSL Best Paper Award (INFORMS). (see award citation )

CONFERENCE PROCEEDINGS: Several of these papers are preliminary versions of the journal articles above.

• J.R. Correa, and N. Figueroa. On the planner's loss due to lack of information in bayesian mechanism design. SAGT 2009, pp. 72--84.
• J.R. Correa, M. Skutella, and J. Verschae. The power of preemption in unrelated machines and applications to scheduling orders. APPROX-RANDOM 2009, pp. 84--97.
• J.R. Correa, N. Megow, R. Raman, and K. Suchan. Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. CTW 2009, pp. 347--350.
• J.R. Correa, C.G. Fernandes, M. Matamala, and Y. Wakabayashi. A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. WAOA 2007, pp. 184--192.
• W. Bein, J.R. Correa, and X. Han. A fast asymptotic approximation scheme for bin packing with rejection. ESCAPE 2007.
• R. Cominetti, J.R. Correa, and N. Stier-Moses. Network games with atomic players. ICALP 2006.
• J.R. Correa, C. Fernandes, and Y. Wakabayashi. Approximating rational objectives is as easy as approximating linear ones. SWAT 2006.
• J.R. Correa and M.R. Wagner. LP-based online scheduling: from single to parallel machines. IPCO 2005.
• J.R. Correa, A.S. Schulz, and N. Stier-Moses. On the inefficiency of equilibria in congestion games. IPCO 2005.
• M. Baiou and J.R. Correa. The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation. GRACO 2005.
• J.R. Correa and C. Kenyon. Approximation schemes for multidimensional packing . SODA 2004.
• J.R. Correa. Near-optimal solutions to two-dimensional bin packing with 90 degree rotations. LACGA 2004.
• J.R. Correa and M.X. Goemans. An approximate Knig?s theorem for edge-coloring weighted bipartite graphs. STOC 2004.
• J.R. Correa and A.S. Schulz. Single machine scheduling with precedence constraints. IPCO 2004.
• J.R. Correa, A.S. Schulz, and N. Stier Moses. Computational complexity, fairness, and the price of anarchy of the maximum latency problem. IPCO 2004.

SUBMITTED / MANUSCRIPTS

• F. Barahona, M. Baiou, and J.R. Correa. On the p-Median Polytope and the Intersection Property.
• J.R. Correa and M. Queyranne. Efficiency of Equilibria in Restricted Uniform Machine Scheduling with Minsum Social Cost.
• J.R. Correa, N. Figueroa, and N.E. Stier Moses. Pricing with markups in industries with increasing marginal costs. Finalist in the INFORMS 2009 Junior Faculty Interest Group (JFIG) paper competition.
• J.R. Correa and N.E. Stier-Moses. Stackelberg Routing in Atomic Network Games. Columbia Working Paper DRO-2007-03, 2007.

Theses: In April 2004 I defended my Phd thesis: "Approximation Algorithms for Packing and Scheduling Problems." (Tucker Prize Finalist). In July 1999 I defended my engineering thesis (=Masters): "Asignación de flujos de pasajeros en redes de transporte público congestionadas."