The SCEAS System
| |||||||

## Search the dblp DataBase
José R. Correa:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Roberto Cominetti, José R. Correa, Nicolás E. Stier Moses
**Network Games with Atomic Players.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:525-536 [Conf] - José R. Correa, Andreas S. Schulz
**Single Machine Scheduling with Precedence Constraints: Extended Abstract.**[Citation Graph (0, 0)][DBLP] IPCO, 2004, pp:283-297 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] IPCO, 2004, pp:59-73 [Conf] - José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
**On the Inefficiency of Equilibria in Congestion Games.**[Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:167-181 [Conf] - José R. Correa, Michael R. Wagner
**LP-Based Online Scheduling: From Single to Parallel Machines.**[Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:196-209 [Conf] - José R. Correa, Claire Kenyon
**Approximation schemes for multidimensional packing.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:186-195 [Conf] - José R. Correa, Michel X. Goemans
**An approximate König's theorem for edge-coloring weighted bipartite graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:398-406 [Conf] - José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
**Approximating Rational Objectives Is as Easy as Approximating Linear Ones.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:351-362 [Conf] - José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses
**A note on the precedence-constrained class sequencing problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:3, pp:257-259 [Journal] - José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
**Selfish Routing in Capacitated Networks.**[Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2004, v:29, n:4, pp:961-976 [Journal] - José R. Correa
**Resource augmentation in two-dimensional packing with orthogonal rotations.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:1, pp:85-93 [Journal] - Wolfgang W. Bein, José R. Correa, Xin Han
**A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection.**[Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:209-218 [Conf] - José R. Correa, Michel X. Goemans
**Improved Bounds on Nonblocking 3-Stage Clos Networks.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:870-894 [Journal] **The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.**[Citation Graph (, )][DBLP]**A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.**[Citation Graph (, )][DBLP]**On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design.**[Citation Graph (, )][DBLP]**Foreword.**[Citation Graph (, )][DBLP]
Search in 0.027secs, Finished in 0.028secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |