13 citations · 19 across the 11 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020
On Fine-Grained Exact Computation in Regular Graphs
Saeed Akhoondian Amiri
We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs unless ETH fails. We expand our m…
cs.DS2020
Disjoint Shortest Paths with Congestion on DAGs
Saeed Akhoondian Amiri, Julian Wargalla
In the k-Disjoint Shortest Paths problem, a set of terminal pairs of vertices is given and we are asked to find paths such that eac…