Kevin Schewior

From MaRDI portal
Person:1644936

Available identifiers

zbMath Open schewior.kevinMaRDI QIDQ1644936

List of research outcomes





PublicationDate of PublicationType
Improved approximation algorithms for the expanding search problem2025-01-06Paper
Threshold testing and semi-online prophet inequalities2025-01-06Paper
Incremental maximization via continuization2024-11-14Paper
Simple algorithms for stochastic score classification with small approximation ratios2024-07-16Paper
Stochastic Probing with Increasing Precision2024-01-10Paper
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden2023-10-23Paper
Knapsack secretary through boosting2023-07-25Paper
Improved bounds for open online dial-a-ride on the line2023-04-28Paper
Speed-robust scheduling: sand, bricks, and rocks2023-03-14Paper
Optimally Handling Commitment Issues in Online Throughput Maximization2023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58754732023-02-03Paper
Prophet inequalities for independent and identically distributed random variables from an unknown distribution2022-06-27Paper
Online search for a hyperplane in high-dimensional Euclidean space2022-06-03Paper
https://portal.mardi4nfdi.de/entity/Q50757452022-05-11Paper
Tight Bounds for Online TSP on the Line2022-02-08Paper
Speed-robust scheduling. Sand, bricks, and rocks2021-12-21Paper
A stronger impossibility for fully online matching2021-12-13Paper
Online multistage subset maximization problems2021-07-26Paper
A PTAS for Euclidean TSP with hyperplane neighborhoods2021-05-03Paper
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths2021-04-28Paper
A general framework for handling commitment in online throughput maximization2020-08-28Paper
\textsc{Superset}: A (super)natural variant of the card game \textsc{Set}2020-08-11Paper
A general framework for handling commitment in online throughput maximization2020-02-06Paper
A PTAS for Euclidean TSP with hyperplane neighborhoods2019-10-15Paper
Improved Bounds for Open Online Dial-a-Ride on the Line2019-07-03Paper
The itinerant list update problem2019-01-15Paper
An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization2018-12-05Paper
Handling critical jobs online: deadline scheduling and convex-body chasing2018-10-09Paper
Tight bounds for online TSP on the line2018-07-16Paper
An \(\mathcal{O}(\log m)\)-competitive algorithm for online machine minimization2018-07-16Paper
A tight lower bound for online convex optimization with switching costs2018-06-22Paper
A 2-competitive algorithm for online convex optimization with switching costs2017-08-31Paper
Chasing convex bodies and functions2016-05-03Paper

Research outcomes over time

This page was built for person: Kevin Schewior