The Web Proxy Location Problem in the Tree Networks. - Guangting Chen; Gu Zhang; Wei Ding 006 (CCCT (1), 2004)

A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices. - Wei Ding 006; Guoliang Xue (COCOA, 2009)

Diameter-Constrained Steiner Tree. - Wei Ding 006; Guohui Lin; Guoliang Xue (COCOA (2), 2010)

A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree. - Wei Ding 006; Guoliang Xue (COCOA (2), 2010)

A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges. - Wei Ding 006; Guoliang Xue (COCOA, 2011)

Diameter-Constrained Steiner Trees. - Wei Ding 006; Guohui Lin; Guoliang Xue (Discret. Math. Algorithms Appl., 2011)

A Divide-and-Conquer Algorithm for Finding a Most Reliable Source on a Ring-Embedded Tree Network with Unreliable Edges. - Wei Ding 006; Guoliang Xue (Discret. Math. Algorithms Appl., 2011)

A linear time algorithm for computing a most reliable source on a tree network with faulty nodes. - Wei Ding 006; Guoliang Xue (Theor. Comput. Sci., 2011)

An Improved Approximation Algorithm for the Bandpass Problem. - Weitian Tong; Randy Goebel; Wei Ding 006; Guohui Lin (FAW-AAIM, 2012)

On the Minimum Diameter Cost-Constrained Steiner Tree Problem. - Wei Ding 006; Guoliang Xue (COCOA, 2012)

On the 2-MRS Problem in a Tree with Unreliable Edges. - Wei Ding 006; Yu Zhou; Guangting Chen; Hongfa Wang; Guangming Wang (J. Appl. Math., 2013)

Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights. - Wei Ding 006; Guohui Lin (AAIM, 2014)

Weighted Cache Location Problem with Identical Servers. - Hongfa Wang; Wei Ding 006 (J. Appl. Math., 2014)

Algorithms for the minimum diameter terminal Steiner tree problem. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2014)

Minimum diameter cost-constrained Steiner trees. - Wei Ding 006; Guoliang Xue (J. Comb. Optim., 2014)

Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs. - Wei Ding 006; Ke Qiu 001 (COCOA, 2015)

An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges. - Yu Zhou; Wei Ding 006; Guangming Wang; Guangting Chen (Asia Pac. J. Oper. Res., 2015)

A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract). - Wei Ding 006; Ke Qiu 001 (COCOA, 2016)

An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2017)

Incremental single-source shortest paths in digraphs with arbitrary positive arc weights. - Wei Ding 006; Ke Qiu 001 (Theor. Comput. Sci., 2017)

Minimum Diameter k-Steiner Forest. - Wei Ding 006; Ke Qiu 001 (AAIM, 2018)

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2018)

Low-Dimensional Vectors with Density Bounded by 5/6 Are Pinwheel Schedulable. - Wei Ding 006 (AAIM, 2019)

Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs. - Wei Ding 006; Ke Qiu 001 (AAIM, 2019)

Updating Matrix Polynomials. - Wei Ding 006; Ke Qiu 001 (AAIM, 2019)

Sifting Edges to Accelerate the Computation of Absolute 1-Center in Graphs. - Wei Ding 006; Ke Qiu 001 (WCGO, 2019)

Approximating the restricted 1-center in graphs. - Wei Ding 006; Ke Qiu 001 (Theor. Comput. Sci., 2019)

Minimum Diameter Vertex-Weighted Steiner Tree. - Wei Ding 006; Ke Qiu 001 (AAIM, 2020)

Approximating the asymmetric p-center problem in parameterized complete digraphs. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2020)

A branch-and-cut approach to examining the maximum density guarantee for pinwheel schedulability of low-dimensional vectors. - Wei Ding 006 (Real Time Syst., 2020)

A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem. - Wei Ding 006; Ke Qiu 001 (Theor. Comput. Sci., 2020)

Finding Cheapest Deadline Paths. - Wei Ding 006 (COCOON, 2021)

A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs. - Wei Ding 006; Ke Qiu 001; Yu Zhou; Zhou Ye (J. Comb. Optim., 2022)