René Sitters - RankMe

62 papers A* 4A 4B 17Misc 1Journal 34Unranked 2

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