Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin Schewior
Person information
- affiliation: Universität zu Köln, Germany
- affiliation (Ph.D., 2016): Technische Universität Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Alexander Birx, Yann Disser
, Kevin Schewior:
Improved Bounds for Open Online Dial-a-Ride on the Line. Algorithmica 85(5): 1372-1414 (2023)- [j12]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197(2): 1009-1048 (2023) - [j11]Franziska Eberle, Nicole Megow, Kevin Schewior:
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. ACM Trans. Algorithms 19(1): 10:1-10:25 (2023) - [i17]Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior:
Improved Approximation Algorithms for the Expanding Search Problem. CoRR abs/2301.03638 (2023) - [i16]Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker:
Incremental Maximization via Continuization. CoRR abs/2305.01310 (2023) - 2022
- [j10]Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior:
Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett. 177: 106262 (2022) - [j9]José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior:
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution. Math. Oper. Res. 47(2): 1287-1309 (2022) - [c21]Christopher Franz, Georg Mogk, Thomas Mrziglod, Kevin Schewior:
Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis. IJCAI 2022: 4747-4753 - [c20]Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer:
Knapsack Secretary Through Boosting. WAOA 2022: 61-81 - [i15]Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer:
Knapsack Secretary Through Boosting. CoRR abs/2208.05396 (2022) - [i14]Benedikt M. Plank, Kevin Schewior:
Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios. CoRR abs/2211.14082 (2022) - 2021
- [j8]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. Algorithmica 83(8): 2374-2399 (2021) - [j7]Alexander Eckl, Anja Kirschbaum, Marilena Leichter, Kevin Schewior:
A stronger impossibility for fully online matching. Oper. Res. Lett. 49(5): 802-808 (2021) - [j6]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. SIAM J. Discret. Math. 35(2): 752-769 (2021) - [j5]Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie:
Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms 17(1): 3:1-3:58 (2021) - [c19]Martin Hoefer, Kevin Schewior, Daniel Schmand:
Stochastic Probing with Increasing Precision. IJCAI 2021: 4069-4075 - [c18]José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior, Bruno Ziliotto:
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract). ITCS 2021: 86:1-86:1 - [c17]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling - Sand, Bricks, and Rocks. IPCO 2021: 283-296 - [i13]Alexander Eckl, Anja Kirschbaum, Marilena Leichter, Kevin Schewior:
A Stronger Impossibility for Fully Online Matching. CoRR abs/2102.09432 (2021) - [i12]Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior:
Online Search for a Hyperplane in High-Dimensional Euclidean Space. CoRR abs/2109.04340 (2021) - 2020
- [j4]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein:
A general framework for handling commitment in online throughput maximization. Math. Program. 183(1): 215-247 (2020) - [j3]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms 16(3): 38:1-38:16 (2020) - [c16]Franziska Eberle, Nicole Megow, Kevin Schewior:
Optimally Handling Commitment Issues in Online Throughput Maximization. ESA 2020: 41:1-41:15 - [i11]Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. CoRR abs/2001.01715 (2020) - [i10]José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior, Bruno Ziliotto:
Streaming Algorithms for Online Selection Problems. CoRR abs/2007.06110 (2020) - [i9]Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
Speed-Robust Scheduling. CoRR abs/2011.05181 (2020)
2010 – 2019
- 2019
- [c15]Alexander Birx, Yann Disser, Kevin Schewior:
Improved Bounds for Open Online Dial-a-Ride on the Line. APPROX-RANDOM 2019: 21:1-21:22 - [c14]José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior:
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution. EC 2019: 3-17 - [c13]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. ESA 2019: 11:1-11:14 - [c12]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
A General Framework for Handling Commitment in Online Throughput Maximization. IPCO 2019: 141-154 - [c11]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. SODA 2019: 1089-1105 - [i8]Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller:
Online Multistage Subset Maximization Problems. CoRR abs/1905.04162 (2019) - [i7]Franziska Eberle, Nicole Megow, Kevin Schewior:
Optimally handling commitment issues in online throughput maximization. CoRR abs/1912.10769 (2019) - 2018
- [j2]Lin Chen, Nicole Megow, Kevin Schewior:
An O(log m)-Competitive Algorithm for Online Machine Minimization. SIAM J. Comput. 47(6): 2057-2077 (2018) - [c10]Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis:
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN 2018: 12:1-12:17 - [c9]Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie:
The Itinerant List Update Problem. WAOA 2018: 310-326 - [i6]Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. CoRR abs/1804.03953 (2018) - [i5]José R. Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior:
Prophet Inequalities for Independent Random Variables from an Unknown Distribution. CoRR abs/1811.06114 (2018) - [i4]Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein:
A general framework for handling commitment in online throughput maximization. CoRR abs/1811.08238 (2018) - 2017
- [c8]Kevin Schewior:
Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing. OR 2017: 25-29 - [c7]Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie:
Tight Bounds for Online TSP on the Line. SODA 2017: 994-1005 - [c6]Antonios Antoniadis, Kevin Schewior:
A Tight Lower Bound for Online Convex Optimization with Switching Costs. WAOA 2017: 164-175 - 2016
- [b1]Kevin Schewior:
Handling critical tasks online: deadline scheduling and convex-body chasing. Technical University of Berlin, Germany, 2016 - [j1]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing Games With Progressive Filling. IEEE/ACM Trans. Netw. 24(4): 2553-2562 (2016) - [c5]Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato:
Chasing Convex Bodies and Functions. LATIN 2016: 68-81 - [c4]Lin Chen, Nicole Megow, Kevin Schewior:
An O(log m)-Competitive Algorithm for Online Machine Minimization. SODA 2016: 155-163 - [c3]Lin Chen, Nicole Megow, Kevin Schewior:
The Power of Migration in Online Machine Minimization. SPAA 2016: 175-184 - 2015
- [c2]Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein:
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. APPROX-RANDOM 2015: 96-109 - [i3]Lin Chen, Nicole Megow, Kevin Schewior:
An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization. CoRR abs/1506.05721 (2015) - 2014
- [c1]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing games with progressive filling. INFOCOM 2014: 352-360 - [i2]Lin Chen, Nicole Megow, Kevin Schewior:
New Results on Online Resource Minimization. CoRR abs/1407.7998 (2014) - 2013
- [i1]Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik:
Routing Games with Progressive Filling. CoRR abs/1308.3161 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-05-11 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
