Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
(2024)
with
Syamantak Das and
Nikhil Kumar
MFCS 2024
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
(2024)
with Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase and Sumedha Uniyal
ACM Trans. on Algorithms
with Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase and Sumedha Uniyal
ACM Trans. on Algorithms
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
(2022)
with Antonios Antoniadis, Sándor Kisfaludi-Bak and Bundit Laekhanukit
SWAT 2022
with Antonios Antoniadis, Sándor Kisfaludi-Bak and Bundit Laekhanukit
SWAT 2022
On Approximating Degree-Bounded Network Design Problems
(2022)
with Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li and Jiayi Xian
Algorithmica
with Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li and Jiayi Xian
Algorithmica