Ruben Hoeksma

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 27

Top Topics

Single Machine Scheduling

Approximation Algorithms

Top Venues

Math. Oper. Res.

Publications

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197 (2) (2023)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. ICML (2023)
Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior
Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett. 177 (2022)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
On Hop-Constrained Steiner Trees in Tree-Like Metrics. SIAM J. Discret. Math. 36 (2) (2022)
Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene M. Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon
Paging with Succinct Predictions. CoRR (2022)
José R. Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals. Math. Oper. Res. 46 (4) (2021)
Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior
Online Search for a Hyperplane in High-Dimensional Euclidean Space. CoRR (2021)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO (2021)
Ruben Hoeksma, Matthew Maat
A better lower bound for Lower-Left Anchored Rectangle Packing. CoRR (2021)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics. CoRR (2020)
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms 16 (3) (2020)
Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
Speed-Robust Scheduling. CoRR (2020)
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. MFCS (2020)
Ruben Hoeksma, Marc Uetz
The price of anarchy for utilitarian scheduling games on related machines. Discret. Optim. 31 (2019)
Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke
On the Complexity of Anchored Rectangle Packing. ESA (2019)
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. SODA (2019)
Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen
Scheduling Self-Suspending Tasks: New and Old Results (Artifact). Dagstuhl Artifacts Ser. 5 (1) (2019)
Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, Georg von der Brüggen
Scheduling Self-Suspending Tasks: New and Old Results. ECRTS (2019)
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders
Approximation Algorithms for Connected Graph Factors of Minimum Weight. Theory Comput. Syst. 62 (2) (2018)
José R. Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld
Recent developments in prophet inequalities. SIGecom Exch. 17 (1) (2018)
Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN (2018)
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. CoRR (2018)
José R. Correa, Ruben Hoeksma, Marc Schröder
Network Congestion Games Are Robust to Variable Demand. WINE (2017)
José R. Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld
Posted Price Mechanisms for a Random Stream of Customers. EC (2017)
Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP (2017)
Ruben Hoeksma, Marc Uetz
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types. Oper. Res. 64 (6) (2016)
Ruben Hoeksma, Bodo Manthey, Marc Uetz
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope. Discret. Appl. Math. 215 (2016)
Ruben Hoeksma, Bodo Manthey, Marc Uetz
Decomposition Algorithm for the Single Machine Scheduling Polytope. ISCO (2014)
Ruben Hoeksma, Marc Uetz
Two Dimensional Optimal Mechanism Design for a Sequencing Problem. IPCO (2013)
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
Approximability of Connected Factors. WAOA (2013)
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
Approximability of Connected Factors. CoRR (2013)
Ruben Hoeksma, Marc Uetz
Two-dimensional optimal mechanism design for a single machine scheduling problem. CTW (2013)
Ruben Hoeksma, Marc Uetz
The Price of Anarchy for Minsum Related Machine Scheduling. WAOA (2011)