Tung-Wei Kuo (郭桐惟)

Publication

Conference Papers

1. Amortized Cost in Graph Reordering: Why BFS Ordering Deserves More Attention
   Shang-Lin Li and Tung-Wei Kuo
   SSDBM 2025

2. Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
   Tung-Wei Kuo
   WAOA 2024

3. Better Clients, Less Conflicts: Hyperledger Fabric Conflict Avoidance
   Bing-Jie Ji  and Tung-Wei Kuo
   IEEE ICBC 2024

4. Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information
   Chen-Rui Jien and Tung-Wei Kuo
   ALGOWIN 2023

5. Competitive Analyses of Online Minimum Age of Information Transmission Scheduling
   Tung-Wei Kuo
   IEEE INFOCOM 2022 Age of Information Workshop

6. Optimistic Fast Rerouting
   Hai-Khun Tan and Tung-Wei Kuo
   IEEE ICC 2022

7. Fair VNF Provisioning in NFV Clusters via Node Labeling
   Tzu-Wen Chang, Tung-Wei Kuo, and Ming-Jer Tsai
   IEEE GLOBECOM 2020

8. Minimum Age TDMA Scheduling
   Tung-Wei Kuo
   IEEE INFOCOM 2019

9. MSig-BFT: A Witness-Based Consensus Algorithm for Private Blockchains
   Chun-Wei Chen, Jian-Wei Su, Tung-Wei Kuo, and Kung Chen
   IEEE ICPADS 2018 Workshop on Blockchain Technologies and Systems (Best Paper Award)

10. On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
    Tung-Wei Kuo
    ALGOSENSORS 2018

11. Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage
    Tung-Wei Kuo, Bang-Heng Liou, Kate Ching-Ju Lin, and Ming-Jer Tsai
    IEEE INFOCOM 2016

12. Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks
    Tung-Wei Kuo, Kate Ching-Ju Lin, and Ming-Jer Tsai
    IEEE INFOCOM 2013

13. On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms
    Tung-Wei Kuo and Ming-Jer Tsai
    IEEE INFOCOM 2012

Journal Papers

14. Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results
    Tung-Wei Kuo
    IEEE Transactions on Information Theory, 2020

15. On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
    Tung-Wei Kuo
    Theoretical Computer Science, 2019

16. Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage
    Tung-Wei Kuo, Bang-Heng Liou, Kate Ching-Ju Lin, and Ming-Jer Tsai
    IEEE/ACM Transactions on Networking, 2018

17. 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, and Ming-Jer Tsai
    IEEE Transactions on Computers, 2016

18. Beam Configuration and Client Association for Access Points Using Switched Beam Antennas
    Kate Ching-Ju Lin, Tung-Wei Kuo, Pei-Jiun Yan, Wan-Jie Cheng, and Shyh-Kang Jeng
    IEEE Transactions on Mobile Computing, 2016

19. Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks
    Tung-Wei Kuo, Kate Ching-Ju Lin, and Ming-Jer Tsai
    IEEE/ACM Transactions on Networking, 2015

20. Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Network
    Tung-Wei Kuo, Kuang-Che Lee, Kate Ching-Ju Lin, and Ming-Jer Tsai
    IEEE Transactions on Wireless Communications, 2014

arXiv Preprints

21.  Balancing SRPT and FCFS via Starvation Mitigation
    Tung-Wei Kuo

22. No Need for Recovery: A Simple Two-Step Byzantine Consensus
    Tung-Wei Kuo and Kung Chen

Underlined authors are my students