| 2026 | PODC | Deterministic Distributed Algorithms for Short Disjoint Paths. | Mohsen Ghaffari, Hsin-Hao Su |
| 2025 | ESA | Min-Max Correlation Clustering via Neighborhood Similarity. | Nairen Cao, Steven Roche, Hsin-Hao Su |
| 2024 | ESA | Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. | Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su |
| 2024 | PODC | Deterministic Expander Routing: Faster and More Versatile. | Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su |
| 2024 | SODA | Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. | Nairen Cao, Shang-En Huang, Hsin-Hao Su |
| 2023 | PODC | (1- | Shang-En Huang, Hsin-Hao Su |
| 2023 | SPAA | Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. | Nairen Cao, Shang-En Huang, Hsin-Hao Su |
| 2022 | PODC | Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. | Yi-Jun Chang, Hsin-Hao Su |
| 2021 | PODC | On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. | David G. Harris, Hsin-Hao Su, Hoa T. Vu |
| 2020 | ICALP | Lower Bounds for Dynamic Distributed Task Allocation. | Hsin-Hao Su, Nicole Wein |
| 2019 | STOC | Towards the locality of Vizing's theorem. | Hsin-Hao Su, Hoa T. Vu |
| 2018 | PODC | Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. | Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su |
| 2017 | PODC | Distributed MST and Routing in Almost Mixing Time. | Mohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su |
| 2017 | SODA | Scaling Algorithms for Weighted Matching in General Graphs. | Ran Duan, Seth Pettie, Hsin-Hao Su |
| 2017 | SODA | Distributed Degree Splitting, Edge Coloring, and Orientations. | Mohsen Ghaffari, Hsin-Hao Su |
| 2017 | SSS | Ant-Inspired Dynamic Task Allocation via Gossiping. | Hsin-Hao Su, Lili Su, Anna R. Dornhaus, Nancy A. Lynch |
| 2016 | COCOON | Clairvoyant Mechanisms for Online Auctions. | Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer |
| 2016 | PODC | Ant-Inspired Density Estimation via Random Walks: Extended Abstract. | Cameron Musco, Hsin-Hao Su, Nancy A. Lynch |
| 2016 | STOC | Distributed (∆+1)-coloring in sublogarithmic rounds. | David G. Harris, Johannes Schneider, Hsin-Hao Su |
| 2015 | SODA | (2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. | Michael Elkin, Seth Pettie, Hsin-Hao Su |
| 2014 | PODC | Distributed algorithms for the Lovsz local lemma and graph coloring. | Kai-Min Chung, Seth Pettie, Hsin-Hao Su |
| 2014 | SPAA | Brief annoucement: a distributed minimum cut approximation scheme. | Hsin-Hao Su |
| 2013 | ICALP | Fast Distributed Coloring Algorithms for Triangle-Free Graphs. | Seth Pettie, Hsin-Hao Su |
| 2012 | SODA | A scaling algorithm for maximum weight matching in bipartite graphs. | Ran Duan, Hsin-Hao Su |