Publications

(2023). Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. ACM Transactions on Algorithms.

Preprint Cite DOI arXiv

(2022). On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT 2022.

PDF Cite DOI arXiv

(2022). On Approximating Degree-Bounded Network Design Problems. Algorithmica.

Preprint Cite DOI

(2021). Vertex Sparsification for Edge Connectivity. SODA 2021.

Preprint PDF Cite DOI arXiv

(2020). On Approximating Degree-Bounded Network Design Problems. APPROX/RANDOM 2020.

PDF Cite DOI arXiv

(2019). Mimicking Networks Parameterized by Connectivity. arXiv.

PDF Cite arXiv

(2018). Dynamics in matching and coalition formation games with structural constraints. Artificial Intelligence, v.262.

Preprint Cite DOI

(2018). Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX/RANDOM 2018.

PDF Cite DOI arXiv

(2017). Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA 2017.

PDF Cite DOI Preprint

(2016). A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. Electronic Notes in Discrete Mathematics, v.55.

Preprint Cite DOI

(2015). Representation of the non-dominated set in biobjective discrete optimization. Computers ∧ Operations Research, v.63.

Preprint Cite DOI

(2015). Hedonic Coalition Formation in Networks. AAAI 2015.

PDF Cite DOI Preprint

(2013). A note on the epsilon-indicator subset selection. Theoretical Computer Science, v.499.

Preprint Cite DOI