Reflecting on My ACM ICPC and CCPC Experiences (3 EC-final Golds & 7 regional Golds)
Announced in ACM ICPC/CCPC, 2021
Posts by Collection
competitions
2nd in China & 5th Globally at IEEExtreme 15
Announced in IEEEXtreme, 2021
1st in China & 4th Globally at IEEExtreme 16
Announced in IEEEXtreme, 2022
1st in China & 9th Globally at IEEExtreme 17
Announced in IEEEXtreme, 2023
1st in China & 15th Globally at IEEExtreme 18
Announced in IEEEXtreme, 2024
publications
Connectivity in the Presence of an Opponent
Published in Annual European Symposium on Algorithms, 2023
Recommended citation: Zihui Liang, Bakh Khoussainov, Toru Takisaka, and Mingyu Xiao. Connectivity in the Presence of an Opponent. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 79:1-79:14, Schloss Dagstuhl – Leibniz-Zentrum fur Informatik (2023)
Download Paper
Topological Network-Control Games
Published in International Computing and Combinatorics Conference, 2023
Recommended citation: Liang, Z., Khoussainov, B., Yang, H. (2024). Topological Network-Control Games. In: Wu, W., Tong, G. (eds) Computing and Combinatorics. COCOON 2023. Lecture Notes in Computer Science, vol 14423. Springer, Cham. https://doi.org/10.1007/978-3-031-49193-1_11
Download Paper
Network control games played on graphs
Published in Theoretical Computer Science, 2025
Recommended citation: Liang, Z., Khoussainov, B., & Xiao, M. (2025). Network control games played on graphs. Theoretical Computer Science, 115123.
Download Paper
Topological Network-Control Games Played on Graphs
Published in International Computing and Combinatorics Conference, 2025
Recommended citation: Liang, Z., Khoussainov, B., Yang, H. (2025). Topological Network-Control Games Played on Graphs. In: Chen, Y., Gao, X., Sun, X., Zhang, A. (eds) Computing and Combinatorics. COCOON 2024. Lecture Notes in Computer Science, vol 15162. Springer, Singapore. https://doi.org/10.1007/978-981-96-1093-8_2
Download Paper
Deciding Regular Games: a Playground for Exponential Time Algorithms
Published in International Symposium on Mathematical Foundations of Computer Science, 2025
Recommended citation: Zihui Liang, Bakh Khoussainov, and Mingyu Xiao. Deciding Regular Games: a Playground for Exponential Time Algorithms. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 345, pp. 66:1-66:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.MFCS.2025.66
Download Paper