| 2026 | SOFSEM | On the Complexity of Capacitated Vehicle Routing with Order Restrictions. | Steven Miltenburg, Tim Oosterwijk, Ren Sitters |
| 2025 | WAOA | Approximation Algorithms for Graph Search Problems with Imperfect Detection. | Martijn van Ee, Ren Sitters |
| 2024 | WAOA | Complexity of Fixed Order Routing. | Steven Miltenburg, Tim Oosterwijk, Ren Sitters |
| 2023 | MFCS | Exact and Approximation Algorithms for Routing a Convoy Through a Graph. | Martijn van Ee, Tim Oosterwijk, Ren Sitters, Andreas Wiese |
| 2019 | IPCO | Fixed-Order Scheduling on Parallel Machines. | Thomas Bosman, Dario Frascaria, Neil Olver, Ren Sitters, Leen Stougie |
| 2018 | WAOA | The Itinerant List Update Problem. | Neil Olver, Kirk Pruhs, Kevin Schewior, Ren Sitters, Leen Stougie |
| 2016 | WAOA | A priori TSP in the Scenario Model. | Martijn van Ee, Leo van Iersel, Teun Janssen, Ren Sitters |
| 2015 | MFCS | On the Complexity of Master Problems. | Martijn van Ee, Ren Sitters |
| 2014 | COCOON | Scheduling over Scenarios on Two Machines. | Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, Ren Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen |
| 2014 | SODA | Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. | Ren Sitters |
| 2014 | WAOA | Routing Under Uncertainty: The a priori Traveling Repairman Problem. | Martijn van Ee, Ren Sitters |
| 2011 | IPCO | TSP on Cubic and Subcubic Graphs. | Sylvia C. Boyd, Ren Sitters, Suzanne van der Ster, Leen Stougie |
| 2010 | IPCO | Efficient Algorithms for Average Completion Time Scheduling. | Ren Sitters |
| 2010 | STACS | The Traveling Salesman Problem under Squared Euclidean Distances. | Fred van Nijnatten, Ren Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg |
| 2009 | SODA | On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, Ren Sitters |
| 2009 | SAGT | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, Ren Sitters |
| 2009 | WG | Connected Feedback Vertex Set in Planar Graphs. | Alexander Grigoriev, Ren Sitters |
| 2007 | ESA | A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. | Khaled M. Elbassioni, Ren Sitters, Yan Zhang |
| 2006 | ISAAC | On Approximating the TSP with Intersecting Neighborhoods. | Khaled M. Elbassioni, Aleksei V. Fishkin, Ren Sitters |
| 2006 | WAOA | On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. | Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, Ren Sitters, Thomas Wolle |
| 2006 | WG | How to Sell a Graph: Guidelines for Graph Retailers. | Alexander Grigoriev, Joyce van Loon, Ren Sitters, Marc Uetz |
| 2005 | ESA | Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. | Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, Ren Sitters |
| 2005 | ICALP | Approximation Algorithms for Euclidean Group TSP. | Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, Ren Sitters |
| 2003 | ICALP | A Competitive Algorithm for the General 2-Server Problem. | Ren Sitters, Leen Stougie, Willem de Paepe |
| 2002 | ESA | On-Line Dial-a-Ride Problems under a Restricted Information Model. | Maarten Lipmann, Xiwen Lu, Willem de Paepe, Ren Sitters, Leen Stougie |
| 2002 | IPCO | The Minimum Latency Problem Is NP-Hard for Weighted Trees. | Ren Sitters |
| 2001 | IPCO | Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. | Ren Sitters |