New Results on Online Resource Minimization. - Lin Chen 009; Nicole Megow; Kevin Schewior (CoRR, 2014)

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. - Nikhil Bansal 001; Anupam Gupta 001; Ravishankar Krishnaswamy; Kirk Pruhs; Kevin Schewior; Clifford Stein 001 (APPROX-RANDOM, 2015)

An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization. - Lin Chen 009; Nicole Megow; Kevin Schewior (CoRR, 2015)

Chasing Convex Bodies and Functions. - Antonios Antoniadis 001; Neal Barcelo; Michael Nugent; Kirk Pruhs; Kevin Schewior; Michele Scquizzato (LATIN, 2016)

An O(log m)-Competitive Algorithm for Online Machine Minimization. - Lin Chen 009; Nicole Megow; Kevin Schewior (SODA, 2016)

The Power of Migration in Online Machine Minimization. - Lin Chen 009; Nicole Megow; Kevin Schewior (SPAA, 2016)

Routing Games With Progressive Filling. - Tobias Harks; Martin Hoefer 001; Kevin Schewior; Alexander Skopalik (IEEE/ACM Trans. Netw., 2016)

Handling critical tasks online: deadline scheduling and convex-body chasing. - Kevin Schewior (2016)

Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing. - Kevin Schewior (OR, 2017)

A Tight Lower Bound for Online Convex Optimization with Switching Costs. - Antonios Antoniadis 001; Kevin Schewior (WAOA, 2017)

SUPERSET: A (Super)Natural Variant of the Card Game SET. - Fábio Botler; Andrés Cristi; Ruben Hoeksma; Kevin Schewior; Andreas Tönnis (FUN, 2018)

The Itinerant List Update Problem. - Neil Olver; Kirk Pruhs; Kevin Schewior; René Sitters; Leen Stougie (WAOA, 2018)

Prophet Inequalities for Independent Random Variables from an Unknown Distribution. - José R. Correa; Paul Dütting; Felix A. Fischer; Kevin Schewior (CoRR, 2018)

An O(log m)-Competitive Algorithm for Online Machine Minimization. - Lin Chen 009; Nicole Megow; Kevin Schewior (SIAM J. Comput., 2018)

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution. - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior (EC, 2019)

Optimally Handling Commitment Issues in Online Throughput Maximization. - Franziska Eberle; Nicole Megow; Kevin Schewior (ESA, 2020)

Streaming Algorithms for Online Selection Problems. - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior; Bruno Ziliotto (CoRR, 2020)

Speed-Robust Scheduling. - Franziska Eberle; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Kevin Schewior; Bertrand Simon 001 (CoRR, 2020)

A general framework for handling commitment in online throughput maximization. - Lin Chen 009; Franziska Eberle; Nicole Megow; Kevin Schewior; Clifford Stein 001 (Math. Program., 2020)

A PTAS for Euclidean TSP with Hyperplane Neighborhoods. - Antonios Antoniadis 001; Krzysztof Fleszar 001; Ruben Hoeksma; Kevin Schewior (ACM Trans. Algorithms, 2020)

Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract). - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior; Bruno Ziliotto (ITCS, 2021)

Online Multistage Subset Maximization Problems. - Evripidis Bampis; Bruno Escoffier; Kevin Schewior; Alexandre Teiller (Algorithmica, 2021)

A stronger impossibility for fully online matching. - Alexander Eckl; Anja Kirschbaum; Marilena Leichter; Kevin Schewior (Oper. Res. Lett., 2021)

An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. - Chien-Chung Huang 001; Mathieu Mari; Claire Mathieu; Kevin Schewior; Jens Vygen (SIAM J. Discret. Math., 2021)

Tight Bounds for Online TSP on the Line. - Antje Bjelde; Jan Hackfeld; Yann Disser; Christoph Hansknecht; Maarten Lipmann; Julie Meißner; Miriam Schlöter; Kevin Schewior; Leen Stougie (ACM Trans. Algorithms, 2021)

Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis. - Christopher Franz; Georg Mogk; Thomas Mrziglod; Kevin Schewior (IJCAI, 2022)

Knapsack Secretary Through Boosting. - Andreas Abels; Leon Ladewig; Kevin Schewior; Moritz Stinzendörfer (WAOA, 2022)

Online search for a hyperplane in high-dimensional Euclidean space. - Antonios Antoniadis 001; Ruben Hoeksma; Sándor Kisfaludi-Bak; Kevin Schewior (Inf. Process. Lett., 2022)

Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution. - José Correa 001; Paul Dütting; Felix A. Fischer; Kevin Schewior (Math. Oper. Res., 2022)

Threshold Testing and Semi-Online Prophet Inequalities. - Martin Hoefer 001; Kevin Schewior (ESA, 2023)

Improved Approximation Algorithms for the Expanding Search Problem. - Svenja M. Griesbach; Felix Hommelsheim; Max Klimm; Kevin Schewior (ESA, 2023)

Incremental Maximization via Continuization. - Yann Disser; Max Klimm; Kevin Schewior; David Weckbecker (ICALP, 2023)

Trading Prophets. - José Correa 001; Andrés Cristi; Paul Duetting; MohammadTaghi Hajiaghayi; Jan Olkowski; Kevin Schewior (EC, 2023)

Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs. - Lukas Drexler; Jan Höckendorff; Joshua Könen; Kevin Schewior (CoRR, 2023)

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. - Franziska Eberle; Nicole Megow; Kevin Schewior (ACM Trans. Algorithms, 2023)

Speed-robust scheduling: sand, bricks, and rocks. - Franziska Eberle; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Kevin Schewior; Bertrand Simon 001 (Math. Program., 2023)

Improved Bounds for Open Online Dial-a-Ride on the Line. - Alexander Birx; Yann Disser; Kevin Schewior (Algorithmica, 2023)

Scheduling on a Stochastic Number of Machines. - Moritz Buchem; Franziska Eberle; Hugo Kooki Kasuya Rosado; Kevin Schewior; Andreas Wiese (APPROX/RANDOM, 2024)

Quickly Determining Who Won an Election. - Lisa Hellerstein; Naifeng Liu; Kevin Schewior (ITCS, 2024)

Contract Design for Pandora's Box. - Martin Hoefer 001; Conrad Schecker; Kevin Schewior (CoRR, 2024)

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios. - Benedikt M. Plank; Kevin Schewior (SIAM J. Discret. Math., 2024)

Stochastic Probing with Increasing Precision. - Martin Hoefer 001; Kevin Schewior; Daniel Schmand (SIAM J. Discret. Math., 2024)

Non-Adaptive Evaluation of k-of- n Functions: Tight Gap and a Unit-Cost PTAS. - Mads Anker Nielsen; Lars Rohwedder; Kevin Schewior (APPROX/RANDOM, 2025)

Designing Exploration Contracts. - Martin Hoefer 001; Conrad Schecker; Kevin Schewior (STACS, 2025)

Replication and sequencing of unreliable jobs on m parallel machines: New results. - Alessandro Agnetis; Mario Benini; Paolo Detti; Ben Hermans; Marco Pranzo; Kevin Schewior (Comput. Oper. Res., 2025)

Stochastic scheduling with Bernoulli-type jobs through policy stratification. - Antonios Antoniadis 001; Ruben Hoeksma; Kevin Schewior; Marc Uetz (CoRR, 2025)

Non-Adaptive Evaluation of k-of-n Functions: Tight Gap and a Unit-Cost PTAS. - Mads Anker Nielsen; Lars Rohwedder; Kevin Schewior (CoRR, 2025)

Generating diversity and securing completeness in algorithmic retrosynthesis. - Florian Mrugalla; Christopher Franz; Yannic Alber; Georg Mogk; Martín Villalba; Thomas Mrziglod; Kevin Schewior (J. Cheminformatics, 2025)