default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKelin Luo
Person information
- affiliation: University at Buffalo, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. Algorithmica 86(4): 907-943 (2024)- [j13]Lukas Drexler, Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. Algorithmica 86(11): 3425-3464 (2024) - [j12]Haodong Liu, Kelin Luo
, Yinfeng Xu, Huili Zhang:
Online car-sharing problem with variable booking times. J. Comb. Optim. 47(3): 32 (2024) - 2023
- [j11]Haodong Liu, Huili Zhang, Kelin Luo, Yao Xu, Yinfeng Xu, Weitian Tong:
Online generalized assignment problem with historical information. Comput. Oper. Res. 149: 106047 (2023) - [j10]Jian Zhang, Kelin Luo, Alexandre M. Florio, Tom Van Woensel:
Solving large-scale dynamic vehicle routing problems with stochastic requests. Eur. J. Oper. Res. 306(2): 596-614 (2023) - [j9]Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo:
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. Proc. VLDB Endow. 16(5): 1195-1207 (2023) - [c16]Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. ICALP 2023: 50:1-50:20 - 2022
- [j8]Kelin Luo, Frits C. R. Spieksma:
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems. Algorithms 15(2): 30 (2022) - [j7]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-sharing between two locations: Online scheduling with flexible advance bookings. Discret. Appl. Math. 313: 53-66 (2022) - [j6]Huili Zhang, Kelin Luo, Yao Xu, Yinfeng Xu, Weitian Tong:
Online crowdsourced truck delivery using historical information. Eur. J. Oper. Res. 301(2): 486-501 (2022) - [j5]Kelin Luo, Yinfeng Xu, Haodong Liu:
Online scheduling of car-sharing request pairs between two locations. J. Comb. Optim. 43(5): 1240-1263 (2022) - [j4]Huili Zhang, Rui Du, Kelin Luo, Weitian Tong:
Learn from history for online bipartite matching. J. Comb. Optim. 44(5): 3611-3640 (2022) - [j3]Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang:
The online food delivery problem on stars. Theor. Comput. Sci. 928: 13-26 (2022) - [c15]Xiangyu Guo, Kelin Luo:
Algorithms for Online Car-Sharing Problem. CALDAM 2022: 224-236 - [c14]Xiangyu Guo, Kelin Luo, Shi Li, Yuhao Zhang:
Minimizing the Maximum Flow Time in the Online Food Delivery Problem. ISAAC 2022: 33:1-33:18 - [c13]Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. ISAAC 2022: 49:1-49:16 - [c12]Kelin Luo, Chaitanya Agarwal, Syamantak Das, Xiangyu Guo:
The Multi-vehicle Ride-Sharing Problem. WSDM 2022: 628-637 - [i5]Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. CoRR abs/2209.12314 (2022) - [i4]Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo:
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. CoRR abs/2210.05000 (2022) - [i3]Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Connected k-Center and k-Diameter Clustering. CoRR abs/2211.02176 (2022) - 2021
- [c11]Kelin Luo, Frits C. R. Spieksma:
Online Bin Packing with Overload Cost. CALDAM 2021: 3-15 - [i2]Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Online Food Delivery to Minimize Maximum Flow Time. CoRR abs/2110.15772 (2021) - 2020
- [c10]Kelin Luo, Frits C. R. Spieksma:
Approximation Algorithms for Car-Sharing Problems. COCOON 2020: 262-273 - [i1]Kelin Luo, Frits C. R. Spieksma:
Approximation algorithms for car-sharing problems. CoRR abs/2007.03057 (2020)
2010 – 2019
- 2019
- [j2]Kelin Luo, Yinfeng Xu, Huili Zhang:
On-line scheduling with monotone subsequence constraints. Theor. Comput. Sci. 786: 13-25 (2019) - [c9]Haodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang:
Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings. COCOA 2019: 340-351 - [c8]Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner:
Two Moves per Time Step Make a Difference. ICALP 2019: 141:1-141:14 - [c7]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing on a Star Network: On-Line Scheduling with k Servers. STACS 2019: 51:1-51:14 - 2018
- [j1]Kelin Luo, Yinfeng Xu, Bowen Zhang, Huili Zhang:
Creating an acceptable consensus ranking for group decision making. J. Comb. Optim. 36(1): 307-328 (2018) - [c6]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. COCOON 2018: 242-254 - [c5]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ISAAC 2018: 64:1-64:13 - [c4]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing between Two Locations: Online Scheduling with Two Servers. MFCS 2018: 50:1-50:14 - 2017
- [c3]Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo:
On-line Scheduling with a Monotonous Subsequence Constraint. FAW 2017: 187-195 - 2016
- [c2]Kelin Luo, Yin-Feng Xu, Xin Feng:
Online Scheduling with Increasing Subsequence Serving Constraint. FAW 2016: 135-144 - 2015
- [c1]Kelin Luo, Yinfeng Xu:
The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings. COCOA 2015: 758-770
Coauthor Index
aka: Yinfeng Xu
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2024-10-25 20:14 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:
