default search action
Tim Oosterwijk
Person information
- affiliation: Vrije Universiteit Amsterdam, The Netherlands
- affiliation (former): Maastricht University, The Netherlands
- affiliation (former): Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Tim Oosterwijk
, Daniel Schmand
Bicriteria Nash flows over time. Games Econ. Behav. 147: 19-37 (2024) - 2023
- [c7]Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese:
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS 2023: 86:1-86:15 - 2022
- [j7]José Correa
On the Price of Anarchy for Flows over Time. Math. Oper. Res. 47(2): 1394-1411 (2022) - [c6]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash Flows over Time. WINE 2022: 368 - 2021
- [j6]José Correa
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals. Math. Oper. Res. 46(4): 1452-1478 (2021) - [j5]Alexander Grigoriev
Cyclic lot-sizing problems with sequencing costs. J. Sched. 24(2): 123-135 (2021) - [c5]José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk
The Secretary Problem with Independent Sampling. SODA 2021: 2047-2058 - [i3]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash Flows over Time. CoRR abs/2111.08589 (2021) - 2020
- [c4]Antonios Antoniadis, Andrés Cristi, Tim Oosterwijk, Alkmini Sgouritsa:
A General Framework for Energy-Efficient Cloud Computing Mechanisms. AAMAS 2020: 70-78 - [i2]José Correa, Andrés Cristi, Laurent Feuilloley, Tim Oosterwijk
The Secretary Problem with Independent Sampling. CoRR abs/2011.07869 (2020)
2010 – 2019
- 2019
- [c3]José Correa, Andrés Cristi, Tim Oosterwijk
On the Price of Anarchy for flows over time. EC 2019: 559-577 - 2018
- [j4]José Correa, Patricio Foncea, Ruben Hoeksma
Recent developments in prophet inequalities. SIGecom Exch. 17(1): 61-70 (2018) - 2017
- [c2]José Correa, Patricio Foncea, Ruben Hoeksma
Posted Price Mechanisms for a Random Stream of Customers. EC 2017: 169-186 - 2016
- [j3]Nikhil Bansal, Tim Oosterwijk
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica 76(4): 1077-1096 (2016) - [j2]Tobias Harks
A logarithmic approximation for polymatroid congestion games. Oper. Res. Lett. 44(6): 712-717 (2016) - 2015
- [j1]Judith Keijsper, Tim Oosterwijk
Tractable Cases of (*, 2)-Bounded Parsimony Haplotyping. IEEE ACM Trans. Comput. Biol. Bioinform. 12(1): 234-247 (2015) - [i1]Tim Oosterwijk:
On local search and LP and SDP relaxations for k-Set Packing. CoRR abs/1507.07459 (2015) - 2014
- [c1]Michaël Gabay
High Multiplicity Scheduling with Switching Costs for Few Products. OR 2014: 437-443
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: