Koh, Cedric

Number of items: 7.
Mathematics
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil, Vegh, Laszlo A. (2025). A strongly polynomial algorithm for linear programs with at most two non-zero entries per row or column. In Beyersdorff, O, Pilipczuk, M, Pimentel, E, Thang, NK (Eds.), 42nd International Symposium On Theoretical Aspects Of Computer Science, Stacs 2025 . https://doi.org/10.4230/LIPIcs.STACS.2025.2 picture_as_pdf
  • Husić, Edin, Koh, Zhuan Khye, Loho, Georg, Végh, László A. (2023). On the correlation gap of matroids. In Del Pia, Alberto, Kaibel, Volker (Eds.), Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Proceedings (pp. 203-216). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-32726-1_15
  • Koh, Zhuan Khye (2023). On linear, fractional, and submodular optimization [Doctoral thesis]. London School of Economics and Political Science. https://doi.org/10.21953/lse.00004463
  • Koh, Zhuan Khye, Loho, Georg (2022). Beyond value iteration for parity games: strategy iteration with universal trees. In Szeider, Stefan, Ganian, Robert, Silva, Alexandra (Eds.), Leibniz International Proceedings in Informatics, LIPIcs . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2022.63 picture_as_pdf
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Végh, László A A. (2022). On circuit diameter bounds via circuit imbalances. In Aardal, Karen, Sanità, Laura (Eds.), Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings (pp. 140 - 153). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-06901-7_11
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Végh, László A. (2021). An accelerated Newton-dinkelbach method and its application to two variables per inequality systems. In Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz (Eds.), 29th Annual European Symposium on Algorithms, ESA 2021 . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2021.36 picture_as_pdf
  • Koh, Cedric, Sanitàa, Laura (2020). An efficient characterization of submodular spanning tree games. Mathematical Programming, 183(1-2), 359 - 377. https://doi.org/10.1007/s10107-020-01499-w picture_as_pdf
    • Statistics
  • Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Végh, László A A. (2022). On circuit diameter bounds via circuit imbalances. In Aardal, Karen, Sanità, Laura (Eds.), Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings (pp. 140 - 153). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-06901-7_11