Zhuan Khye Koh

Orcid: 0000-0002-4450-8506

According to our database1, Zhuan Khye Koh authored at least 11 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk).
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Online Matching on 3-Uniform Hypergraphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2024
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
On the Correlation Gap of Matroids.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

On Circuit Diameter Bounds via Circuit Imbalances.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality.
CoRR, 2020

2019
An Efficient Characterization of Submodular Spanning Tree Games.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
Stabilizing Weighted Graphs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018


  Loading...