Kevin Schewior

Daniel Schmand

SIAM J. Discret. Math., March, 2024

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios.

[BibT_eX]

[DOI]

Benedikt M. Plank

SIAM J. Discret. Math., 2024

Contract Design for Pandora's Box.

[BibT_eX]

[DOI]

Martin Hoefer

Conrad Schecker

CoRR, 2024

Quickly Determining Who Won an Election.

[BibT_eX]

[DOI]

Lisa Hellerstein

Naifeng Liu

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Scheduling on a Stochastic Number of Machines.

[BibT_eX]

[DOI]

Moritz Buchem

Franziska Eberle

Hugo Kooki Kasuya Rosado

Andreas Wiese

Proceedings of the Approximation, 2024

2023

Improved Bounds for Open Online Dial-a-Ride on the Line.

[BibT_eX]

[DOI]

Alexander Birx

Yann Disser

Algorithmica, May, 2023

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

[BibT_eX]

[DOI]

Math. Program., February, 2023

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden.

[BibT_eX]

[DOI]

Franziska Eberle

ACM Trans. Algorithms, January, 2023

Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs.

[BibT_eX]

[DOI]

CoRR, 2023

Trading Prophets.

[BibT_eX]

[DOI]

José Correa

Andrés Cristi

Paul Duetting

MohammadTaghi Hajiaghayi

Jan Olkowski

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Incremental Maximization via Continuization.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Improved Approximation Algorithms for the Expanding Search Problem.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Threshold Testing and Semi-Online Prophet Inequalities.

[BibT_eX]

[DOI]

Martin Hoefer

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution.

[BibT_eX]

[DOI]

Math. Oper. Res., 2022

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Knapsack Secretary Through Boosting.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Tight Bounds for Online TSP on the Line.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

A stronger impossibility for fully online matching.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Online Multistage Subset Maximization Problems.

[BibT_eX]

[DOI]

Algorithmica, 2021

Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

A PTAS for Euclidean TSP with Hyperplane Neighborhoods.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

A general framework for handling commitment in online throughput maximization.

[BibT_eX]

[DOI]

Math. Program., 2020

Speed-Robust Scheduling.

[BibT_eX]

[DOI]

CoRR, 2020

Streaming Algorithms for Online Selection Problems.

[BibT_eX]

[DOI]

CoRR, 2020

Optimally Handling Commitment Issues in Online Throughput Maximization.

[BibT_eX]

[DOI]

Franziska Eberle

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution.

[BibT_eX]

[DOI]

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

2018

An O(log m)-Competitive Algorithm for Online Machine Minimization.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Prophet Inequalities for Independent Random Variables from an Unknown Distribution.

[BibT_eX]

[DOI]

CoRR, 2018

The Itinerant List Update Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

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

[BibT_eX]

[DOI]

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

2017

A Tight Lower Bound for Online Convex Optimization with Switching Costs.

[BibT_eX]

[DOI]

Antonios Antoniadis

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2017, 2017

2016

Handling critical tasks online: deadline scheduling and convex-body chasing.

[BibT_eX]

[DOI]

PhD thesis, 2016

Routing Games With Progressive Filling.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

The Power of Migration in Online Machine Minimization.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

An O(log <i>m</i>)-Competitive Algorithm for Online Machine Minimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Chasing Convex Bodies and Functions.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization.

[BibT_eX]

[DOI]

CoRR, 2015

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs.

[BibT_eX]

[DOI]

Nikhil Bansal

Anupam Gupta

Ravishankar Krishnaswamy

Kirk Pruhs

Clifford Stein

Proceedings of the Approximation, 2015

2014

New Results on Online Resource Minimization.

[BibT_eX]

[DOI]