Yi-Jun Chang

From MaRDI portal
Person:344508

Available identifiers

zbMath Open chang.yi-junMaRDI QIDQ344508

List of research outcomes





PublicationDate of PublicationType
Fully scalable massively parallel algorithms for embedded planar graphs2024-11-28Paper
Ortho-radial drawing in near-linear time2024-11-14Paper
Simple contention resolution via multiplicative weight updates2024-08-26Paper
https://portal.mardi4nfdi.de/entity/Q61262552024-04-09Paper
Strong-Diameter Network Decomposition2024-03-26Paper
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions2024-03-26Paper
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs2024-03-26Paper
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications2024-03-26Paper
The energy complexity of diameter and minimum cut computation in bounded-genus networks2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61474292024-01-15Paper
The energy complexity of diameter and minimum cut computation in bounded-genus networks2024-01-11Paper
The complexity landscape of distributed locally checkable problems on trees2023-11-02Paper
Brief announcement: Distributed graph problems through an automata-theoretic lens2023-11-02Paper
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election2023-10-23Paper
Locally checkable problems in rooted trees2023-09-11Paper
Distributed graph problems through an automata-theoretic lens2023-03-10Paper
https://portal.mardi4nfdi.de/entity/Q58743072023-02-07Paper
Near-optimal Distributed Triangle Enumeration via Expander Decompositions2022-12-08Paper
Deterministic Distributed algorithms and Descriptive Combinatorics on \Delta-regular trees2022-04-20Paper
Distributed graph problems through an automata-theoretic Lens2022-03-22Paper
On Homomorphism Graphs2021-11-05Paper
The Energy Complexity of BFS in Radio Networks2021-03-15Paper
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation2021-01-20Paper
Improved distributed expander decomposition and nearly optimal triangle enumeration2021-01-20Paper
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable2021-01-20Paper
Distributed \((\Delta+1)\)-coloring via ultrafast graph shattering2020-05-28Paper
Distributed edge coloring and a special case of the constructive Lovász local lemma2019-12-02Paper
Exponential Separations in the Energy Complexity of Leader Election2019-12-02Paper
Distributed triangle detection via expander decomposition2019-10-15Paper
The energy complexity of broadcast2019-09-19Paper
An optimal distributed \((\Delta+1)\)-coloring algorithm?2019-08-22Paper
Unfolding some classes of orthogonal polyhedra of arbitrary genus2019-06-06Paper
An exponential separation between randomized and deterministic complexity in the LOCAL model2019-02-08Paper
Hardness of RNA folding problem with four symbols2019-01-18Paper
A time hierarchy theorem for the LOCAL model2019-01-14Paper
On bend-minimized orthogonal drawings of planar 3-graphs2018-08-13Paper
https://portal.mardi4nfdi.de/entity/Q46080642018-03-15Paper
Unfolding some classes of orthogonal polyhedra of arbitrary genus2017-10-23Paper
Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra2017-10-20Paper
Hardness of RNA folding problem with four symbols2017-10-17Paper
Brief announcement: An exponential separation between randomized and deterministic complexity in the LOCAL model2017-09-29Paper
Exponential separations in the energy complexity of leader election2017-08-17Paper
On orthogonally convex drawings of plane graphs2017-06-29Paper
Area-universal drawings of biconnected outerplane graphs2016-11-23Paper
Unfolding orthogonal polyhedra with linear refinement2016-01-11Paper
Constrained floorplans in 2D and 3D2015-12-11Paper
A new approach for contact graph representations and its applications2015-10-30Paper
Rectilinear duals using monotone staircase polygons2015-09-11Paper
On orthogonally convex drawings of plane graphs (extended abstract)2013-12-20Paper

Research outcomes over time

This page was built for person: Yi-Jun Chang