The following pages link to Arash Haddadan (Q517016):
Displaying 8 items.
- The complexity of dominating set reconfiguration (Q517018) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- (Q5075801) (← links)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)