Publications

  • Tong-Nong Lin, Yu-Cheng Lin, Cheng-Chen Tsai, Meng-Tsung Tsai and Shih-Yu Tsai “Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers” IWOCA 2024: 259-272

    2024

  • Shih-Yu Tsai, “Graph Algorithms for Diversity and Fairness.” State University of New York at Stony Brook

    2023

  • Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang, “Obtaining Approximately Optimal and Diverse Solutions via Dispersion.” LATIN

    2022

  • Shih-Yu Tsai, Hao-Tsung Yang, Kin Sum Liu, Shan Lin, Rezaul Chowdhury, and Jie Gao, MultiChannel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications. ALGOSENSORS

    2019

  • Hao-Tsung Yang, Shih-Yu Tsai, Kin Sum Liu, Shan Lin, Jie Gao, Patrol Scheduling Against Adversaries with Varying Attack Durations. AAMAS

    2019

  • Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena, Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. SPAA

    2019

  • Jie Gao, Mayank Goswami, Rebecca Schley, Shih-Yu Tsai, and Hao-Tsung Yang, Far-Away Spanning Trees. FWCG

    2018

  • Hao-Tsung Yang, Shih-Yu Tsai, Jie Gao, and Shan Lin, Optimal Safety Patrol Scheduling Using Randomized Traveling Salesman Tour. FWCG

    2017

  • Chang Chen, Gang-Yu Fan, Shih-Yu Tsai, Ting-Yu Lin, Tsan-sheng Hsu, Compressing Chinese Dark Chess Endgame Databases. CIG

    2015

  • Well Y. Chiu, Chiuyuan Chen, Shih-Yu Tsai, A 4n-move Self-stabilizing Algorithm for the Minimal Dominating Set Problem Using an Unfair Distributed Daemon. Inf. Process. Lett.

    2014

  • Shih-Yu Tsai, Chiuyuan Chen, Master Thesis: An Efficient Self-stabilizing Algorithm for the Minimal Dominating Set Problem under a Distributed Scheduler. CETD

    2011