Dr. Ruben Hoeksma - Publications
Peer-reviewed conference papers
On the complexity of Anchored Rectangle Packing. dagstuhl.de
A. Antoniadis, F. Biermeier, A. Cristi, C. Damerius, R. Hoeksma, D. Kaaser, P. Kling, and L. Nölke.
27th European Symposium on Algorithms (ESA 2019).
SUPERSET: A (super)natural variant of the card game SET dagstuhl.de
F. Botler, A. Cristi, R. Hoeksma, K. Schewior, and A. Tönnis.
9th International Conference on Fun with Algorithms (FUN 2018).
Download BIB-File
Network Congestion Games are Robust to Variable Demand ernet.in
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.
A QPTAS for the general scheduling problem with identical release dates. dagstuhl.de PDF
A. Antoniadis, R. Hoeksma, J. Meissner, J. Verschae, and A. Wiese
The 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017).
Download BIB-File
Decomposition algorithm for the single machine scheduling polytope. springer.com
R. Hoeksma, B. Manthey, and M. Uetz.
Combinatorial Optimization: Third International Symposium (ISCO 2014).
Approximability of Connected Factors. springer.com
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. springer.com
R. Hoeksma and M. Uetz.
Integer Programming and Combinatorial Optimization: 16th International Conference (IPCO 2013).
The price of anarchy for minsum related machine scheduling. springer.com
R. Hoeksma and M. Uetz.
Approximation and Online Algorithms: 9th International Workshop (WAOA 2011).
Pre-publications
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. arxiv.org
A. Antoniadis, K. Fleszar, R. Hoeksma, and K. Schewior.
2018, arXiv:1804.03953
Approximability of Connected Factors. arxiv.org
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. sciencedirect.com PDF
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. PDF sciencedirect.com
R. Hoeksma and M. Uetz.
Discrete Optimization (2018), DOI: 10.1016/j.disopt.2018.08.001.
Download BIB-File
Approximation Algorithms for Connected Graph Factors of Minimum Weight. springer.com
K. Cornelissen, R. Hoeksma, B. Manthey, N.S. Narayanaswamy, C.S. Rahul, and M. Waanders.
Theory of Computing Systems, 62(2):441—464, 2018.
external PDF-File on springer.com
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types. PDF informs.org
R. Hoeksma and M. Uetz.
Operations Research, 64(6):1438—1450, 2016.
Download BIB-File
Efficient implementation of Carathéodory’s theorem for the single machine scheduling polytope. PDF sciencedirect.com
R. Hoeksma, B. Manthey, and M. Uetz.
Discrete Applied Mathematics, 215:136—145, 2016.
Download BIB-File
Theses
Mechanisms for scheduling games with selfish players. PDF utwente.nl
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. PDF utwente.nl
R. Hoeksma. R. Hoeksma, University of Twente. MSc Thesis, 2010.