On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms. - Tung-Wei Kuo; Ming-Jer Tsai (INFOCOM, 2012)

Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks. - Tung-Wei Kuo; Kuang-Che Lee; Kate Ching-Ju Lin; Ming-Jer Tsai (IEEE Trans. Wirel. Commun., 2014)

Maximizing Submodular Set Function With Connectivity Constraint: Theory and Application to Networks. - Tung-Wei Kuo; Kate Ching-Ju Lin; Ming-Jer Tsai (IEEE/ACM Trans. Netw., 2015)

On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms. - Tung-Wei Kuo; Kate Ching-Ju Lin; Ming-Jer Tsai (IEEE Trans. Computers, 2016)

Beam Configuration and Client Association for Access Points with Switched Beam Antennas. - Kate Ching-Ju Lin; Tung-Wei Kuo; Pei-Jiun Yan; Wan-Jie Cheng; Shyh-Kang Jeng (IEEE Trans. Mob. Comput., 2016)

MSig-BFT: A Witness-Based Consensus Algorithm for Private Blockchains. - Chun-Wei Chen; Jian-Wei Su; Tung-Wei Kuo; Kung Chen (ICPADS, 2018)

Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage. - Tung-Wei Kuo; Bang-Heng Liou; Kate Ching-Ju Lin; Ming-Jer Tsai (IEEE/ACM Trans. Netw., 2018)

Minimum Age TDMA Scheduling. - Tung-Wei Kuo (INFOCOM, 2019)

No Need for Recovery: A Simple Two-Step Byzantine Consensus. - Tung-Wei Kuo; Kung Chen (CoRR, 2019)

On the approximability and hardness of the minimum connected dominating set with routing cost constraint. - Tung-Wei Kuo (Theor. Comput. Sci., 2019)

Fair VNF Provisioning in NFV Clusters via Node Labeling. - Tzu-Wen Chang; Tung-Wei Kuo; Ming-Jer Tsai (GLOBECOM, 2020)

Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results. - Tung-Wei Kuo (IEEE Trans. Inf. Theory, 2020)

Online Starvation Mitigation to Balance Average Flow Time and Fairness. - Tung-Wei Kuo (CoRR, 2021)

Optimistic Fast Rerouting. - Hai-Khun Tan; Tung-Wei Kuo (ICC, 2022)

Competitive Analyses of Online Minimum Age of Information Transmission Scheduling. - Tung-Wei Kuo (INFOCOM Workshops, 2022)

Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information. - Chen-Rui Jien; Tung-Wei Kuo (ALGOWIN, 2023)

Better Clients, Less Conflicts: Hyperledger Fabric Conflict Avoidance. - Bing-Jie Ji; Tung-Wei Kuo (ICBC, 2024)

Minimizing ℓ 2 Norm of Flow Time by Starvation Mitigation. - Tung-Wei Kuo (IWOCA, 2025)

Amortized Cost in Graph Reordering: Why BFS Ordering Deserves More Attention. - Shang-Lin Li; Tung-Wei Kuo (SSDBM, 2025)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line. - Tung-Wei Kuo (Theory Comput. Syst., 2025)