Kevin Schewior

Available identifiers

zbMath Open schewior.kevinMaRDI QIDQ1644936

List of research outcomes

Publication	Date of Publication	Type
Improved approximation algorithms for the expanding search problem	2025-01-06	Paper
Threshold testing and semi-online prophet inequalities	2025-01-06	Paper
Incremental maximization via continuization	2024-11-14	Paper
Simple algorithms for stochastic score classification with small approximation ratios	2024-07-16	Paper
Stochastic Probing with Increasing Precision	2024-01-10	Paper
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden	2023-10-23	Paper
Knapsack secretary through boosting	2023-07-25	Paper
Improved bounds for open online dial-a-ride on the line	2023-04-28	Paper
Speed-robust scheduling: sand, bricks, and rocks	2023-03-14	Paper
Optimally Handling Commitment Issues in Online Throughput Maximization	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875473	2023-02-03	Paper
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution	2022-06-27	Paper
Online search for a hyperplane in high-dimensional Euclidean space	2022-06-03	Paper
https://portal.mardi4nfdi.de/entity/Q5075745	2022-05-11	Paper
Tight Bounds for Online TSP on the Line	2022-02-08	Paper
Speed-robust scheduling. Sand, bricks, and rocks	2021-12-21	Paper
A stronger impossibility for fully online matching	2021-12-13	Paper
Online multistage subset maximization problems	2021-07-26	Paper
A PTAS for Euclidean TSP with Hyperplane Neighborhoods	2021-05-03	Paper
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths	2021-04-28	Paper
A general framework for handling commitment in online throughput maximization	2020-08-28	Paper
https://portal.mardi4nfdi.de/entity/Q3305730	2020-08-11	Paper
A general framework for handling commitment in online throughput maximization	2020-02-06	Paper
A PTAS for Euclidean TSP with Hyperplane Neighborhoods	2019-10-15	Paper
Improved Bounds for Open Online Dial-a-Ride on the Line	2019-07-03	Paper
The Itinerant List Update problem	2019-01-15	Paper
An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization	2018-12-05	Paper
Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing	2018-10-09	Paper
Tight Bounds for Online TSP on the Line	2018-07-16	Paper
An ℴ(log m)-Competitive Algorithm for Online Machine Minimization	2018-07-16	Paper
A tight lower bound for online convex optimization with switching costs	2018-06-22	Paper
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs	2017-08-31	Paper
Chasing Convex Bodies and Functions	2016-05-03	Paper

Research outcomes over time

This page was built for person: Kevin Schewior