Yunyun Deng

According to our database, Yunyun Deng authored at least 4 papers between 2018 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms.

Yunyun Deng, Longkun Guo, Kewen Liao, Yi Chen

Theor. Comput. Sci., 2021

2020

LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors.

Yunyun Deng, Yi Chen, Kewen Liao, Longkun Guo

Proceedings of the Theory and Applications of Models of Computation, 2020

2018

A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths.

Longkun Guo, Yunyun Deng, Kewen Liao, Qiang He, Timos Sellis, Zheshan Hu

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Exact Algorithms for Finding Partial Edge-Disjoint Paths.

Yunyun Deng, Longkun Guo, Peihuang Huang

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018