| 2026 | PODC | Efficient Counting and Simulation in Content-Oblivious Rings. | Jrmie Chalopin, Yi-Jun Chang, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2026 | SPAA | Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. | Jrmie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2026 | SPAA | Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks. | Yi-Jun Chang, Yang Ze Guan |
| 2025 | PODC | Optimal Local Certification on Graphs of Bounded Pathwidth. | Dan Alden Baterisna, Yi-Jun Chang |
| 2025 | PODC | Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding. | Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, Mingyang Yang |
| 2025 | PODC | Optimal Distributed Replacement Paths. | Yi-Jun Chang, Yanyu Chen, Dipan Dey, Gopinath Mishra, Hung Thuan Nguyen, Bryce Sanchez |
| 2025 | PODC | Round and Communication Efficient Graph Coloring. | Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Farrel D. Salim |
| 2025 | SPAA | Bounded Memory in Distributed Networks. | Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang, Wenchen Han, Dean Leitersdorf, Gregory Schwartzman |
| 2025 | SIROCCO | Low-Distortion Clustering in Bounded Growth Graphs. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes |
| 2024 | PODC | Improved All-Pairs Approximate Shortest Paths in Congested Clique. | Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf |
| 2024 | PODC | Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes |
| 2024 | PODC | Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. | Yi-Jun Chang, Oren Hecht, Dean Leitersdorf, Philipp Schneider |
| 2024 | PODC | Deterministic Expander Routing: Faster and More Versatile. | Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su |
| 2024 | PODC | A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model. | Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, Mingyang Yang, Yu-Cheng Yeh |
| 2024 | SODA | Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. | Yi-Jun Chang, Da Wei Zheng |
| 2024 | SPAA | Fast Broadcast in Highly Connected Networks. | Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf |
| 2023 | ICALP | Ortho-Radial Drawing in Near-Linear Time. | Yi-Jun Chang |
| 2023 | PODC | Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. | Yi-Jun Chang |
| 2023 | PODC | The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. | Yi-Jun Chang, Zeyong Li |
| 2023 | SIROCCO | The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks. | Yi-Jun Chang |
| 2022 | PODC | Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. | Yi-Jun Chang, Hsin-Hao Su |
| 2022 | SPAA | The Energy Complexity of Las Vegas Leader Election. | Yi-Jun Chang, Shunhua Jiang |
| 2021 | PODC | Strong-Diameter Network Decomposition. | Yi-Jun Chang, Mohsen Ghaffari |
| 2021 | SODA | Tight Distributed Listing of Cliques. | Keren Censor-Hillel, Yi-Jun Chang, Franois Le Gall, Dean Leitersdorf |
| 2021 | SPAA | Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. | Yi-Jun Chang, Ran Duan, Shunhua Jiang |
| 2021 | SIROCCO | Distributed Graph Problems Through an Automata-Theoretic Lens. | Yi-Jun Chang, Jan Studen, Jukka Suomela |
| 2020 | FOCS | Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. | Yi-Jun Chang, Thatchaphol Saranurak |
| 2020 | PODC | The Energy Complexity of BFS in Radio Networks. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie |
| 2020 | STACS | Streaming Complexity of Spanning Tree Computation. | Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai |
| 2019 | PODC | The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. | Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikal Rabie, Jukka Suomela |
| 2019 | PODC | The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. | Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, Yufan Zheng |
| 2019 | PODC | Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. | Yi-Jun Chang, Thatchaphol Saranurak |
| 2019 | SODA | Simple Contention Resolution via Multiplicative Weight Updates. | Yi-Jun Chang, Wenyu Jin, Seth Pettie |
| 2019 | SODA | Distributed Triangle Detection via Expander Decomposition. | Yi-Jun Chang, Seth Pettie, Hengjie Zhang |
| 2018 | PODC | The Energy Complexity of Broadcast. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie |
| 2018 | SODA | The Complexity of Distributed Edge Coloring with Small Palettes. | Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto |
| 2018 | STOC | An optimal distributed (Δ+1)-coloring algorithm? | Yi-Jun Chang, Wenzheng Li, Seth Pettie |
| 2017 | COCOON | Unfolding Some Classes of Orthogonal Polyhedra of Arbitrary Genus. | Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen |
| 2017 | FOCS | A Time Hierarchy Theorem for the LOCAL Model. | Yi-Jun Chang, Seth Pettie |
| 2017 | STOC | Exponential separations in the energy complexity of leader election. | Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan |
| 2016 | CPM | Hardness of RNA Folding Problem With Four Symbols. | Yi-Jun Chang |
| 2016 | FOCS | An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. | Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie |
| 2016 | PODC | Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. | Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie |
| 2015 | ISAAC | Unfolding Orthogonal Polyhedra with Linear Refinement. | Yi-Jun Chang, Hsu-Chun Yen |
| 2015 | WADS | A New Approach for Contact Graph Representations and Its Applications. | Yi-Jun Chang, Hsu-Chun Yen |
| 2014 | COCOA | Rectilinear Duals Using Monotone Staircase Polygons. | Yi-Jun Chang, Hsu-Chun Yen |
| 2013 | GD | On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract). | Yi-Jun Chang, Hsu-Chun Yen |