default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Kelin Luo
University at Buffalo, NY, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 40 matches
- 2024
- 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) - 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) - Kelin Ding, Jiayi Luo, Haohang Huang, John M. Hart, Issam I. A. Qamhia, Erol Tutumluer:
Augmented Dataset for Vision-Based Analysis of Railroad Ballast via Multi-Dimensional Data Synthesis. Algorithms 17(8): 367 (2024) - Miao Wang, Kai Huang, Yue Luo, Guoqing Wang, Yong Chen, Kelin Zhong:
Dicluster: Differential Arrangements of Event Intervals Biclustering for Task Collaboration Safety Analysis. J. Aerosp. Inf. Syst. 21(11): 939-950 (2024) - Haodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang:
Online car-sharing problem with variable booking times. J. Comb. Optim. 47(3): 32 (2024) - 2023
- 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) - 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) - 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) - 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 - Cong Shen, Xiang Liu, Jiawei Luo, Kelin Xia:
Torsion Graph Neural Networks. CoRR abs/2306.13541 (2023) - Cong Shen, Pingjian Ding, Junjie Wee, Jialin Bi, Jiawei Luo, Kelin Xia:
Curvature-enhanced Graph Convolutional Network for Biomolecular Interaction Prediction. CoRR abs/2306.13699 (2023) - Cong Shen, Jiawei Luo, Kelin Xia:
Molecular geometric deep learning. CoRR abs/2306.15065 (2023) - 2022
- Kelin Luo, Frits C. R. Spieksma:
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems. Algorithms 15(2): 30 (2022) - Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-sharing between two locations: Online scheduling with flexible advance bookings. Discret. Appl. Math. 313: 53-66 (2022) - 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) - Kelin Luo, Yinfeng Xu, Haodong Liu:
Online scheduling of car-sharing request pairs between two locations. J. Comb. Optim. 43(5): 1240-1263 (2022) - Huili Zhang, Rui Du, Kelin Luo, Weitian Tong:
Learn from history for online bipartite matching. J. Comb. Optim. 44(5): 3611-3640 (2022) - Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang:
The online food delivery problem on stars. Theor. Comput. Sci. 928: 13-26 (2022) - Xiangyu Guo, Kelin Luo:
Algorithms for Online Car-Sharing Problem. CALDAM 2022: 224-236 - Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. ISAAC 2022: 49:1-49:16 - 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 - Kelin Luo, Chaitanya Agarwal, Syamantak Das, Xiangyu Guo:
The Multi-vehicle Ride-Sharing Problem. WSDM 2022: 628-637 - Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. CoRR abs/2209.12314 (2022) - 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) - 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
- Kelin Luo, Frits C. R. Spieksma:
Online Bin Packing with Overload Cost. CALDAM 2021: 3-15 - Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang:
Online Food Delivery to Minimize Maximum Flow Time. CoRR abs/2110.15772 (2021) - 2020
- Kelin Luo, Frits C. R. Spieksma:
Approximation Algorithms for Car-Sharing Problems. COCOON 2020: 262-273 - Kelin Luo, Frits C. R. Spieksma:
Approximation algorithms for car-sharing problems. CoRR abs/2007.03057 (2020) - 2019
- Kelin Luo, Yinfeng Xu, Huili Zhang:
On-line scheduling with monotone subsequence constraints. Theor. Comput. Sci. 786: 13-25 (2019)
skipping 10 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-24 12:35 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint