Ruben Hoeksma

Orcid: 0000-0002-6553-7242

According to our database1, Ruben Hoeksma authored at least 26 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Speed-robust scheduling: sand, bricks, and rocks.
Math. Program., February, 2023

Paging with Succinct Predictions.
Proceedings of the International Conference on Machine Learning, 2023

2022
On Hop-Constrained Steiner Trees in Tree-Like Metrics.
SIAM J. Discret. Math., 2022

Online search for a hyperplane in high-dimensional Euclidean space.
Inf. Process. Lett., 2022

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

A better lower bound for Lower-Left Anchored Rectangle Packing.
CoRR, 2021

2020
A PTAS for Euclidean TSP with Hyperplane Neighborhoods.
ACM Trans. Algorithms, 2020

Speed-Robust Scheduling.
CoRR, 2020

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
The price of anarchy for utilitarian scheduling games on related machines.
Discret. Optim., 2019

Scheduling Self-Suspending Tasks: New and Old Results (Artifact).
Dagstuhl Artifacts Ser., 2019

On the Complexity of Anchored Rectangle Packing.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Scheduling Self-Suspending Tasks: New and Old Results.
Proceedings of the 31st Euromicro Conference on Real-Time Systems, 2019

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

Approximation Algorithms for Connected Graph Factors of Minimum Weight.
Theory Comput. Syst., 2018

SUPERSET: A (Super)Natural Variant of the Card Game SET.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
Network Congestion Games Are Robust to Variable Demand.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

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

A QPTAS for the General Scheduling Problem with Identical Release Dates.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types.
Oper. Res., 2016

Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope.
Discret. Appl. Math., 2016

2014
Decomposition Algorithm for the Single Machine Scheduling Polytope.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Approximability of Connected Factors.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Two Dimensional Optimal Mechanism Design for a Sequencing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Two-dimensional optimal mechanism design for a single machine scheduling problem.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011
The Price of Anarchy for Minsum Related Machine Scheduling.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011


  Loading...