René Sitters

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 18

Top Topics

Top Venues

Publications

Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS (2023)
René Sitters
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems. SIAM J. Comput. 50 (5) (2021)
Martijn van Ee, René Sitters
The Chinese deliveryman problem. 4OR 18 (3) (2020)
Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie
Fixed-Order Scheduling on Parallel Machines. IPCO (2019)
Martijn van Ee, René Sitters
The A Priori Traveling Repairman Problem. Algorithmica 80 (10) (2018)
Martijn van Ee, René Sitters
Approximation and complexity of multi-target graph search and the Canadian traveler problem. Theor. Comput. Sci. 732 (2018)
René Sitters, Liya Yang
A (2+ϵ)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. Oper. Res. Lett. 46 (4) (2018)
Christoph Dürr, Zdenek Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger
The triangle scheduling problem. J. Sched. 21 (3) (2018)
Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie
The Itinerant List Update Problem. WAOA (2018)
Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters
TSP in the scenario model. Discret. Appl. Math. 250 (2018)
René Sitters
Approximability of average completion time scheduling on unrelated machines. Math. Program. 161 (1-2) (2017)
René Sitters, Liya Yang
A $(2 + ε)$-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. CoRR (2017)
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. J. Sched. 20 (6) (2017)
Chao Wang, René Sitters
On some special cases of the restricted assignment problem. Inf. Process. Lett. 116 (11) (2016)
Christoph Dürr, Zdenek Hanzálek, Christian Konrad, René Sitters, Óscar C. Vásquez, Gerhard J. Woeginger
The triangle scheduling problem. CoRR (2016)
Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters
A priori TSP in the Scenario Model. WAOA (2016)
Martijn van Ee, René Sitters
On the Complexity of Master Problems. MFCS (2) (2015)
Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo, Anke van Zuylen
Split scheduling with uniform setup times. J. Sched. 18 (2) (2015)
Martijn van Ee, René Sitters
Routing Under Uncertainty: The a priori Traveling Repairman Problem. WAOA (2014)
Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
Scheduling over Scenarios on Two Machines. COCOON (2014)
Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
The traveling salesman problem on cubic and subcubic graphs. Math. Program. 144 (1-2) (2014)
René Sitters
The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem. SIAM J. Comput. 43 (1) (2014)
Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
Scheduling over Scenarios on Two Machines. CoRR (2014)
René Sitters
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. SODA (2014)
René Sitters
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. CoRR (2013)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On the complexity of the highway problem. Theor. Comput. Sci. 460 (2012)
Ho-Leung Chan, Nicole Megow, René Sitters, Rob van Stee
A note on sorting buffers offline. Theor. Comput. Sci. 423 (2012)
Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Victor Verdugo, Anke van Zuylen
Split Scheduling with Uniform Setup Times CoRR (2012)
Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
TSP on Cubic and Subcubic Graphs. IPCO (2011)
Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
The traveling salesman problem on cubic and subcubic graphs CoRR (2011)
René Sitters
The generalized work function algorithm is competitive for the generalized 2-server problem CoRR (2011)
Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg
The Traveling Salesman Problem under Squared Euclidean Distances. STACS (2010)
Ho-Leung Chan, Nicole Megow, Rob van Stee, René Sitters
The Sorting Buffer Problem is NP-hard CoRR (2010)
René Sitters
Efficient Algorithms for Average Completion Time Scheduling. IPCO (2010)
René Sitters
Competitive analysis of preemptive single-machine scheduling. Oper. Res. Lett. 38 (6) (2010)
Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff
The Traveling Salesman Problem Under Squared Euclidean Distances CoRR (2010)
Alexander Grigoriev, René Sitters
Connected Feedback Vertex Set in Planar Graphs. WG (2009)
Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz
Optimal pricing of capacitated networks. Networks 53 (1) (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT (2009)
Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. Int. J. Comput. Geom. Appl. 19 (2) (2009)
Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA (2009)
Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
On the minimum corridor connection problem and other generalized geometric problems. Comput. Geom. 42 (9) (2009)
Khaled M. Elbassioni, René Sitters, Yan Zhang
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. ESA (2007)
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)
Yair Bartal, Stefano Leonardi, Gil Shallom, René Sitters
On the Value of Preemption in Scheduling. APPROX-RANDOM (2006)
Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters
On Approximating the TSP with Intersecting Neighborhoods. ISAAC (2006)
Corinne Feremans, Alexander Grigoriev, René Sitters
The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4 (4) (2006)
Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz
How to Sell a Graph: Guidelines for Graph Retailers. WG (2006)
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)
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters
Approximation Algorithms for Euclidean Group TSP. ICALP (2005)
René Sitters
Complexity of preemptive minsum scheduling on unrelated parallel machines. J. Algorithms 57 (1) (2005)
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) (2004)
Xiwen Lu, René Sitters, Leen Stougie
A class of on-line scheduling algorithms to minimize total completion time. Oper. Res. Lett. 31 (3) (2003)
René Sitters, Leen Stougie, Willem de Paepe
A Competitive Algorithm for the General 2-Server Problem. ICALP (2003)
Maarten Lipmann, Xiwen Lu, Willem de Paepe, René Sitters, Leen Stougie
On-Line Dial-a-Ride Problems under a Restricted Information Model. ESA (2002)
René Sitters
The Minimum Latency Problem Is NP-Hard for Weighted Trees. IPCO (2002)
René Sitters
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. IPCO (2001)
René Sitters
A Short Proof of a Conjecture on the Tr-choice Number of Even Cycles. Discret. Appl. Math. 92 (2-3) (1999)