Return to main page

Publications

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs (2024)
with Syamantak Das and Nikhil Kumar
MFCS 2024

PDF doi:10.4230/LIPICS.MFCS.2024.45 arXiv:2407.09433

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

Preprint doi:10.1145/3632623 arXiv:2111.06299

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods (2022)
with Antonios Antoniadis, Sándor Kisfaludi-Bak and Bundit Laekhanukit
SWAT 2022

PDF doi:10.4230/LIPIcs.SWAT.2022.10 arXiv:2008.12075

On Approximating Degree-Bounded Network Design Problems (2022)
with Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li and Jiayi Xian
Algorithmica

Preprint doi:10.1007/s00453-022-00924-0

Vertex Sparsification for Edge Connectivity (2021)
with Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng and Mark Sellke
SODA 2021

PDF Preprint doi:10.1137/1.9781611976465.74 arXiv:2007.07862

On Approximating Degree-Bounded Network Design Problems (2020)
PhD Thesis, Saarland University

PDF doi:10.22028/D291-32983

On Approximating Degree-Bounded Network Design Problems (2020)
with Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li and Jiayi Xian
APPROX/RANDOM 2020

PDF doi:10.4230/LIPIcs.APPROX/RANDOM.2020.39 arXiv:1907.11404

Mimicking Networks Parameterized by Connectivity (2019)
with Parinya Chalermsook, Syamantak Das and Bundit Laekhanukit
arXiv

PDF arXiv:1910.10665

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs (2018)
with Parinya Chalermsook, Syamantak Das, Guy Even and Bundit Laekhanukit
APPROX/RANDOM 2018

PDF doi:10.4230/LIPICS.APPROX-RANDOM.2018.8 arXiv:1802.10403

Dynamics in matching and coalition formation games with structural constraints (2018)
with Martin Hoefer and Lisa Wagner
Artificial Intelligence, 262

Preprint doi:10.1016/j.artint.2018.06.004

Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs (2017)
with Parinya Chalermsook, Syamantak Das and Bundit Laekhanukit
SODA 2017

PDF Preprint doi:10.1137/1.9781611974782.47

New Integrality Gap Results for the Firefighters Problem on Trees (2017)
with and Parinya Chalermsook
WAOA 2016

Preprint doi:10.1007/978-3-319-51741-4_6

A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set (2016)
with and Parinya Chalermsook
CTW 2016, Electron. Notes Discret. Math.

Preprint doi:10.1016/J.ENDM.2016.10.029 arXiv:1601.02388

Representation of the Non-Dominated Set in Biobjective Discrete Optimization (2015)
with Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth and Michael Stiglmayr
Comput. Oper. Res.

Preprint doi:10.1016/j.cor.2015.05.003

Hedonic Coalition Formation in Networks (2015)
with Martin Hoefer and Lisa Wagner
AAAI 2015

PDF Preprint doi:10.1609/AAAI.V29I1.9305

Representation of the Non-Dominated Set in Biobjective Discrete Optimization (2013)
with Luís Paquete and Aníbal Ponte
Theor. Comput. Sci.

Preprint doi:10.1016/j.tcs.2013.05.013

Efficient Paths by Local Search (2011)
with Luís Paquete and José Luis Santos
ALIO/EURO 2011