13 citations · 19 across the 11 of their papers we have counts for
Showing cs.CCShow all
3 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.CC2018
Complexity of Computing the Anti-Ramsey Numbers for Paths
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani +3
The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs and the \emph{anti-Ramsey number}…
cs.CC2013
Vertex Disjoint Path in Upward Planar Graphs
Saeed Amiri, Ali Golshani, Stephan Kreutzer +1
The -vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time f…