The Primal Simplex Approach to the QoS Routing Problem. - Ying Xiao 001; Krishnaiyan Thulasiraman; Guoliang Xue (QSHINE, 2004)

Approximation and Heuristic Algorithms for Delay Constrained Path Selection under Inaccurate State Information. - Ying Xiao 001; Krishnaiyan Thulasiraman; Guoliang Xue (QSHINE, 2004)

GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints. - Ying Xiao 001; Krishnaiyan Thulasiraman; Guoliang Xue (ISAAC, 2005)

Advances in QoS path(s) selection problem. - Krishnaiyan Thulasiraman; Ying Xiao 001; Guoliang Xue (ISCAS (1), 2005)

The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm. - Ying Xiao 001; Christoforos N. Hadjicostis; Krishnaiyan Thulasiraman (COCOON, 2006)

QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming. - Ying Xiao 001; Krishnaiyan Thulasiraman; Guoliang Xue (IEEE Trans. Computers, 2006)

Constrained shortest link-disjoint paths selection: a network programming based approach. - Ying Xiao 001; Krishnaiyan Thulasiraman; Guoliang Xue (IEEE Trans. Circuits Syst. I Regul. Pap., 2006)

Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes. - Ying Xiao 001; Krishnaiyan Thulasiraman; Xi Fang 001; Dejun Yang; Guoliang Xue (IEEE Trans. Computers, 2012)

QoS Routing Under Multiple Additive Constraints: A Generalization of the LARAC Algorithm. - Ying Xiao 001; Krishnaiyan Thulasiraman; Guoliang Xue; Mamta Yadav (IEEE Trans. Emerg. Top. Comput., 2016)