1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DC2025★ 1 cited
Optimal local certification on graphs of bounded pathwidth
Dan Alden Baterisna, Yi-Jun Chang
We present proof labeling schemes for graphs with bounded pathwidth that can decide any graph property expressible in monadic second-order (MSO) logic using -bit vertex…
cs.DC2024★ 1 cited
Deterministic Expander Routing: Faster and More Versatile
Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su
We consider the expander routing problem formulated by Ghaffari, Kuhn, and Su (PODC 2017), where the goal is to route all the tokens to their destinations given that each vertex is…