High Multiplicity Scheduling with Switching Costs for Few Products. - Michaël Gabay; Alexander Grigoriev; Vincent J. C. Kreuzen; Tim Oosterwijk (OR, 2014)

On local search and LP and SDP relaxations for k-Set Packing. - Tim Oosterwijk (CoRR, 2015)

Tractable Cases of (*, 2)-Bounded Parsimony Haplotyping. - Judith Keijsper; Tim Oosterwijk (IEEE ACM Trans. Comput. Biol. Bioinform., 2015)

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. - Nikhil Bansal 001; Tim Oosterwijk; Tjark Vredeveld; Ruben van der Zwaan (Algorithmica, 2016)

A logarithmic approximation for polymatroid congestion games. - Tobias Harks; Tim Oosterwijk; Tjark Vredeveld (Oper. Res. Lett., 2016)

Posted Price Mechanisms for a Random Stream of Customers. - José Correa 001; Patricio Foncea; Ruben Hoeksma; Tim Oosterwijk; Tjark Vredeveld (EC, 2017)

Recent developments in prophet inequalities. - José Correa 001; Patricio Foncea; Ruben Hoeksma; Tim Oosterwijk; Tjark Vredeveld (SIGecom Exch., 2018)

A General Framework for Energy-Efficient Cloud Computing Mechanisms. - Antonios Antoniadis 001; Andrés Cristi; Tim Oosterwijk; Alkmini Sgouritsa (AAMAS, 2020)

Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals. - José Correa 001; Patricio Foncea; Ruben Hoeksma; Tim Oosterwijk; Tjark Vredeveld (Math. Oper. Res., 2021)

Cyclic lot-sizing problems with sequencing costs. - Alexander Grigoriev; Vincent J. C. Kreuzen; Tim Oosterwijk (J. Sched., 2021)

On the Price of Anarchy for Flows over Time. - José Correa 001; Andrés Cristi; Tim Oosterwijk (Math. Oper. Res., 2022)

Complexity of Fixed Order Routing. - Steven Miltenburg; Tim Oosterwijk; René Sitters (WAOA, 2024)

Bicriteria Nash flows over time. - Tim Oosterwijk; Daniel Schmand; Marc Schröder 002 (Games Econ. Behav., 2024)

The Secretary Problem with Independent Sampling. - José Correa 001; Andrés Cristi; Laurent Feuilloley; Tim Oosterwijk; Alexandros Tsigonias-Dimitriadis (Manag. Sci., 2025)

Competitive mechanisms for energy-efficient cloud computing. - Antonios Antoniadis 001; Andrés Cristi; Tim Oosterwijk; Alkmini Sgouritsa (Theor. Comput. Sci., 2025)

Exact and approximation algorithms for routing a convoy through a graph. - Martijn van Ee; Tim Oosterwijk; René Sitters; Andreas Wiese (Math. Program., 2025)