Search the dblp DataBase

Publications of Author

1. Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters
   On the Value of Preemption in Scheduling. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2006, pp:39-48 [Conf]
   
2. Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastyanov, René Sitters
   Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. [Citation Graph (0, 0)][DBLP]
   ESA, 2005, pp:580-591 [Conf]
   
3. Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie
   On-Line Dial-a-Ride Problems under a Restricted Information Model. [Citation Graph (0, 0)][DBLP]
   ESA, 2002, pp:674-685 [Conf]
   
4. Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters
   Approximation Algorithms for Euclidean Group TSP. [Citation Graph (0, 0)][DBLP]
   ICALP, 2005, pp:1115-1126 [Conf]
   
5. René Sitters, Leen Stougie, Willem de Paepe
   A Competitive Algorithm for the General 2-Server Problem. [Citation Graph (0, 0)][DBLP]
   ICALP, 2003, pp:624-636 [Conf]
   
6. René Sitters
   Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
   IPCO, 2001, pp:396-405 [Conf]
   
7. René Sitters
   The Minimum Latency Problem Is NP-Hard for Weighted Trees. [Citation Graph (0, 0)][DBLP]
   IPCO, 2002, pp:230-239 [Conf]
   
8. Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters
   On Approximating the TSP with Intersecting Neighborhoods. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2006, pp:213-222 [Conf]
   
9. Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
   On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. [Citation Graph (0, 0)][DBLP]
   WAOA, 2006, pp:69-82 [Conf]
   
10. Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz
    How to Sell a Graph: Guidelines for Graph Retailers. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:125-136 [Conf]
    
11. Corinne Feremans, Alexander Grigoriev, René Sitters
    The geometric generalized minimum spanning tree problem with grid clustering. [Citation Graph (0, 0)][DBLP]
    4OR, 2006, v:4, n:4, pp:319-329 [Journal]
    
12. Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie
    On-Line Dial-a-Ride Problems Under a Restricted Information Model. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:319-329 [Journal]
    
13. René Sitters
    A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:243-246 [Journal]
    
14. René Sitters
    Complexity of preemptive minsum scheduling on unrelated parallel machines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:1, pp:37-48 [Journal]
    
15. Xiwen Lu, René Sitters, Leen Stougie
    A class of on-line scheduling algorithms to minimize total completion time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:232-236 [Journal]
    
16. Khaled M. Elbassioni, René Sitters, Yan Zhang
    A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:451-462 [Conf]
    
17. 
    Efficient Algorithms for Average Completion Time Scheduling. [Citation Graph (, )][DBLP]
    
    
18. 
    On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. [Citation Graph (, )][DBLP]
    
    
19. 
    The Traveling Salesman Problem under Squared Euclidean Distances. [Citation Graph (, )][DBLP]
    
    
20. 
    Connected Feedback Vertex Set in Planar Graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. [Citation Graph (, )][DBLP]
    
    
22. 
    On the minimum corridor connection problem and other generalized geometric problems. [Citation Graph (, )][DBLP]
    
    
23. 
    The Traveling Salesman Problem Under Squared Euclidean Distances [Citation Graph (, )][DBLP]