Skip to content

Publications

Check my Google Scholar and DBLP for a more up-to-date publication list.

Manuscripts

Conferences

  • Online Food Delivery to Minimize Maximum Flow Time. (ISAAC'22)

    (α) Xiangyu Guo, Shi Li, K. Luo, Yuhao Zhang.

  • Package Delivery Using Drones with Restricted Movement Areas. (ISAAC'22)

    (α) Thomas Erlebach, K. Luo, Frits C. R. Spieksma.

  • The Multi-vehicle Ride-sharing Problem. (WSDM'22)

    K. Luo, Chaitanya Agarwal, Syamantak Das, Xiangyu Guo.

  • Online Bin Packing with Overload Cost. (CALDAM'21)

    K. Luo, Frits C. R. Spieksma.

  • Approximation Algorithms for Car-Sharing Problems. (COCOON'20)

    K. Luo, Frits C. R. Spieksma.

  • Car-Sharing Problem: Online Scheduling with Flexible Advance Bookings. (COCOA'19)

    Haodong Liu, K. Luo, Yinfeng Xu, Huili Zhang.

  • Two Moves per Time Step Make a Difference. (ICALP'19)

    Thomas Erlebach, Frank Kammer, K. Luo, Andrej Sajenko, Jakob T. Spooner.

  • 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, Thomas Erlebach, Yinfeng Xu.

  • On-line Scheduling with a Monotonous Subsequence Constraint. (FAW'17)

    K. Luo, Yinfeng Xu, Huili Zhang, Wei Luo.

  • Online Scheduling with Increasing Subsequence Serving Constraint. (FAW'16)

    K. Luo, Yin-Feng Xu, Xin Feng.

  • The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings. (COCOA'15)

    K. Luo, Yinfeng Xu.

Journals

  • Solving Large-Scale Dynamic Vehicle Routing Problems with Stochastic Requests (Euro. J. Oper. Res., 2022)

    Jian Zhang, K. Luo, Alexandre M Florio, Tom Van Woensel.

  • Online crowdsourced truck delivery using historical information (Euro. J. Oper. Res., 2022)

    Huili Zhang, K. Luo, Yao Xu, Yinfeng Xu, Weitian Tong.

  • The online food delivery problem on stars (Theor. Comput. Sci., 2022)

    Xiangyu Guo, K. Luo, Zhihao Gavin Tang, Yuhao Zhang.

  • Online generalized assignment problem with historical information (Comput. and Oper. Res., 2022)

    Haodong Liu, Huili Zhang, K. Luo, Yao Xu, Yinfeng Xu, Weitian Tong

  • Learn from history for online bipartite matching (J Comb. Optim., 2022)

    Huili Zhang, Rui Du, K. Luo, Weitian Tong.

  • On-line scheduling with monotone subsequence constraints (Theor. Comput. Sci., 2020)

    K. Luo, Yinfeng Xu, Huili Zhang.

  • Creating an acceptable consensus ranking for group decision making (J Comb. Optim., 2018)

    K. Luo, Yinfeng Xu, Bowen Zhang, Huili Zhang.