Decision Making and Analysis for Unexpected Road Blockages. - Bing Su 002; Yinfeng Xu (ICEB, 2004)

A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem. - Bing Su 002; Yinfeng Xu; Peng Xiao; Lei Tian (COCOA, 2008)

Finding an anti-risk path between two nodes in undirected graphs. - Peng Xiao; Yinfeng Xu; Bing Su 002 (J. Comb. Optim., 2009)

The canadian traveller problem and its competitive analysis. - Yinfeng Xu; Maolin Hu; Bing Su 002; Binhai Zhu; Zhijun Zhu (J. Comb. Optim., 2009)

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. - Siu-Wing Cheng; Yuya Higashikawa; Naoki Katoh; Guanqun Ni; Bing Su 002; Yinfeng Xu (TAMC, 2013)

Baseline Bounded half-Plane Voronoi Diagram. - Bing Su 002; Yinfeng Xu; Binhai Zhu (Discret. Math. Algorithms Appl., 2013)

On the Exact Block Cover Problem. - Haitao Jiang; Bing Su 002; Mingyu Xiao 001; Yinfeng Xu; Farong Zhong; Binhai Zhu (AAIM, 2014)

A note on visibility-constrained Voronoi diagrams. - Franz Aurenhammer; Bing Su 002; Yin-Feng Xu; Binhai Zhu (Discret. Appl. Math., 2014)

Minimax regret 1-sink location problem in dynamic path networks. - Yuya Higashikawa; John Augustine; Siu-Wing Cheng; Mordecai J. Golin; Naoki Katoh; Guanqun Ni; Bing Su 002; Yin-Feng Xu (Theor. Comput. Sci., 2015)

Hitting a Set of Line Segments with One or Two Discrete Centers. - Xiaozhou He; Zhihui Liu; Bing Su 002; Yinfeng Xu; Feifeng Zheng; Binhai Zhu (CCCG, 2018)

An Approximation Framework for Bounded Facility Location Problems. - Wenchang Luo; Bing Su 002; Yao Xu; Guohui Lin (COCOON, 2018)

Approximation algorithms for the three-machine proportionate mixed shop scheduling. - Longcheng Liu; Yong Chen 002; Jianming Dong; Randy Goebel; Guohui Lin; Yue Luo; Guanqun Ni; Bing Su 002; An Zhang 001 (CoRR, 2018)

A 21/16-Approximation for the Minimum 3-Path Partition Problem. - Yong Chen 002; Randy Goebel; Bing Su 002; Weitian Tong; Yao Xu; An Zhang 001 (ISAAC, 2019)

An improved approximation algorithm for the minimum 3-path partition problem. - Yong Chen 002; Randy Goebel; Guohui Lin; Bing Su 002; Yao Xu; An Zhang 001 (J. Comb. Optim., 2019)

Efficient algorithms for computing one or two discrete centers hitting a set of line segments. - Xiaozhou He; Zhihui Liu; Bing Su 002; Yinfeng Xu; Feifeng Zheng; Binhai Zhu (J. Comb. Optim., 2019)

An approximation scheme for rejection-allowed single-machine rescheduling. - Wenchang Luo; Miaomiao Jin; Bing Su 002; Guohui Lin (Comput. Ind. Eng., 2020)

A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. - Yong Chen 002; Guohui Lin; Tian Liu 001; Taibo Luo; Bing Su 002; Yao Xu; Peng Zhang 008 (J. Comb. Optim., 2020)

Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. - Jianming Dong; Joshua Chang; Bing Su 002; Jueliang Hu; Guohui Lin (J. Sched., 2020)

Open-shop scheduling for unit jobs under precedence constraints. - Yong Chen 002; Randy Goebel; Guohui Lin; Bing Su 002; An Zhang 001 (Theor. Comput. Sci., 2020)

Approximation algorithms for the three-machine proportionate mixed shop scheduling. - Longcheng Liu; Yong Chen 002; Jianming Dong; Randy Goebel; Guohui Lin; Yue Luo; Guanqun Ni; Bing Su 002; Yao Xu; An Zhang 001 (Theor. Comput. Sci., 2020)

Minimizing total job completion time in MapReduce scheduling. - Jianming Dong; Randy Goebel; Jueliang Hu; Guohui Lin; Bing Su 002 (Comput. Ind. Eng., 2021)

An efficient polynomial-time approximation scheme for parallel multi-stage open shops. - Jianming Dong; Ruyan Jin; Guohui Lin; Bing Su 002; Weitian Tong; Yao Xu (CoRR, 2022)

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. - Yong Chen 002; Yinhui Cai; Longcheng Liu; Guangting Chen; Randy Goebel; Guohui Lin; Bing Su 002; An Zhang 001 (J. Comb. Optim., 2022)

A local search 4/3-approximation algorithm for the minimum 3-path partition problem. - Yong Chen 002; Randy Goebel; Guohui Lin; Longcheng Liu; Bing Su 002; Weitian Tong; Yao Xu; An Zhang 001 (J. Comb. Optim., 2022)

A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. - Wenchang Luo; Rylan Chin; Alexander Cai; Guohui Lin; Bing Su 002; An Zhang 001 (J. Comb. Optim., 2022)

Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. - Mingyang Gong; Guohui Lin; Bing Su 002 (COCOON (1), 2024)

A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. - Mingyang Gong; Guohui Lin; Eiji Miyano; Bing Su 002; Weitian Tong (Ann. Oper. Res., 2024)

Improved approximation algorithms for multiprocessor indivisible coflow scheduling. - Mingyang Gong; Guangting Chen; Guohui Lin; Bing Su 002 (J. Comb. Optim., 2025)