On circuit diameter bounds via circuit imbalances D Dadush, ZK Koh, B Natura, LA Végh Mathematical Programming 206 (1), 631-662, 2024 | 12 | 2024 |

An efficient characterization of submodular spanning tree games ZK Koh, L Sanità Mathematical Programming 183, 359-377, 2020 | 10 | 2020 |

An accelerated Newton–Dinkelbach method and its application to two variables per inequality systems D Dadush, ZK Koh, B Natura, LA Végh Mathematics of Operations Research 48 (4), 1934-1958, 2023 | 8 | 2023 |

Stabilizing weighted graphs ZK Koh, L Sanità Mathematics of Operations Research 45 (4), 1318-1341, 2020 | 6 | 2020 |

On the correlation gap of matroids E Husić, ZK Koh, G Loho, LA Végh Mathematical Programming, 1-50, 2024 | 3 | 2024 |

Beyond value iteration for parity games: Strategy iteration with universal trees ZK Koh, G Loho arXiv preprint arXiv:2108.13338, 2021 | 3 | 2021 |

On linear, fractional, and submodular optimization ZK Koh London School of Economics and Political Science, 2023 | 1 | 2023 |

A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column D Dadush, ZK Koh, B Natura, N Olver, LA Végh Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1561-1572, 2024 | | 2024 |

Online Matching on -Uniform Hypergraphs S Borst, D Kashaev, ZK Koh arXiv preprint arXiv:2402.13227, 2024 | | 2024 |