Tim Oosterwijk

Orcid: 0000-0002-8509-7002

Affiliations:
  • Vrije Universiteit Amsterdam, The Netherlands
  • Maastricht University, The Netherlands (former)
  • Eindhoven University of Technology, The Netherlands (former)


According to our database1, Tim Oosterwijk authored at least 14 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Bicriteria Nash flows over time.
Games Econ. Behav., 2024

2023
Exact and Approximation Algorithms for Routing a Convoy Through a Graph.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
On the Price of Anarchy for Flows over Time.
Math. Oper. Res., 2022

2021
Cyclic lot-sizing problems with sequencing costs.
J. Sched., 2021

Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals.
Math. Oper. Res., 2021

The Secretary Problem with Independent Sampling.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
A General Framework for Energy-Efficient Cloud Computing Mechanisms.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2018
Recent developments in prophet inequalities.
SIGecom Exch., 2018

2017
Posted Price Mechanisms for a Random Stream of Customers.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
A logarithmic approximation for polymatroid congestion games.
Oper. Res. Lett., 2016

Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.
Algorithmica, 2016

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

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

2014
High Multiplicity Scheduling with Switching Costs for Few Products.
Proceedings of the Operations Research Proceedings 2014, 2014


  Loading...