2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2017
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi
Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors and a constraint family ${\cal…
math.CO2010★ 2 cited
Independence number of generalized Petersen graphs
Nazli Besharati, J. Ebrahimi B, A. Azadi
Determining the size of a maximum independent set of a graph , denoted by , is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exa…