René A. Sitters
List of publications from the
| 2009 |
|---|
| 23 | EE | Khaled M. Elbassioni,
Rajiv Raman,
Saurabh Ray,
René Sitters:
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.
SODA 2009: 1210-1219 |
| 22 | EE | Alexander Grigoriev,
Joyce van Loon,
René Sitters,
Marc Uetz:
Optimal pricing of capacitated networks.
Networks 53(1): 79-87 (2009) |
| 2008 |
|---|
| 21 | EE | René A. Sitters:
Approximability of Average Completion Time Scheduling on Unrelated Machines.
ESA 2008: 768-779 |
| 20 | EE | René A. Sitters:
Minimizing Average Flow Time on Unrelated Machines.
WAOA 2008: 67-77 |
| 19 | EE | René A. Sitters:
Generalized Two-Server Problem.
Encyclopedia of Algorithms 2008 |
| 2007 |
|---|
| 18 | EE | Khaled M. Elbassioni,
René Sitters,
Yan Zhang:
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.
ESA 2007: 451-462 |
| 2006 |
|---|
| 17 | EE | Yair Bartal,
Stefano Leonardi,
Gil Shallom,
René Sitters:
On the Value of Preemption in Scheduling.
APPROX-RANDOM 2006: 39-48 |
| 16 | EE | Khaled M. Elbassioni,
Aleksei V. Fishkin,
René Sitters:
On Approximating the TSP with Intersecting Neighborhoods.
ISAAC 2006: 213-222 |
| 15 | EE | Hans L. Bodlaender,
Corinne Feremans,
Alexander Grigoriev,
Eelko Penninkx,
René Sitters,
Thomas Wolle:
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.
WAOA 2006: 69-82 |
| 14 | EE | Alexander Grigoriev,
Joyce van Loon,
René Sitters,
Marc Uetz:
How to Sell a Graph: Guidelines for Graph Retailers.
WG 2006: 125-136 |
| 13 | EE | Corinne Feremans,
Alexander Grigoriev,
René Sitters:
The geometric generalized minimum spanning tree problem with grid clustering.
4OR 4(4): 319-329 (2006) |
| 12 | EE | René A. Sitters,
Leen Stougie:
The generalized two-server problem.
J. ACM 53(3): 437-458 (2006) |
| 2005 |
|---|
| 11 | EE | Aleksei V. Fishkin,
Klaus Jansen,
Sergey V. Sevastianov,
René Sitters:
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.
ESA 2005: 580-591 |
| 10 | EE | Khaled M. Elbassioni,
Aleksei V. Fishkin,
Nabil H. Mustafa,
René Sitters:
Approximation Algorithms for Euclidean Group TSP.
ICALP 2005: 1115-1126 |
| 9 | EE | René Sitters:
Complexity of preemptive minsum scheduling on unrelated parallel machines.
J. Algorithms 57(1): 37-48 (2005) |
| 2004 |
|---|
| 8 | EE | Maarten Lipmann,
Xiwen Lu,
Willem de Paepe,
René Sitters,
Leen Stougie:
On-Line Dial-a-Ride Problems Under a Restricted Information Model.
Algorithmica 40(4): 319-329 (2004) |
| 7 | EE | Willem de Paepe,
Jan Karel Lenstra,
Jiri Sgall,
René A. Sitters,
Leen Stougie:
Computer-Aided Complexity Classification of Dial-a-Ride Problems.
INFORMS Journal on Computing 16(2): 120-132 (2004) |
| 2003 |
|---|
| 6 | EE | René Sitters,
Leen Stougie,
Willem de Paepe:
A Competitive Algorithm for the General 2-Server Problem.
ICALP 2003: 624-636 |
| 5 | EE | Xiwen Lu,
René Sitters,
Leen Stougie:
A class of on-line scheduling algorithms to minimize total completion time.
Oper. Res. Lett. 31(3): 232-236 (2003) |
| 2002 |
|---|
| 4 | EE | Maarten Lipmann,
Xiwen Lu,
Willem de Paepe,
René Sitters,
Leen Stougie:
On-Line Dial-a-Ride Problems under a Restricted Information Model.
ESA 2002: 674-685 |
| 3 | EE | René Sitters:
The Minimum Latency Problem Is NP-Hard for Weighted Trees.
IPCO 2002: 230-239 |
| 2001 |
|---|
| 2 | EE | René Sitters:
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines.
IPCO 2001: 396-405 |
| 1999 |
|---|
| 1 | EE | René Sitters:
A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles.
Discrete Applied Mathematics 92(2-3): 243-246 (1999) |
