Publications
Below I am listing papers that have been (will shortly be) published in conference proceedings or journals. Similar lists can be found on DBLP and Google Scholar. I am also listing working papers.
Note: I have been working in fields in which publications in conference proceedings are valued comparably high to those in journals. Nevertheless I am usually preparing a journal version of my conference papers. Further, authors are usually ordered alphabetically. (Publication marked with an asterisk exempted from this paragraph.)
Working Papers (Submitted):
Approximation Algorithms and Heuristics for Sequencing Unreliable Jobs with Replication (with Alessandro Agnetis, Mario Benini, Paolo Detti, Ben Hermans, and Marco Pranzo)
Scheduling on a Stochastic Number of Machines (with Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, and Andreas Wiese)
Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs (with Lukas Drexler, Jan Höckendorff, and Joshua Könen)
Published Papers:
[29] Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
with Benedikt Plank
SIAM Journal on Discrete Mathematics, 2024+
[28] Quickly Determining Who Won an Election
with Lisa Hellerstein and Naifeng Liu
Innovations in Theoretical Computer Science (ITCS) 2024
[27] Threshold Testing and Semi-Online Prophet Inequalities
with Martin Hoefer
European Symposium on Algorithms (ESA) 2023
[26] Improved Approximation Algorithms for the Expanding Search Problem
with Svenja Griesbach, Felix Hommelsheim, and Max Klimm
European Symposium on Algorithms (ESA) 2023
[25] Trading Prophets
with Andrés Cristi, José Correa, Paul Dütting, MohammadTaghi HajiAghayi, and Jan Olkowski
ACM Conference on Economics and Computation (EC) 2023
[24] Incremental Maximization via Continuization
with Yann Disser, Max Klimm, and David Weckbecker
International Colloquium on Automata, Languages, and Programming (ICALP) 2023
[23] Knapsack Secretary Through Boosting
with Andreas Abels, Leon Ladewig, and Moritz Stinzendörfer
Workshop on Approximation and Online Algorithms (WAOA) 2022
[22] Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis
with Christopher Franz, Georg Mogk, and Thomas Mrziglod
International Joint Conference on Artificial Intelligence (IJCAI) 2022
- Distinguished Paper Award -
[21] Online Search for a Hyperplane in High-Dimensional Euclidean Space
with Antonios Antoniadis, Ruben Hoeksma, and Sandor Kisfaludi-Bak
Information Processing Letters, 2022
[20] Stochastic Probing with Increasing Precision
with Martin Hoefer and Daniel Schmand
SIAM Journal on Discrete Mathematics, 2023+
Preliminary Version in International Joint Conference on Artificial Intelligence (IJCAI) 2021
[19] Speed-Robust Scheduling [arXiv]
with Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, and Bertrand Simon
Mathematical Programming Series B, 2022
Preliminary Version in Conference on Integer Programming and Combinatorial Optimization (IPCO) 2021
[18] A Stronger Impossibility for Fully Online Matching [arXiv]
with Alexander Eckl, Marilena Leichter, and Anja Kirschbaum)
Operations Research Letters, 2021
[17] An Approximation Algorithm for Fully-Planar Edge-Disjoint Paths [arXiv]
with Chien-Chung Huang, Mathieu Mari, Claire Mathieu, and Jens Vygen
SIAM Journal on Discrete Mathematics, 2021
[16] Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility [arXiv] [talk]
with José Correa, Paul Dütting, Felix Fischer, and Bruno Ziliotto
Innovations in Theoretical Computer Science (ITCS) 2021
[15] Online Throughput Maximization on Unrelated Machines: Commitment is No Burden [arXiv]
with Franziska Eberle and Nicole Megow
ACM Transactions on Algorithms, 2022
Preminimary Version in European Symposium on Algorithms (ESA) 2020
[14] Online Multistage Subset Maximization Problems [arXiv]
with Evripidis Bampis, Bruno Escoffier, and Alexandre Teiller
Algorithmica, 2021
Preliminary Version in European Symposium on Algorithms (ESA) 2019
[13] Improved Bounds for Open Online Dial-a-Ride on the Line [DROPS]
with Alexander Birx and Yann Disser
Algorithmica, 2022
Preliminary Version in International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2019
[12] Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution [arXiv] [talk]
with José Correa, Paul Dütting, and Felix Fischer
Mathematics of Operations Research, 2021
Preliminary Version in ACM Conference on Economics and Computation (EC) 2019
- ACM SIGecom Award for Best Full Paper -
[11] A General Framework for Handling Commitment in Online Throughput Maximization [arXiv] [Open Access]
with Lin Chen, Franziska Eberle, Nicole Megow, and Clifford Stein
Mathematical Programming Series B, 2020
Preliminary Verison in Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019
[10] A PTAS for Euclidean TSP with Hyperplane Neighborhoods [arXiv]
with Antonios Antoniadis, Krzysztof Felszar, and Ruben Hoeksma
ACM Transactions on Algorithms, 2020
Preliminary Version in ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019
[9] The Itinerant List Update Problem
with Neil Olver, Kirk Pruhs, René Sitters, and Leen Stougie
Workshop on Approximation and Online Algorithms (WAOA) 2018
[8] A Tight Lower Bound for Online Convex Optimization with Switching Costs [pdf]
with Antonios Antoniadis
Workshop on Approximation and Online Algorithms (WAOA) 2017
[7] Tight Bounds for Online TSP on the Line [pdf]
with Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, and Leen Stougie
ACM Transactions on Algorithms, 2021
Preliminary Version in ACM-SIAM Symposium on Discrete Algorithms (SODA) 2017
[6] The Power of Migration in Online Machine Minimization [pdf]
with Lin Chen and Nicole Megow
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2016
[5] Chasing Convex Bodies and Functions [pdf]
with Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, and Michele Scquizzato
Latin American Theoretical Informatics Symposium (LATIN) 2016
[4] An O(log m)-Competitive Algorithm for Online Machine Minimization [pdf]
with Lin Chen and Nicole Megow
SIAM Journal on Computing, 2018
Preliminary Version in ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016
[3] A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs [DROPS]
with Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Clifford Stein
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2015
[2] Routing Games with Progressive Filling [arXiv]
with Tobias Harks, Martin Hoefer, and Alexander Skopalik
IEEE Transactions on Networking, 2016
Preliminary Version in IEEE International Conference on Computer Communications (INFOCOM) 2014
[1] CD8(+) T-Cell Response Promotes Evolution of Hepatitis C Virus Nonstructural Proteins* [original link]
with Marianne Ruhl, Torben Knuschke, Lejla Glavinic, Christoph Neumann-Haefelin, Dae-In Chang, Marina Klein, Falko M. Heinemann, Hannelore Tenckhoff, Manfred Wiese, Peter A. Horn, Sergei Viazov, Ulrich Spengler, Michael Roggendorf, Norbert Scherbaum, Jacob Nattermann, Daniel Hoffmann, Jörg Timm, and East German HCV Study Group (3rd author)
Gastroenterology, 2o11
Theses:
Handling Critical Tasks Online: Deadline Scheduling and Convex-Body Chasing [DepositOnce]
PhD Thesis
TU Berlin, June 2016
Bottleneck Routing Games (a.k.a. Bottelneck Routing Games) with Progressive Filling
Master's Thesis
RWTH Aachen, September 2012