The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings. - Kelin Luo; Yinfeng Xu (COCOA, 2015)

Online Scheduling with Increasing Subsequence Serving Constraint. - Kelin Luo; Yin-Feng Xu; Xin Feng 001 (FAW, 2016)

On-line Scheduling with a Monotonous Subsequence Constraint. - Kelin Luo; Yinfeng Xu; Huili Zhang; Wei Luo (FAW, 2017)

Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. - Kelin Luo; Thomas Erlebach; Yinfeng Xu (ISAAC, 2018)

Car-Sharing between Two Locations: Online Scheduling with Two Servers. - Kelin Luo; Thomas Erlebach; Yinfeng Xu (MFCS, 2018)

Creating an acceptable consensus ranking for group decision making. - Kelin Luo; Yinfeng Xu; Bowen Zhang 003; Huili Zhang (J. Comb. Optim., 2018)

Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings. - Haodong Liu; Kelin Luo; Yinfeng Xu; Huili Zhang (COCOA, 2019)

Two Moves per Time Step Make a Difference. - Thomas Erlebach; Frank Kammer; Kelin Luo; Andrej Sajenko; Jakob T. Spooner (ICALP, 2019)

Car-Sharing on a Star Network: On-Line Scheduling with k Servers. - Kelin Luo; Thomas Erlebach; Yinfeng Xu (STACS, 2019)

On-line scheduling with monotone subsequence constraints. - Kelin Luo; Yinfeng Xu; Huili Zhang (Theor. Comput. Sci., 2019)

Approximation Algorithms for Car-Sharing Problems. - Kelin Luo; Frits C. R. Spieksma (COCOON, 2020)

Online Bin Packing with Overload Cost. - Kelin Luo; Frits C. R. Spieksma (CALDAM, 2021)

Online Food Delivery to Minimize Maximum Flow Time. - Xiangyu Guo; Shi Li 001; Kelin Luo; Yuhao Zhang 001 (CoRR, 2021)

Algorithms for Online Car-Sharing Problem. - Xiangyu Guo; Kelin Luo (CALDAM, 2022)

Package Delivery Using Drones with Restricted Movement Areas. - Thomas Erlebach; Kelin Luo; Frits C. R. Spieksma (ISAAC, 2022)

The Multi-vehicle Ride-Sharing Problem. - Kelin Luo; Chaitanya Agarwal; Syamantak Das; Xiangyu Guo (WSDM, 2022)

Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems. - Kelin Luo; Frits C. R. Spieksma (Algorithms, 2022)

Car-sharing between two locations: Online scheduling with flexible advance bookings. - Kelin Luo; Thomas Erlebach; Yinfeng Xu (Discret. Appl. Math., 2022)

Online crowdsourced truck delivery using historical information. - Huili Zhang; Kelin Luo; Yao Xu; Yinfeng Xu; Weitian Tong (Eur. J. Oper. Res., 2022)

Online scheduling of car-sharing request pairs between two locations. - Kelin Luo; Yinfeng Xu; Haodong Liu (J. Comb. Optim., 2022)

Learn from history for online bipartite matching. - Huili Zhang; Rui Du; Kelin Luo; Weitian Tong (J. Comb. Optim., 2022)

The online food delivery problem on stars. - Xiangyu Guo; Kelin Luo; Zhihao Gavin Tang; Yuhao Zhang 001 (Theor. Comput. Sci., 2022)

Connected k-Center and k-Diameter Clustering. - Lukas Drexler; Jan Eube; Kelin Luo; Heiko Röglin; Melanie Schmidt 001; Julian Wargalla (ICALP, 2023)

Online generalized assignment problem with historical information. - Haodong Liu; Huili Zhang; Kelin Luo; Yao Xu; Yinfeng Xu; Weitian Tong (Comput. Oper. Res., 2023)

Solving large-scale dynamic vehicle routing problems with stochastic requests. - Jian Zhang 045; Kelin Luo; Alexandre M. Florio; Tom Van Woensel (Eur. J. Oper. Res., 2023)

A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. - Kelin Luo; Alexandre M. Florio; Syamantak Das; Xiangyu Guo (Proc. VLDB Endow., 2023)

Minimizing the Maximum Flow Time in the Online Food Delivery Problem. - Xiangyu Guo; Shi Li 001; Kelin Luo; Yuhao Zhang 001 (Algorithmica, 2024)

Online car-sharing problem with variable booking times. - Haodong Liu; Kelin Luo; Yinfeng Xu; Huili Zhang (J. Comb. Optim., 2024)

Connected k-Center and k-Diameter Clustering. - Lukas Drexler; Jan Eube; Kelin Luo; Dorian Reineccius; Heiko Röglin; Melanie Schmidt 001; Julian Wargalla (Algorithmica, 2024)

On the Hardness of the Drone Delivery Problem. - Simon Bartlmae; Andreas Hene; Kelin Luo (CIAC (2), 2025)

The Subinterval Cover Problem. - Kelin Luo; Chenran Yang; Zonghan Yang; Yuhao Zhang 001 (IJTCS-FAW, 2025)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. - Matthias Kaul; Kelin Luo; Matthias Mnich; Heiko Röglin (STACS, 2025)

Algorithms for the Collaborative Delivery Problem with Monitored Constraints. - Lotte Blank; Kien C. Huynh; Kelin Luo; Anurag Murty Naredla (WALCOM, 2025)

Connected k-Median with Disjoint and Non-disjoint Clusters. - Jan Eube; Kelin Luo; Dorian Reineccius; Heiko Röglin; Melanie Schmidt 001 (CoRR, 2025)