Robust network flow against attackers with knowledge of routing method. - Vorapong Suppakitpaisarn; Wenkai Dai; Jean-François Baffier (HPSR, 2015)

Reoptimization of Minimum Latency Problem. - Wenkai Dai (COCOON, 2017)

Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications. - Wenkai Dai; Yongjie Yang 001 (J. Comb. Optim., 2019)

Load-Optimization in Reconfigurable Networks: Algorithms and Complexity of Flow Routing. - Wenkai Dai; Klaus-Tycho Foerster; David Fuchssteiner; Stefan Schmid 001 (SIGMETRICS Perform. Evaluation Rev., 2020)

Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion. - Maciej Pacut; Wenkai Dai; Alexandre Labbe; Klaus-Tycho Foerster; Stefan Schmid 001 (Perform. Evaluation, 2021)

Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies. - Wenkai Dai; Michael Dinitz; Klaus-Tycho Foerster; Stefan Schmid 001 (DISC, 2022)

A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible. - Wenkai Dai; Klaus-Tycho Foerster; Stefan Schmid 001 (SPAA, 2023)

Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing. - Wenkai Dai; Klaus-Tycho Foerster; David Fuchssteiner; Stefan Schmid 001 (ACM Trans. Model. Perform. Evaluation Comput. Syst., 2023)

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. - Wenkai Dai; Michael Dinitz; Klaus-Tycho Foerster; Long Luo; Stefan Schmid 001 (INFOCOM, 2024)

On the Resilience of Fast Failover Routing Against Dynamic Link Failures. - Wenkai Dai; Klaus-Tycho Foerster; Stefan Schmid 001 (CoRR, 2024)

Flood-Induced Evacuation Time Prediction and Optimization Strategy Toward Metro Stations. - Xiaoxia Yang; Wenkai Dai; Min Zhou 003; Dayi Qu (IEEE Trans. Intell. Transp. Syst., 2025)