Dr. Ruben Hoeksma

Ruben Hoeksma

Universität Bremen
FB3: Mathematik/Informatik
Bibliothekstr. 5.
28359 Bremen
Germany

Office: MZH 3320
Phone: +49 (421) 218-63584
Email

Office hours: by appointment

Publications

This is a list of my publications. Click the -icon to go to the official publication page. Click the -icon to download a preprint version of the publication (note that only preprints of the most complete version are available). Click the -icon to download a BibTeX file with the preferred citation format for the publication.

Peer-reviewed conference papers

Scheduling Self-Suspending Tasks: New and Old Results. J. Chen, T. Hahn, R. Hoeksma, N. Megow, and G. von der Brüggen. To appear in: 31st Conference on Real-Time Systems (ECRTS 2019).
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior. Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019).
SUPERSET: A (super)natural variant of the card game SET F. Botler, A. Cristi, R. Hoeksma, K. Schewior, and A. Tönnis. 9th International Conference on Fun with Algorithms (FUN 2018).
Network Congestion Games are Robust to Variable Demand J. Correa, R. Hoeksma, and M. Schröder. Presented at: The 13th Conference on Web and Internet Economics (WINE 2017). Conference proceedings only contained and extended abstract.
Posted price mechanisms for a random stream of customers. J. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld. The 2017 ACM conference on Economics and Computation (EC ’17).
A QPTAS for the general scheduling problem with identical release dates. A. Antoniadis, R. Hoeksma, J. Meissner, J. Verschae, and A. Wiese. The 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017).
Decomposition algorithm for the single machine scheduling polytope. R. Hoeksma, B. Manthey, and M. Uetz. Combinatorial Optimization: Third International Symposium (ISCO 2014).
Approximability of Connected Factors. K. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, and C.S. Rahul. Approximation and Online Algorithms: 11th International Workshop (WAOA 2013).
Two dimensional optimal mechanism design for a sequencing problem. R. Hoeksma and M. Uetz. Integer Programming and Combinatorial Optimization: 16th International Conference (IPCO 2013).
The price of anarchy for minsum related machine scheduling. R. Hoeksma and M. Uetz. Approximation and Online Algorithms: 9th International Workshop (WAOA 2011).

Pre-publications

A PTAS for Euclidean TSP with Hyperplane Neighborhoods. A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior. 2018, arXiv:1804.03953
Approximability of Connected Factors. K. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, and C.S. Rahul. 2013, arXiv:1310.2387

Journal articles

Network Congestion Games are Robust to Variable Demand J. Correa, R. Hoeksma, and M. Schröder. Transportation Research Part B: Methodological, Vol 119:69—78, Jan 2019.
The price of anarchy for utilitarian scheduling games on related machines. R. Hoeksma and M. Uetz. Discrete Optimization (2018), DOI: 10.1016/j.disopt.2018.08.001.
Approximation Algorithms for Connected Graph Factors of Minimum Weight. K. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, C.S. Rahul, and M. Waanders. Theory of Computing Systems, 62(2):441—464, 2018.
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types R. Hoeksma and M. Uetz. Operations Research, 64(6):1438—1450, 2016.
Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope R. Hoeksma, B. Manthey, and M. Uetz. Discrete Applied Mathematics, 215:136—145, 2016.

Theses

Mechanisms for scheduling games with selfish players. R. Hoeksma. PhD thesis, University of Twente. CTIT Ph.D.- thesis series No. 14-342, 2015.
Price of anarchy for machine scheduling games with sum of completion times objective. R. Hoeksma. R. Hoeksma, University of Twente. MSc Thesis, 2010.