Tung-Wei Kuo (郭桐惟)
Assistant Professor 
Department of Computer Science 
National Chengchi University
Email: tungweikuo[at]gmail.com


Education:
  • Ph.D. (2012 - 2015), CS, NTHU
  • M.S. (2011), CS, NTHU
  • B.S. (2009), CS, NCTU
Research Interest:
  • Data center networking
  • Software-Defined Networking (SDN) and Network Function Virtualization (NFV)
  • Blockchain and consensus algorithm
  • Approximation algorithm
    • for problems with MASSIVE data. For instance, problems from big data applications.
    • for NP-hard problems
  • Wireless systems
Publication:
    Journal Papers:
    1. 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 
    2. Beam Configuration and Client Association for Access Points Using Switched Beam Antennas
      Kate Ching-Ju Lin, Tung-Wei KuoPei-Jiun Yan, Wan-Jie Cheng and Shyh-Kang Jeng
      IEEE Transactions on Mobile Computing, 2015 
    3. Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks
      Tung-Wei Kuo, Kate Ching-Ju Lin, and Ming-Jer Tsai
      ACM/IEEE Transactions on Networking, 2015 
    4. 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
    Conference Papers:
    1. 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
    2. 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
    3. 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
    Preprints:
    1. [pdf] On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
      Tung-Wei Kuo

    Biography:

     
    Tung-Wei Kuo received the Ph.D. degree in computer science from National Tsing Hua University in 2015. He is an Assistant Professor of 
    Department of Computer Science at National Chengchi University. He is interested in discovering potential problems in practical and important networking systems and solving the problems from a theoretical point of view in the hope to provide a fundamental understanding of the system. In fact, most of his research is inspired by the projects he has joined.