default search action
Ruben Hoeksma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Wouter Fokkema, Ruben Hoeksma, Marc Uetz:
Price of Anarchy for Graphic Matroid Congestion Games. SAGT 2024: 371-388 - [i9]Ruben Hoeksma, Gavin Speek, Marc Uetz:
Stochastic Minimum Spanning Trees with a Single Sample. CoRR abs/2409.16119 (2024) - 2023
- [j11]Franziska Eberle
, Ruben Hoeksma
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197(2): 1009-1048 (2023) - [c14]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: 952-968 - 2022
- [j10]Antonios Antoniadis
Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett. 177: 106262 (2022) - [j9]Martin Böhm, Ruben Hoeksma
On Hop-Constrained Steiner Trees in Tree-Like Metrics. SIAM J. Discret. Math. 36(2): 1249-1273 (2022) - [i8]Antonios Antoniadis, Joan Boyar, Marek Eliás
Paging with Succinct Predictions. CoRR abs/2210.02775 (2022) - 2021
- [j8]José Correa
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals. Math. Oper. Res. 46(4): 1452-1478 (2021) - [c13]Franziska Eberle, Ruben Hoeksma
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO 2021: 283-296 - [i7]Ruben Hoeksma
A better lower bound for Lower-Left Anchored Rectangle Packing. CoRR abs/2102.05747 (2021) - [i6]Antonios Antoniadis, Ruben Hoeksma
Online Search for a Hyperplane in High-Dimensional Euclidean Space. CoRR abs/2109.04340 (2021) - 2020
- [j7]Antonios Antoniadis, Krzysztof Fleszar
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms 16(3): 38:1-38:16 (2020) - [c12]Martin Böhm, Ruben Hoeksma
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. MFCS 2020: 18:1-18:15 - [i5]Martin Böhm, Ruben Hoeksma
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics. CoRR abs/2003.05699 (2020) - [i4]Franziska Eberle, Ruben Hoeksma
Speed-Robust Scheduling. CoRR abs/2011.05181 (2020)
2010 – 2019
- 2019
- [j6]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): 06:1-06:3 (2019) - [j5]Ruben Hoeksma
The price of anarchy for utilitarian scheduling games on related machines. Discret. Optim. 31: 29-39 (2019) - [c11]Jian-Jia Chen
Scheduling Self-Suspending Tasks: New and Old Results. ECRTS 2019: 16:1-16:23 - [c10]Antonios Antoniadis
On the Complexity of Anchored Rectangle Packing. ESA 2019: 8:1-8:14 - [c9]Antonios Antoniadis, Krzysztof Fleszar
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. SODA 2019: 1089-1105 - 2018
- [j4]Kamiel Cornelissen, Ruben Hoeksma
Approximation Algorithms for Connected Graph Factors of Minimum Weight. Theory Comput. Syst. 62(2): 441-464 (2018) - [j3]José Correa, Patricio Foncea, Ruben Hoeksma
Recent developments in prophet inequalities. SIGecom Exch. 17(1): 61-70 (2018) - [c8]Fábio Botler
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN 2018: 12:1-12:17 - [i3]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. CoRR abs/1804.03953 (2018) - 2017
- [c7]Antonios Antoniadis, Ruben Hoeksma
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP 2017: 31:1-31:14 - [c6]José Correa, Patricio Foncea, Ruben Hoeksma
Posted Price Mechanisms for a Random Stream of Customers. EC 2017: 169-186 - [c5]José Correa, Ruben Hoeksma, Marc Schröder:
Network Congestion Games Are Robust to Variable Demand. WINE 2017: 397 - 2016
- [j2]Ruben Hoeksma
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope. Discret. Appl. Math. 215: 136-145 (2016) - [j1]Ruben Hoeksma
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types. Oper. Res. 64(6): 1438-1450 (2016) - 2014
- [c4]Ruben Hoeksma
Decomposition Algorithm for the Single Machine Scheduling Polytope. ISCO 2014: 280-291 - 2013
- [c3]Ruben Hoeksma
Two Dimensional Optimal Mechanism Design for a Sequencing Problem. IPCO 2013: 242-253 - [c2]Kamiel Cornelissen, Ruben Hoeksma
Approximability of Connected Factors. WAOA 2013: 120-131 - [e1]Kamiel Cornelissen, Ruben Hoeksma, Johann L. Hurink, Bodo Manthey:
12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. CTIT Workshop Proceedings WP 13-01, 2013 [contents] - [i2]Ruben Hoeksma, Marc Uetz:
Two-dimensional optimal mechanism design for a single machine scheduling problem. CTW 2013: 125-127 - [i1]Kamiel Cornelissen, Ruben Hoeksma
Approximability of Connected Factors. CoRR abs/1310.2387 (2013) - 2011
- [c1]Ruben Hoeksma
The Price of Anarchy for Minsum Related Machine Scheduling. WAOA 2011: 261-273
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: