Kevin Schewior
Kevin Schewior
Postdoc, Department of Math and CS, Universität zu Köln
Geverifieerd e-mailadres voor informatik.uni-koeln.de - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
A 2-Competitive Algorithm for Online Convex Optimization with Switching Costs
N Bansal, A Gupta, R Krishnaswamy, K Pruhs, K Schewior, C Stein
Conference on Approximation Algorithms for Combinatorial Optimization …, 2015
532015
CD8+ T-Cell Response Promotes Evolution of Hepatitis C Virus Nonstructural Proteins
M Ruhl, T Knuschke, K Schewior, L Glavinic, C Neumann-Haefelin, ...
Gastroenterology 140 (7), 2064–2073, 2011
522011
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution
J Correa, P Dütting, F Fischer, K Schewior
ACM Conference on Economics and Computation (EC), 3–17, 2019
382019
Tight Bounds for Online TSP on the Line
A Bjelde, Y Disser, J Hackfeld, C Hansknecht, M Lipmann, J Meißner, ...
ACM-SIAM Symposium on Discrete Algorithms (SODA), 994–1005, 2017
322017
Chasing Convex Bodies and Functions
A Antoniadis, N Barcelo, M Nugent, K Pruhs, K Schewior, M Scquizzato
Latin American Symposium on Theoretical Informatics (LATIN), 68–81, 2016
272016
An O(log m)-Competitive Agorithm for Online Machine Minimization
L Chen, N Megow, K Schewior
ACM-SIAM Symposium on Discrete Algorithms (SODA), 155–163, 2016
22*2016
A Tight Lower Bound for Online Convex Optimization with Switching Costs
A Antoniadis, K Schewior
Workshop on Approximation and Online Algorithms (WAOA), 164–175, 2017
162017
Online Multistage Subset Maximization Problems
E Bampis, B Escoffier, K Schewior, A Teiller
European Symposium on Algorithms (ESA), 11:1-11:14, 2019
132019
The Power of Migration in Online Machine Minimization
L Chen, N Megow, K Schewior
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 175–184, 2016
112016
A General Framework for Handling Commitment in Online Throughput Maximization
L Chen, F Eberle, N Megow, K Schewior, C Stein
Integer Programming and Combinatorial Optimization (IPCO), 141–154, 2019
72019
Improved Bounds for Open Online Dial-a-Ride on the Line
A Birx, Y Disser, K Schewior
Conference on Approximation Algorithms for Combinatorial Optimization …, 2019
62019
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
A Antoniadis, K Fleszar, R Hoeksma, K Schewior
ACM-SIAM Symposium on Discrete Algorithms (SODA), 1089–1105, 2019
62019
Routing Games with Progressive Filling
T Harks, M Hoefer, K Schewior, A Skopalik
IEEE/ACM Transactions on Networking 24 (4), 2553–2562, 2016
62016
The Itinerant List Update Problem
N Olver, K Pruhs, K Schewior, R Sitters, L Stougie
Workshop on Online and Approximation Algorithms (WAOA), 310–326, 2018
52018
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
CC Huang, M Mari, C Mathieu, K Schewior, J Vygen
SIAM Journal on Discrete Mathematics 35 (2), 752–769, 2021
42021
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility
J Correa, P Dütting, F Fischer, K Schewior, B Ziliotto
Innovations in Thereotical Computer Science (ITCS), 86:1–86:1, 2021
3*2021
Handling Critical Tasks Online: Deadline Scheduling and Convex-Body Chasing
K Schewior
Technische Univerität Berlin, 2016
32016
A Stronger Impossibility for Fully Online Matching
A Eckl, A Kirschbaum, M Leichter, K Schewior
Operations Research Letters, 2021
12021
Optimally Handling Commitment Issues in Online Throughput Maximization
F Eberle, N Megow, K Schewior
European Symposium on Algorithms (ESA), 41:1–41:15, 2020
12020
Online Search for a Hyperplane in High-Dimensional Euclidean Space
A Antoniadis, R Hoeksma, S Kisfaludi-Bak, K Schewior
arXiv:2109.04340, 2021
2021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20