Ruben Hoeksma

According to our database, Ruben Hoeksma authored at least 28 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Stochastic Minimum Spanning Trees with a Single Sample.

Ruben Hoeksma, Gavin Speek, Marc Uetz

CoRR, 2024

Price of Anarchy for Graphic Matroid Congestion Games.

Wouter Fokkema, Ruben Hoeksma, Marc Uetz

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

2023

Speed-robust scheduling: sand, bricks, and rocks.

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon

Math. Program., February, 2023

Paging with Succinct Predictions.

Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon

Proceedings of the International Conference on Machine Learning, 2023

2022

On Hop-Constrained Steiner Trees in Tree-Like Metrics.

Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

SIAM J. Discret. Math., 2022

Online search for a hyperplane in high-dimensional Euclidean space.

Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior

Inf. Process. Lett., 2022

2021

Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals.

José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld

Math. Oper. Res., 2021

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

Ruben Hoeksma, Matthew T. Maat

CoRR, 2021

2020

A PTAS for Euclidean TSP with Hyperplane Neighborhoods.

Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior

ACM Trans. Algorithms, 2020

Speed-Robust Scheduling.

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon

CoRR, 2020

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.

Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

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.

Ruben Hoeksma, Marc Uetz

Discret. Optim., 2019

Scheduling Self-Suspending Tasks: New and Old Results (Artifact).

Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen

Dagstuhl Artifacts Ser., 2019

On the Complexity of Anchored Rectangle Packing.

Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Scheduling Self-Suspending Tasks: New and Old Results.

Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen

Proceedings of the 31st Euromicro Conference on Real-Time Systems, 2019

2018

Recent developments in prophet inequalities.

José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld

SIGecom Exch., 2018

Approximation Algorithms for Connected Graph Factors of Minimum Weight.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders

Theory Comput. Syst., 2018

SUPERSET: A (Super)Natural Variant of the Card Game SET.

Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Network Congestion Games Are Robust to Variable Demand.

José Correa, Ruben Hoeksma, Marc Schröder

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Posted Price Mechanisms for a Random Stream of Customers.

José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

A QPTAS for the General Scheduling Problem with Identical Release Dates.

Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types.

Ruben Hoeksma, Marc Uetz

Oper. Res., 2016

Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope.

Ruben Hoeksma, Bodo Manthey, Marc Uetz

Discret. Appl. Math., 2016

2014

Decomposition Algorithm for the Single Machine Scheduling Polytope.

Ruben Hoeksma, Bodo Manthey, Marc Uetz

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

Approximability of Connected Factors.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Two Dimensional Optimal Mechanism Design for a Sequencing Problem.

Ruben Hoeksma, Marc Uetz

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Two-dimensional optimal mechanism design for a single machine scheduling problem.

Ruben Hoeksma, Marc Uetz

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011

The Price of Anarchy for Minsum Related Machine Scheduling.

Ruben Hoeksma, Marc Uetz

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011