Arash Haddadan

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Approximation algorithms for flexible graph connectivity Mathematical Programming. Series A. Series B	2024-02-21	Paper
Approximation algorithms for flexible graph connectivity	2024-02-05	Paper
Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs Discrete Optimization	2023-03-03	Paper
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours Mathematical Programming. Series A. Series B	2023-03-01	Paper
Towards improving Christofides algorithm for half-integer TSP	2022-05-11	Paper
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes Discrete Optimization	2022-01-18	Paper
Shorter tours and longer detours: uniform covers and a bit beyond Mathematical Programming. Series A. Series B	2021-01-25	Paper
The complexity of dominating set reconfiguration Theoretical Computer Science	2017-03-16	Paper
The complexity of dominating set reconfiguration Lecture Notes in Computer Science	2015-10-30	Paper

Research outcomes over time

This page was built for person: Arash Haddadan