| 2026 | IPCO | On Circuit Diameter and Straight Line Complexity. | Daniel Dadush, Stefan Kober, Zhuan Khye Koh |
| 2025 | IPCO | Online Matching on 3-Uniform Hypergraphs. | Sander Borst, Danish Kashaev, Zhuan Khye Koh |
| 2025 | STOC | Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth. | Zhuan Khye Koh, Omri Weinstein, Sorrachai Yingchareonthawornchai |
| 2025 | STACS | 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, Lszl A. Vgh |
| 2024 | STOC | 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, Lszl A. Vgh |
| 2023 | IPCO | On the Correlation Gap of Matroids. | Edin Husic, Zhuan Khye Koh, Georg Loho, Lszl A. Vgh |
| 2022 | IPCO | On Circuit Diameter Bounds via Circuit Imbalances. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2022 | MFCS | Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. | Zhuan Khye Koh, Georg Loho |
| 2021 | ESA | An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. | Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh |
| 2019 | IPCO | An Efficient Characterization of Submodular Spanning Tree Games. | Zhuan Khye Koh, Laura Sanit |
| 2018 | ICALP | Stabilizing Weighted Graphs. | Zhuan Khye Koh, Laura Sanit |