Kelin Luo

44 papers A* 2A 4B 5C 2Misc 4Journal 23Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones.
CoRR
Thomas Erlebach, Kelin Luo, Wen Zhang
2025 B conf
Algorithms for the Collaborative Delivery Problem with Monitored Constraints.
WALCOM
Lotte Blank, Kien C. Huynh, Kelin Luo, Anurag Murty Naredla
2025 A conf
Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously.
STACS
Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin
2025 J jnl
Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously.
CoRR
Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin
2025 A conf
Connected k-Median with Disjoint and Non-Disjoint Clusters.
ESA
Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt
2025 J jnl
Connected k-Median with Disjoint and Non-disjoint Clusters.
CoRR
Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt
2025 — conf
On the Hardness of the Drone Delivery Problem.
CIAC (2)
Simon Bartlmae, Andreas Hene, Kelin Luo
2025 J jnl
On the Hardness of the Drone Delivery Problem.
CoRR
Simon Bartlmae, Andreas Hene, Kelin Luo
2025 — conf
The Subinterval Cover Problem.
IJTCS-FAW
Kelin Luo, Chenran Yang, Zonghan Yang, Yuhao Zhang
2024 J jnl
Connected k-Center and k-Diameter Clustering.
Algorithmica
Lukas Drexler, Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2024 J jnl
Minimizing the Maximum Flow Time in the Online Food Delivery Problem.
Algorithmica
Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang
2024 J jnl
Online car-sharing problem with variable booking times.
J. Comb. Optim.
Haodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang
2023 J jnl
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem.
Proc. VLDB Endow.
Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo
2023 A* conf
Connected k-Center and k-Diameter Clustering.
ICALP
Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2023 J jnl
Online generalized assignment problem with historical information.
Comput. Oper. Res.
Haodong Liu, Huili Zhang, Kelin Luo, Yao Xu, Yinfeng Xu, Weitian Tong
2023 J jnl
Solving large-scale dynamic vehicle routing problems with stochastic requests.
Eur. J. Oper. Res.
Jian Zhang, Kelin Luo, Alexandre M. Florio, Tom Van Woensel
2022 J jnl
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem.
CoRR
Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo
2022 — conf
Algorithms for Online Car-Sharing Problem.
CALDAM
Xiangyu Guo, Kelin Luo
2022 J jnl
Car-sharing between two locations: Online scheduling with flexible advance bookings.
Discret. Appl. Math.
Kelin Luo, Thomas Erlebach, Yinfeng Xu
2022 J jnl
Connected k-Center and k-Diameter Clustering.
CoRR
Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla
2022 J jnl
Learn from history for online bipartite matching.
J. Comb. Optim.
Huili Zhang, Rui Du, Kelin Luo, Weitian Tong
2022 J jnl
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems.
Algorithms
Kelin Luo, Frits C. R. Spieksma
2022 B conf
Minimizing the Maximum Flow Time in the Online Food Delivery Problem.
ISAAC
Xiangyu Guo, Kelin Luo, Shi Li, Yuhao Zhang
2022 J jnl
Online crowdsourced truck delivery using historical information.
Eur. J. Oper. Res.
Huili Zhang, Kelin Luo, Yao Xu, Yinfeng Xu, Weitian Tong
2022 J jnl
Online scheduling of car-sharing request pairs between two locations.
J. Comb. Optim.
Kelin Luo, Yinfeng Xu, Haodong Liu
2022 B conf
Package Delivery Using Drones with Restricted Movement Areas.
ISAAC
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
2022 J jnl
Package Delivery Using Drones with Restricted Movement Areas.
CoRR
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
2022 A conf
The Multi-vehicle Ride-Sharing Problem.
WSDM
Kelin Luo, Chaitanya Agarwal, Syamantak Das, Xiangyu Guo
2022 J jnl
The online food delivery problem on stars.
Theor. Comput. Sci.
Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang
2021 — conf
Online Bin Packing with Overload Cost.
CALDAM
Kelin Luo, Frits C. R. Spieksma
2021 J jnl
Online Food Delivery to Minimize Maximum Flow Time.
CoRR
Xiangyu Guo, Shi Li, Kelin Luo, Yuhao Zhang
2020 Misc conf
Approximation Algorithms for Car-Sharing Problems.
COCOON
Kelin Luo, Frits C. R. Spieksma
2020 J jnl
Approximation algorithms for car-sharing problems.
CoRR
Kelin Luo, Frits C. R. Spieksma
2019 C conf
Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings.
COCOA
Haodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang
2019 A conf
Car-Sharing on a Star Network: On-Line Scheduling with k Servers.
STACS
Kelin Luo, Thomas Erlebach, Yinfeng Xu
2019 J jnl
On-line scheduling with monotone subsequence constraints.
Theor. Comput. Sci.
Kelin Luo, Yinfeng Xu, Huili Zhang
2019 A* conf
Two Moves per Time Step Make a Difference.
ICALP
Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner
2018 Misc conf
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings.
COCOON
Kelin Luo, Thomas Erlebach, Yinfeng Xu
2018 B conf
Car-Sharing between Two Locations: Online Scheduling with Two Servers.
MFCS
Kelin Luo, Thomas Erlebach, Yinfeng Xu
2018 J jnl
Creating an acceptable consensus ranking for group decision making.
J. Comb. Optim.
Kelin Luo, Yinfeng Xu, Bowen Zhang, Huili Zhang
2018 B conf
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.
ISAAC
Kelin Luo, Thomas Erlebach, Yinfeng Xu
2017 Misc conf
On-line Scheduling with a Monotonous Subsequence Constraint.
FAW
Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo
2016 Misc conf
Online Scheduling with Increasing Subsequence Serving Constraint.
FAW
Kelin Luo, Yin-Feng Xu, Xin Feng
2015 C conf
The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings.
COCOA
Kelin Luo, Yinfeng Xu