A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality. - Zhuan Khye Koh; Bento Natura; László A. Végh (CoRR, 2020)

Stabilizing Weighted Graphs. - Zhuan Khye Koh; Laura Sanità (Math. Oper. Res., 2020)

An efficient characterization of submodular spanning tree games. - Zhuan Khye Koh; Laura Sanità (Math. Program., 2020)

An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. - Daniel Dadush; Zhuan Khye Koh; Bento Natura; László A. Végh (Math. Oper. Res., 2023)

A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. - Daniel Dadush; Zhuan Khye Koh; Bento Natura; Neil Olver; László A. Végh (STOC, 2024)

On circuit diameter bounds via circuit imbalances. - Daniel Dadush; Zhuan Khye Koh; Bento Natura; László A. Végh (Math. Program., 2024)

Online Matching on 3-Uniform Hypergraphs. - Sander Borst; Danish Kashaev; Zhuan Khye Koh (IPCO, 2025)

A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk). - Daniel Dadush; Zhuan Khye Koh; Bento Natura; Neil Olver; László A. Végh (STACS, 2025)

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth. - Zhuan Khye Koh; Omri Weinstein; Sorrachai Yingchareonthawornchai (STOC, 2025)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. - Zhuan Khye Koh; Georg Loho (Log. Methods Comput. Sci., 2025)

On the correlation gap of matroids. - Edin Husic; Zhuan Khye Koh; Georg Loho; László A. Végh (Math. Program., 2025)