An improved algorithm for finding a length-constrained maximum-density subtree in a tree. - Hsin-Hao Su; Chin Lung Lu; Chuan Yi Tang (Inf. Process. Lett., 2008)

Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. - Li-Pu Yeh; Biing-Feng Wang; Hsin-Hao Su (Algorithmica, 2010)

Scaling algorithms for approximate and exact maximum weight matching - Ran Duan; Seth Pettie; Hsin-Hao Su (CoRR, 2011)

A scaling algorithm for maximum weight matching in bipartite graphs. - Ran Duan; Hsin-Hao Su (SODA, 2012)

On uniformly balanced graphs. - Harris Kwong; Sin-Min Lee; Sheng-Ping Bill Lo; Hsin-Hao Su; Yung-Chin Wang (Australas. J Comb., 2012)

Fast Distributed Coloring Algorithms for Triangle-Free Graphs. - Seth Pettie; Hsin-Hao Su (ICALP (2), 2013)

Brief annoucement: a distributed minimum cut approximation scheme. - Hsin-Hao Su (SPAA, 2014)

Almost-Tight Distributed Minimum Cut Algorithms. - Danupon Nanongkai; Hsin-Hao Su (DISC, 2014)

A Distributed Minimum Cut Approximation Scheme. - Hsin-Hao Su (CoRR, 2014)

(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. - Michael Elkin; Seth Pettie; Hsin-Hao Su (SODA, 2015)

Distributed coloring algorithms for triangle-free graphs. - Seth Pettie; Hsin-Hao Su (Inf. Comput., 2015)

Algorithms for Fundamental Problems in Computer Networks. - Hsin-Hao Su (2015)

Clairvoyant Mechanisms for Online Auctions. - Philipp Brandes; Zengfeng Huang; Hsin-Hao Su; Roger Wattenhofer (COCOON, 2016)

Ant-Inspired Density Estimation via Random Walks: Extended Abstract. - Cameron Musco; Hsin-Hao Su; Nancy A. Lynch (PODC, 2016)

Distributed (∆+1)-coloring in sublogarithmic rounds. - David G. Harris 001; Johannes Schneider 002; Hsin-Hao Su (STOC, 2016)

Distributed MST and Routing in Almost Mixing Time. - Mohsen Ghaffari 001; Fabian Kuhn; Hsin-Hao Su (PODC, 2017)

Distributed Degree Splitting, Edge Coloring, and Orientations. - Mohsen Ghaffari 001; Hsin-Hao Su (SODA, 2017)

Ant-Inspired Dynamic Task Allocation via Gossiping. - Hsin-Hao Su; Lili Su; Anna R. Dornhaus; Nancy A. Lynch (SSS, 2017)

Distributed algorithms for the Lovász local lemma and graph coloring. - Kai-Min Chung; Seth Pettie; Hsin-Hao Su (Distributed Comput., 2017)

Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems. - Tsvetomira Radeva; Anna R. Dornhaus; Nancy A. Lynch; Radhika Nagpal; Hsin-Hao Su (PLoS Comput. Biol., 2017)

Ant-inspired density estimation via random walks. - Cameron Musco; Hsin-Hao Su; Nancy A. Lynch (Proc. Natl. Acad. Sci. USA, 2017)

Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. - Bernhard Haeupler; Jeet Mohapatra; Hsin-Hao Su (PODC, 2018)

Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds. - Merav Parter; Hsin-Hao Su (DISC, 2018)

Distributed (Δ +1)-Coloring in Sublogarithmic Rounds. - David G. Harris 001; Johannes Schneider 002; Hsin-Hao Su (J. ACM, 2018)

Scaling Algorithms for Weighted Matching in General Graphs. - Ran Duan; Seth Pettie; Hsin-Hao Su (ACM Trans. Algorithms, 2018)

Reconfigurable Check Node Unit Design of Dual-Standard LDPC Decoding for 60 GHz Wireless Local Area Network. - Hsin-Hao Su; Tang-Syun Chen; Cheng-Hung Lin (ICCE-TW, 2019)

Towards the locality of Vizing's theorem. - Hsin-Hao Su; Hoa T. Vu (STOC, 2019)

Distributed Data Summarization in Well-Connected Networks. - Hsin-Hao Su; Hoa T. Vu (DISC, 2019)

Lower Bounds for Dynamic Distributed Task Allocation. - Hsin-Hao Su; Nicole Wein (ICALP, 2020)

Distributed Dense Subgraph Detection and Low Outdegree Orientation. - Hsin-Hao Su; Hoa T. Vu (DISC, 2020)

Adaptive Massively Parallel Constant-Round Tree Contraction. - MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh; Hsin-Hao Su (ITCS, 2022)

Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. - Yi-Jun Chang; Hsin-Hao Su (PODC, 2022)

(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings. - Shang-En Huang; Hsin-Hao Su (CoRR, 2022)

(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings. - Shang-En Huang; Hsin-Hao Su (PODC, 2023)

Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. - Nairen Cao; Shang-En Huang; Hsin-Hao Su (SPAA, 2023)

Parallel and Distributed 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 (CoRR, 2023)

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. - David G. Harris 001; Hsin-Hao Su; Hoa T. Vu (SIAM J. Discret. Math., 2023)

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 (ESA, 2024)

Deterministic Expander Routing: Faster and More Versatile. - Yi-Jun Chang; Shang-En Huang; Hsin-Hao Su (PODC, 2024)

Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. - Nairen Cao; Shang-En Huang; Hsin-Hao Su (SODA, 2024)

Rethinking the Expressiveness of GNNs: A Computational Model Perspective. - Guanyu Cui; Zhewei Wei; Hsin-Hao Su (CoRR, 2024)

Min-Max Correlation Clustering via Neighborhood Similarity. - Nairen Cao; Steven Roche; Hsin-Hao Su (CoRR, 2025)