1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2022
Unit Perturbations in Budgeted Spanning Tree Problems
Hassene Aissi, Solal Attias, Da Qi Chen +1
The minimum spanning tree of a graph is a well-studied structure that is the basis of countless graph theoretic and optimization problem. We study the minimum spanning tree (MST) p…
cs.DS2019
Faster Algorithms for Parametric Global Minimum Cut Problems
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
The parametric global minimum cut problem concerns a graph where the cost of each edge is an affine function of a parameter for some fixed dimension…
cs.DS2019★ 1 cited
Downgrading to Minimize Connectivity
Hassene Aissi, Da Qi Chen, R. Ravi
We study the problem of interdicting a directed graph by deleting nodes with the goal of minimizing the local edge connectivity of the remaining graph from a given source to a sink…