| 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 | 115* | 2019 |
| 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 | 78 | 2015 |
| 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 | 61 | 2017 |
| 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 | 60 | 2011 |
| 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 | 41 | 2016 |
| 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 | 33* | 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 | 31 | 2017 |
| Online Multistage Subset Maximization Problems E Bampis, B Escoffier, K Schewior, A Teiller European Symposium on Algorithms (ESA), 11:1-11:14, 2019 | 27 | 2019 |
| 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 | 20* | 2021 |
| 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 | 18 | 2019 |
| 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 | 16 | 2018 |
| 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 | 14* | 2019 |
| 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 | 14 | 2019 |
| 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 | 12 | 2021 |
| Speed-Robust Scheduling F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon Integer Programming and Combinatorial Optimization (IPCO), 283–296, 2021 | 11* | 2021 |
| 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 | 11 | 2016 |
| Routing Games with Progressive Filling T Harks, M Hoefer, K Schewior, A Skopalik IEEE/ACM Transactions on Networking 24 (4), 2553–2562, 2016 | 10 | 2016 |
| A Stronger Impossibility for Fully Online Matching A Eckl, A Kirschbaum, M Leichter, K Schewior Operations Research Letters 49 (5), 802–808, 2021 | 9 | 2021 |
| Optimally Handling Commitment Issues in Online Throughput Maximization F Eberle, N Megow, K Schewior European Symposium on Algorithms (ESA), 41:1–41:15, 2020 | 9* | 2020 |
| Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis C Franz, G Mogk, T Mrziglod, K Schewior International Joint Conference on Artificial Intelligence (IJCAI), 4747–4753, 2022 | 6 | 2022 |
Paul David DüttingResearch Scientist at Googlegoogle.com의 이메일 확인됨
