Kelin Luo's Homepage

Kelin Luo (骆柯琳)

Assistant Professor of Teaching
Department of Computer Science and Engineering
State University of New York at Buffalo

Office

306 Davis Hall, Buffalo, NY 14260, USA. Phone: (716) 645-1589

Email

[first name] + [last name]@buffalo.edu

Bio

Assistant Professor of Teaching: Department of Computer Science and Engineering, University at Buffalo (2023.09 - current)
Postdoc: Hausdorff Center of Mathematics and Institute of Computer Science, University of Bonn, Germany (2022.01 - 2023.08)
Postdoc: Department of Mathematics and Computer Science, Eindhoven University of Technology (TU/e), Netherlands. (2019.10 - 2021.12)

Education

Ph.D: Xi'an Jiaotong University, China (2019.06)
BS: Northwest University, China (2014.06)

Research Interests: Theory and Algorithms

design and analysis of algorithms on combinatorial optimization problems
vehicle routing, ride-sharing, scheduling, clustering, bin packing and network design
online algorithms, approximation algorithms

Teaching

• (Under Construction) CSE632 Analysis of Algorithms II (Spring 2025)

• (Under Construction) CSE531B Algorithm Analysis and Design (Spring 2025)

• CSE431B/531B Algorithm Analysis and Design (Fall 2024)

• CSE531C Algorithm Analysis and Design (Fall 2024)

• CSE250 Data Structures (Summer 2024)

• CSE431/531A Algorithm Analysis and Design (Spring 2024)

• CSE531B Algorithm Analysis and Design (Spring 2024)

• CSE431/531B Algorithm Analysis and Design (Fall 2023)

• CSE531C Algorithm Analysis and Design (Fall 2023)

Other courses:

• MA-INF 1206: Seminar Randomized and Approximation Algorithms at University of Bonn, Germany (Winter 2022)

Publications

Conferences

Matthias Kaul, K. Luo, Matthias Mnich, Heiko Röglin. Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously . (accepted STACS'25)

Lotte Blank, Kien Huynh, K. Luo, Anurag Murty Naredla. Algorithms for the Collaborative Delivery Problem with Monitored Constraints. (accepted WALCOM'25)

K. Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo. A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem (VLDB'23)
Lukas Drexler, Jan Eube, K. Luo, Heiko Röglin, Melanie Schmidt, Julian Wargalla. Connected k-center and k-diameter clustering. (ICALP'23)
Xiangyu Guo, Shi Li, K. Luo, Yuhao Zhang. Online Food Delivery to Minimize Maximum Flow Time. (ISAAC'22)
Thomas Erlebach, K. Luo, Frits C. R. Spieksma. Package Delivery Using Drones with Restricted Movement Areas. (ISAAC'22)
K. Luo, Chaitanya Agarwal, Syamantak Das, Xiangyu Guo. The Multi-vehicle Ride-sharing Problem. (WSDM'22)
K. Luo, Frits C. R. Spieksma. Online Bin Packing with Overload Cost. (CALDAM'21)
K. Luo, Frits C. R. Spieksma. Approximation Algorithms for Car-Sharing Problems. (COCOON'20)
Haodong Liu, K. Luo, Yinfeng Xu, Huili Zhang. Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings. (COCOA'19)
Thomas Erlebach, Frank Kammer, K. Luo, Andrej Sajenko, Jakob T. Spooner. Two Moves per Time Step Make a Difference. (ICALP'19)
K. Luo, Thomas Erlebach, Yinfeng Xu. Car-Sharing on a Star Network: On-Line Scheduling with k Servers. (STACS'19)
K. Luo, Thomas Erlebach, Yinfeng Xu. Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. (COCOON'18) (journal version in Disc. Appl. Math., 2022)
K. Luo, Thomas Erlebach, Yinfeng Xu. Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. (ISAAC'18)
K. Luo, Thomas Erlebach, Yinfeng Xu. Car-Sharing between Two Locations: Online Scheduling with Two Servers. (MFCS'18)
K. Luo, Yinfeng Xu, Huili Zhang, Wei Luo. On-line Scheduling with a Monotonous Subsequence Constraint. (FAW'17)
K. Luo, Yin-Feng Xu, Xin Feng. Online Scheduling with Increasing Subsequence Serving Constraint. (FAW'16)
K. Luo, Yinfeng Xu. The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings. (COCOA'15)

Journals

Lukas Drexler, Jan Eube, K. Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, Julian Wargalla. Connected k-Center and k-Diameter Clustering. (Algorithmica, 2024)
Xiangyu Guo, Shi Li, K. Luo, Yuhao Zhang. Minimizing the Maximum Flow Time in the Online Food Delivery Problem. (Algorithmica, 2024)
Haodong Liu, K. Luo, Yinfeng Xu, Huili Zhang Online car-sharing problem with variable booking times. (J Comb. Optim., 2024)
Jian Zhang, K. Luo, Alexandre M Florio, Tom Van Woensel. Solving Large-Scale Dynamic Vehicle Routing Problems with Stochastic Requests (Euro. J. Oper. Res., 2022)
Huili Zhang, K. Luo, Yao Xu, Yinfeng Xu, Weitian Tong. Online crowdsourced truck delivery using historical information (Euro. J. Oper. Res., 2022)
Xiangyu Guo, K. Luo, Zhihao Gavin Tang, Yuhao Zhang. The online food delivery problem on stars (Theor. Comput. Sci., 2022)
Haodong Liu, Huili Zhang, K. Luo, Yao Xu, Yinfeng Xu, Weitian Tong. Online generalized assignment problem with historical information (Comput. and Oper. Res., 2022)
Huili Zhang, Rui Du, K. Luo, Weitian Tong. Learn from history for online bipartite matching (J Comb. Optim., 2022)
K. Luo, Yinfeng Xu, Huili Zhang. On-line scheduling with monotone subsequence constraints (Theor. Comput. Sci., 2020)
K. Luo, Yinfeng Xu, Bowen Zhang, Huili Zhang. Creating an acceptable consensus ranking for group decision making (J Comb. Optim., 2018)

Last modified: 14/09/2024