Arash Haddadan

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 17

Top Topics

Convex Combinations

Graph Connectivity

Top Venues

Discret. Optim.

Publications

Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation algorithms for flexible graph connectivity. Math. Program. 204 (1) (2024)
Arash Haddadan, Alantha Newman
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours. Math. Program. 198 (1) (2023)
Robert D. Carr, Arash Haddadan, Cynthia A. Phillips
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. Discret. Optim. 47 (2023)
George Z. Li, Arash Haddadan, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao
Theoretical Models and Preliminary Results for Contact Tracing and Isolation. AAMAS (2022)
Jiangzhuo Chen, Stefan Hoops, Achla Marathe, Henning S. Mortveit, Bryan L. Lewis, Srinivasan Venkatramanan, Arash Haddadan, Parantapa Bhattacharya, Abhijin Adiga, Anil Vullikanti, Aravind Srinivasan, Mandy L. Wilson, Gal Ehrlich, Maier Fenster, Stephen G. Eubank, Christopher L. Barrett, Madhav V. Marathe
Effective Social Network-Based Allocation of COVID-19 Vaccines. KDD (2022)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation Algorithms for Flexible Graph Connectivity. CoRR (2022)
Arash Haddadan, Alantha Newman
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes. Discret. Optim. 42 (2021)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation Algorithms for Flexible Graph Connectivity. FSTTCS (2021)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
A 2-Approximation Algorithm for Flexible Graph Connectivity. CoRR (2021)
George Li, Arash Haddadan, Ann Li, Madhav Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao
A Markov Decision Process Framework for Efficient and Implementable Contact Tracing and Isolation. CoRR (2021)
Arash Haddadan, Alantha Newman, R. Ravi
Shorter tours and longer detours: uniform covers and a bit beyond. Math. Program. 185 (1-2) (2021)
Robert D. Carr, Arash Haddadan, Cynthia A. Phillips
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. CoRR (2020)
Arash Haddadan, Alantha Newman
Towards Improving Christofides Algorithm for Half-Integer TSP. ESA (2019)
Arash Haddadan, Alantha Newman
Towards improving Christofides algorithm for half-integer TSP. CoRR (2019)
Arash Haddadan, Alantha Newman
Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring. CoRR (2018)
Arash Haddadan, Alantha Newman, R. Ravi
Cover and Conquer: Augmenting Decompositions for Connectivity Problems. CoRR (2017)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651 (2016)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The Complexity of Dominating Set Reconfiguration. WADS (2015)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The complexity of dominating set reconfiguration. CoRR (2015)