default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArash Haddadan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Sylvia C. Boyd, Joseph Cheriyan
, Arash Haddadan, Sharat Ibrahimpur:
Approximation algorithms for flexible graph connectivity. Math. Program. 204(1): 493-516 (2024)- 2023
- [j5]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: 100746 (2023) - [j4]Arash Haddadan, Alantha Newman:
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours. Math. Program. 198(1): 595-620 (2023) - 2022
- [c5]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: 1672-1674 - [c4]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: 4675-4683 - [i8]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation Algorithms for Flexible Graph Connectivity. CoRR abs/2202.13298 (2022) - 2021
- [j3]Arash Haddadan, Alantha Newman:
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes. Discret. Optim. 42: 100659 (2021) - [j2]Arash Haddadan, Alantha Newman, R. Ravi:
Shorter tours and longer detours: uniform covers and a bit beyond. Math. Program. 185(1-2): 245-273 (2021) - [c3]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation Algorithms for Flexible Graph Connectivity. FSTTCS 2021: 9:1-9:14 - [i7]Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
A 2-Approximation Algorithm for Flexible Graph Connectivity. CoRR abs/2102.03304 (2021) - [i6]George Z. Li, Arash Haddadan, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao:
A Markov Decision Process Framework for Efficient and Implementable Contact Tracing and Isolation. CoRR abs/2112.15547 (2021) - 2020
- [i5]Robert D. Carr, Arash Haddadan, Cynthia A. Phillips:
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. CoRR abs/2006.06957 (2020)
2010 – 2019
- 2019
- [c2]Arash Haddadan, Alantha Newman:
Towards Improving Christofides Algorithm for Half-Integer TSP. ESA 2019: 56:1-56:12 - [i4]Arash Haddadan, Alantha Newman:
Towards improving Christofides algorithm for half-integer TSP. CoRR abs/1907.02120 (2019) - 2018
- [i3]Arash Haddadan, Alantha Newman:
Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring. CoRR abs/1811.09906 (2018) - 2017
- [i2]Arash Haddadan, Alantha Newman, R. Ravi:
Cover and Conquer: Augmenting Decompositions for Connectivity Problems. CoRR abs/1707.05387 (2017) - 2016
- [j1]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: 37-49 (2016) - 2015
- [c1]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The Complexity of Dominating Set Reconfiguration. WADS 2015: 398-409 - [i1]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. CoRR abs/1503.00833 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
