Tung-Wei Kuo

29 papers A* 4B 4C 3Journal 15Unranked 3
YearRankTypeTitle / Venue / Authors
2025 B conf
Amortized Cost in Graph Reordering: Why BFS Ordering Deserves More Attention.
SSDBM
Shang-Lin Li, Tung-Wei Kuo
2025 C conf
Minimizing ℓ
IWOCA
Tung-Wei Kuo
2025 J jnl
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line.
Theory Comput. Syst.
Tung-Wei Kuo
2024 C conf
Better Clients, Less Conflicts: Hyperledger Fabric Conflict Avoidance.
ICBC
Bing-Jie Ji, Tung-Wei Kuo
2024 B conf
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line.
WAOA
Tung-Wei Kuo
2024 J jnl
Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line.
CoRR
Tung-Wei Kuo
2023 — conf
Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information.
ALGOWIN
Chen-Rui Jien, Tung-Wei Kuo
2022 — conf
Competitive Analyses of Online Minimum Age of Information Transmission Scheduling.
INFOCOM Workshops
Tung-Wei Kuo
2022 — conf
Optimistic Fast Rerouting.
ICC
Hai-Khun Tan, Tung-Wei Kuo
2021 J jnl
Online Starvation Mitigation to Balance Average Flow Time and Fairness.
CoRR
Tung-Wei Kuo
2020 B conf
Fair VNF Provisioning in NFV Clusters via Node Labeling.
GLOBECOM
Tzu-Wen Chang, Tung-Wei Kuo, Ming-Jer Tsai
2020 J jnl
Minimum Age of Information TDMA Scheduling: Approximation Algorithms and Hardness Results.
IEEE Trans. Inf. Theory
Tung-Wei Kuo
2019 A* conf
Minimum Age TDMA Scheduling.
INFOCOM
Tung-Wei Kuo
2019 J jnl
Minimum Age TDMA Scheduling.
CoRR
Tung-Wei Kuo
2019 J jnl
No Need for Recovery: A Simple Two-Step Byzantine Consensus.
CoRR
Tung-Wei Kuo, Kung Chen
2019 J jnl
On the approximability and hardness of the minimum connected dominating set with routing cost constraint.
Theor. Comput. Sci.
Tung-Wei Kuo
2018 J jnl
Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage.
IEEE/ACM Trans. Netw.
Tung-Wei Kuo, Bang-Heng Liou, Kate Ching-Ju Lin, Ming-Jer Tsai
2018 B conf
MSig-BFT: A Witness-Based Consensus Algorithm for Private Blockchains.
ICPADS
Chun-Wei Chen, Jian-Wei Su, Tung-Wei Kuo, Kung Chen
2018 C conf
On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint.
ALGOSENSORS
Tung-Wei Kuo
2017 J jnl
On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint.
CoRR
Tung-Wei Kuo
2016 J jnl
Beam Configuration and Client Association for Access Points with Switched Beam Antennas.
IEEE Trans. Mob. Comput.
Kate Ching-Ju Lin, Tung-Wei Kuo, Pei-Jiun Yan, Wan-Jie Cheng, Shyh-Kang Jeng
2016 A* conf
Deploying chains of virtual network functions: On the relation between link and server usage.
INFOCOM
Tung-Wei Kuo, Bang-Heng Liou, Kate Ching-Ju Lin, Ming-Jer Tsai
2016 J jnl
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms.
IEEE Trans. Computers
Tung-Wei Kuo, Kate Ching-Ju Lin, Ming-Jer Tsai
2015 J jnl
Maximizing Submodular Set Function With Connectivity Constraint: Theory and Application to Networks.
IEEE/ACM Trans. Netw.
Tung-Wei Kuo, Kate Ching-Ju Lin, Ming-Jer Tsai
2014 J jnl
Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks.
CoRR
Tung-Wei Kuo, Kuang-Che Lee, Kate Ching-Ju Lin, Ming-Jer Tsai
2014 J jnl
Leader-Contention-Based User Matching for 802.11 Multiuser MIMO Networks.
IEEE Trans. Wirel. Commun.
Tung-Wei Kuo, Kuang-Che Lee, Kate Ching-Ju Lin, Ming-Jer Tsai
2014 J jnl
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms.
CoRR
Tung-Wei Kuo, Kate Ching-Ju Lin, Ming-Jer Tsai
2013 A* conf
Maximizing submodular set function with connectivity constraint: Theory and application to networks.
INFOCOM
Tung-Wei Kuo, Kate Ching-Ju Lin, Ming-Jer Tsai
2012 A* conf
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms.
INFOCOM
Tung-Wei Kuo, Ming-Jer Tsai