René Sitters: Recent publications

[Journals] [Conferences] [Theses] [Others]

Articles in Journals

• René Sitters,
  Approximability of average completion time scheduling on unrelated machines.
  Mathematical Programming, 2016 (Full version = open access)
• Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
  Minimizing worst-case and average-case makespan over scenarios.
  To appear in Journal of Scheduling 2016 (arXiv version)
• Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Victor Verdugo, and Anke van Zuylen
  Split scheduling with uniform setup times
  Journal of Scheduling, 2015.(full version) (arXiv version)
• René Sitters,
  The generalized work function algorithm is competitive for the generalized 2-server problem.
  Siam Journal on Computing, 43, pages 96-125, 2014. (Full version) (arXiv version)
• Sylvia Boyd, René Sitters, Suzanne van der Ster, and Leen Stougie,
  TSP on Cubic and Subcubic Graphs.
  Mathematical Programming 144, pages 227-245, 2014.(full version) (arXiv version)
• K. Elbassioni, R. Raman, S. Ray, R. Sitters.
  On the complexity of the highway problem.
  Theoretical Computer Science, 460, pages 70-77, 2012.
  
• Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee.
  A note on sorting buffers offline.
  Theoretical Computer Science, 423, pages 11-18, 2012.
  
• René Sitters.
  Competitive analysis of preemptive single-machine scheduling.
  Operations Research Letters, 38, pages 585-588, 2010.
  
• Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle.
  On the minimum corridor connection problem and other generalized geometric problems.
  Computational Geometry: Theory and Applications, 42, pages 939-951, 2009.
  
• K.M. Elbassioni, A.V. Fishkin, and R.A. Sitters.
  Approximation algorithms for Euclidean group TSP and TSP with neighborhoods.
  International Journal of Computational Geometry and Application, 19, pages 173-193, 2009.
  
• A. Grigoriev, J. van Loon, R. Sitters, M. Uetz.
  Optimal pricing of capacitated networks.
  Networks, 53, pages 79-87, 2009.
  
• R.A. Sitters and L. Stougie.
  The generalized two-server problem.
  Journal of the ACM, 53, pages 437-458, 2006.
  

Articles in Refereed Conference Proceedings

• René Sitters,
  Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
  SODA, 2014. (arXiv version)
• Sylvia Boyd, René Sitters, Suzanne van der Ster, and Leen Stougie,
  TSP on Cubic and Subcubic Graphs.
  In Proceedings 15th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2011.
  
• René Sitters.
  Efficient algorithms for average completion time scheduling.
  In Proceedings 14th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2010.
  
• Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard Woeginger and Alexander Wolff.
  The Traveling Salesman Problem Under Squared Euclidean Distances.
  In Proceedings 27th Int. Symp. on Theoretical Aspects of Computer Science (STACS), 2010.
  
• Rajiv Raman, Khaled Elbassioni, Saurabh Ray, René Sitters.
  On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.
  In Proceedings 2nd SAGT, LNCS 5814,, 2009.
  
• K. Elbassioni, R. Raman, S. Ray, and R.A. Sitters.
  On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.
  In Proc. 20th annual ACM-SIAM symposium on Discrete algorithms (SODA), 2009.
  
• Alexander Grigoriev, R.A. Sitters.
  Connected feedback vertex set in planar graphs.
  In Proc. 35th. WG, Lecture Notes in Computer Science., 2009.
  
• R.A. Sitters.
  Minimizing average flow time on unrelated machines.
  In Proc. 6th. Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science 5426 (2009)., 2009.
  
• R.A. Sitters.
  Approximability of average completion time scheduling on unrelated machines.
  In Proc. 16th. European Symposium on Algorithms (ESA),Lecture Notes in Computer Science 5193, 2008.
  
• K.M. Elbassioni, R.A. Sitters, and Y. Zhang.
  A quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.
  In Proceeding of 15th. European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, 4698 , 451-462 2007.
  

Theses

• R.A Sitters.
  Complexity and approximation in routing and scheduling.
  [pdf]

Contributions to Books

• R.A. Sitters.
  The generalized two server problem.
  In Ming Yang Kao, editor, Encyclopedia of Algorithms, Springer, 2008 (1st edition) and 2016 (2nd edition).

Preprints and Technical Reports

• Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Oscar C. Vásquez, Gerhard J. Woeginger
  The triangle scheduling problem
  (arXiv version)