Yong Chen

Yong Chen, Professor.He received his PhD degree from the Department of Mathematics, Zhejiang University (supervised by Prof. Zhiyi Tan and Prof. Enyu Yao) in 2011, and his research interests are in the area of algorithm design and analysis, with a focus on the theoretical and practical studies of algorithms for combinatorial optimization, graph theory and network optimization, scheduling and discrete optimization problems in mathematical modeling.

Jan.2022-       Professor, Department of Mathematics at Hangzhou Dianzi University

Feb.2016-Feb.2017  Visiting Scholar at University of Alberta (Mentor: Prof.Guohui Lin)

Jan.2015-Dec.2021  Associate Professor, Department of Mathematics at Hangzhou Dianzi University

Jul.2011-Dec.2014  Lecture, Department of Mathematics at Hangzhou Dianzi University

My main research area is algorithm design, a sub-area of operational research (OR) and theoretical computer science (TCS). More specifically, I design fast approximation algorithms with provable guarantees for different discrete optimization problems. The problems I studied include graph partition, network routing and design, scheduling and other related combinatorial optimization problems. 

Journal Papers

2024:

Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin*, Yao Xu, and An Zhang.
Approximating the directed path partition problems. Information and Computation, 297, 105150, 2024.

2023:

Jingwei Xie, Yong Chen, An Zhang, and Guangting Chen*. 

Approximation Algorithms for Graph Partition into Bounded Independent Sets. Tsinghua Science and Technology, 28(6), 1063–1071, 2023.

An Zhang, Tan Zhen, Yong Chen, Guangting Chen. 

An improved algorithm for parallel machine scheduling under additional resource constraints. Optim. Lett. 17(3): 753-769 (2023) 

An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang. 

Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. Theor. Comput. Sci. 941: 167-179 (2023)

2022:

Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin*, Bing Su, and An Zhang. Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. Journal of Combinatorial Optimization. 43, 571-588, 2022.

Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang:
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3): 1753-1773 (2022)

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

2021:

Yong Chen, Zhi-Zhong Chen, Guohui Lin*, Yao Xu, and An Zhang. 

Approximation algorithms for maximally balanced connected graph partition. Algorithmica. 83, 3715-3740, 2021.

Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1): 12-27 (2021)

Yong Chen, An Zhang, Zhiyi Tan, Ying Xue, Guangting Chen:
A (1.5+ε)-approximation algorithm for scheduling on two parallel machines with job delivery coordination. J. Oper. Res. Soc. 72(9): 1929-1942 (2021) 

Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang:
Improved hardness and approximation results for single allocation hub location problems. Theor. Comput. Sci. 864: 10-19 (2021)

Xiaojuan Jiang, An Zhang, Yong Chen, Guangting Chen, Kangbok Lee:
An improved algorithm for a two-stage production scheduling problem with an outsourcing option. Theor. Comput. Sci. 876: 59-69 (2021)

Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang:
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. 882: 77-108 (2021)

2020:

An Zhang, Yong Chen, Zhi-Zhong Chen, and Guohui Lin*. 

Improved approximation algorithms for path vertex covers in regular graphs. Algorithmica. 82, 3041-3064, 2020.

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang:
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020)

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

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

2011-2019 Please see DBLP:  https://dblp.org/pid/67/6351-2.html