On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract). - Yi-Jun Chang; Hsu-Chun Yen (GD, 2013)

Rectilinear Duals Using Monotone Staircase Polygons. - Yi-Jun Chang; Hsu-Chun Yen (COCOA, 2014)

Unfolding Orthogonal Polyhedra with Linear Refinement. - Yi-Jun Chang; Hsu-Chun Yen (ISAAC, 2015)

A New Approach for Contact Graph Representations and Its Applications. - Yi-Jun Chang; Hsu-Chun Yen (WADS, 2015)

Conditional Lower Bound for RNA Folding Problem. - Yi-Jun Chang (CoRR, 2015)

Constrained floorplans in 2D and 3D. - Yi-Jun Chang; Hsu-Chun Yen (Theor. Comput. Sci., 2015)

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie (PODC, 2016)

How to Elect a Low-energy Leader. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie; Ruosong Wang; Wei Zhan (CoRR, 2016)

On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs. - Yi-Jun Chang; Hsu-Chun Yen (SoCG, 2017)

On orthogonally convex drawings of plane graphs. - Yi-Jun Chang; Hsu-Chun Yen (Comput. Geom., 2017)

Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra. - Yi-Jun Chang; Hsu-Chun Yen (Int. J. Comput. Geom. Appl., 2017)

Area-universal drawings of biconnected outerplane graphs. - Yi-Jun Chang; Hsu-Chun Yen (Inf. Process. Lett., 2017)

The Energy Complexity of Broadcast. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Qizheng He; Wenzheng Li; Seth Pettie (PODC, 2018)

The Complexity of Distributed Edge Coloring with Small Palettes. - Yi-Jun Chang; Qizheng He; Wenzheng Li; Seth Pettie; Jara Uitto (SODA, 2018)

An optimal distributed (Δ+1)-coloring algorithm? - Yi-Jun Chang; Wenzheng Li; Seth Pettie (STOC, 2018)

Energy Complexity of Distance Computation in Multi-hop Networks. - Yi-Jun Chang (CoRR, 2018)

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Mikaël Rabie; Jukka Suomela (PODC, 2019)

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. - Yi-Jun Chang; Manuela Fischer; Mohsen Ghaffari 001; Jara Uitto; Yufan Zheng (PODC, 2019)

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. - Yi-Jun Chang; Thatchaphol Saranurak (PODC, 2019)

Simple Contention Resolution via Multiplicative Weight Updates. - Yi-Jun Chang; Wenyu Jin 001; Seth Pettie (SOSA, 2019)

Distributed Triangle Detection via Expander Decomposition. - Yi-Jun Chang; Seth Pettie; Hengjie Zhang (SODA, 2019)

Unfolding some classes of orthogonal polyhedra of arbitrary genus. - Kuan-Yi Ho; Yi-Jun Chang; Hsu-Chun Yen (J. Comb. Optim., 2019)

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie (SIAM J. Comput., 2019)

A Time Hierarchy Theorem for the LOCAL Model. - Yi-Jun Chang; Seth Pettie (SIAM J. Comput., 2019)

PODC 2019 Review. - Naama Ben-David; Yi-Jun Chang; Michal Dory; Dean Leitersdorf (SIGACT News, 2019)

Exponential Separations in the Energy Complexity of Leader Election. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie; Ruosong Wang; Wei Zhan (ACM Trans. Algorithms, 2019)

Hardness of RNA folding problem with four symbols. - Yi-Jun Chang (Theor. Comput. Sci., 2019)

Locality of Distributed Graph Problems. - Yi-Jun Chang (2019)

Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. - Yi-Jun Chang; Thatchaphol Saranurak (FOCS, 2020)

The Energy Complexity of BFS in Radio Networks. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Seth Pettie (PODC, 2020)

Streaming Complexity of Spanning Tree Computation. - Yi-Jun Chang; Martin Farach-Colton; Tsan-sheng Hsu; Meng-Tsung Tsai (STACS, 2020)

The Complexity Landscape of Distributed Locally Checkable Problems on Trees. - Yi-Jun Chang (DISC, 2020)

Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. - Yi-Jun Chang; Jan Studený; Jukka Suomela (DISC, 2020)

Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering. - Yi-Jun Chang; Wenzheng Li; Seth Pettie (SIAM J. Comput., 2020)

Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma. - Yi-Jun Chang; Qizheng He; Wenzheng Li; Seth Pettie; Jara Uitto (ACM Trans. Algorithms, 2020)

Strong-Diameter Network Decomposition. - Yi-Jun Chang; Mohsen Ghaffari 001 (PODC, 2021)

Tight Distributed Listing of Cliques. - Keren Censor-Hillel; Yi-Jun Chang; François Le Gall; Dean Leitersdorf (SODA, 2021)

Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. - Yi-Jun Chang; Ran Duan; Shunhua Jiang (SPAA, 2021)

On Homomorphism Graphs. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2021)

Near-optimal Distributed Triangle Enumeration via Expander Decompositions. - Yi-Jun Chang; Seth Pettie; Thatchaphol Saranurak; Hengjie Zhang (J. ACM, 2021)

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (ITCS, 2022)

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

The Energy Complexity of Las Vegas Leader Election. - Yi-Jun Chang; Shunhua Jiang (SPAA, 2022)

Efficient Classification of Locally Checkable Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (DISC, 2022)

Efficient Classification of Local Problems in Regular Trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela (CoRR, 2022)

Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees. - Sebastian Brandt 002; Yi-Jun Chang; Jan Grebík; Christoph Grunau; Václav Rozhon; Zoltán Vidnyánszky (CoRR, 2022)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications. - Yi-Jun Chang (PODC, 2023)

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs. - Yi-Jun Chang; Zeyong Li (PODC, 2023)

Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model. - Yi-Jun Chang; Oren Hecht; Dean Leitersdorf (CoRR, 2023)

Distributed graph problems through an automata-theoretic lens. - Yi-Jun Chang; Jan Studený; Jukka Suomela (Theor. Comput. Sci., 2023)

Locally checkable problems in rooted trees. - Alkida Balliu; Sebastian Brandt 002; Yi-Jun Chang; Dennis Olivetti; Jan Studený; Jukka Suomela; Aleksandr Tereshchenko (Distributed Comput., 2023)

Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election. - Yi-Jun Chang; Ran Duan; Shunhua Jiang (ACM Trans. Algorithms, 2023)

The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees. - Yi-Jun Chang (ITCS, 2024)

Improved All-Pairs Approximate Shortest Paths in Congested Clique. - Hong Duc Bui; Shashwat Chandra; Yi-Jun Chang; Michal Dory; Dean Leitersdorf (PODC, 2024)

Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes (PODC, 2024)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. - Yi-Jun Chang; Oren Hecht; Dean Leitersdorf; Philipp Schneider (PODC, 2024)

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

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

Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. - Yi-Jun Chang; Da Wei Zheng (SODA, 2024)

Fast Broadcast in Highly Connected Networks. - Shashwat Chandra; Yi-Jun Chang; Michal Dory; Mohsen Ghaffari 001; Dean Leitersdorf (SPAA, 2024)

The Complexity Landscape of Dynamic Distributed Subgraph Finding. - Yi-Jun Chang; Lyuting Chen; Yanyu Chen 002; Gopinath Mishra; Mingyang Yang (CoRR, 2024)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity. - Yi-Jun Chang; Yanyu Chen 002; Gopinath Mishra (CoRR, 2024)

The energy complexity of diameter and minimum cut computation in bounded-genus networks. - Yi-Jun Chang (Theor. Comput. Sci., 2024)

Optimal Local Certification on Graphs of Bounded Pathwidth. - Dan Alden Baterisna; Yi-Jun Chang (PODC, 2025)

Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding. - Yi-Jun Chang; Lyuting Chen; Yanyu Chen 002; Gopinath Mishra; Mingyang Yang (PODC, 2025)

Optimal Distributed Replacement Paths. - Yi-Jun Chang; Yanyu Chen 002; Dipan Dey; Gopinath Mishra; Hung Thuan Nguyen; Bryce Sanchez (PODC, 2025)

Round and Communication Efficient Graph Coloring. - Yi-Jun Chang; Gopinath Mishra; Hung Thuan Nguyen; Farrel D. Salim (PODC, 2025)

Low-Distortion Clustering in Bounded Growth Graphs. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes (SIROCCO, 2025)

Bounded Memory in Distributed Networks. - Ran Ben Basat; Keren Censor-Hillel; Yi-Jun Chang; Wenchen Han; Dean Leitersdorf; Gregory Schwartzman (SPAA, 2025)

Ortho-Radial Drawing in Near-Linear Time. - Yi-Jun Chang (TheoretiCS, 2025)

Content-Oblivious Leader Election in 2-Edge-Connected Networks. - Yi-Jun Chang; Lyuting Chen; Haoran Zhou (CoRR, 2025)