Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity. - Vladimir Estivill-Castro; Mahdi Parsa (CATS, 2009)

Single Parameter FPT-Algorithms for Non-trivial Games. - Vladimir Estivill-Castro; Mahdi Parsa (IWOCA, 2010)

On the parameterized complexity of dominant strategies. - Vladimir Estivill-Castro; Mahdi Parsa (ACSC, 2012)

Hardness and tractability of detecting connected communities. - Vladimir Estivill-Castro; Mahdi Parsa (ACSW, 2016)

Supplier quality improvement: The value of information under uncertainty. - John Quigley; Lesley Walls; Güven Demirel; Bart L. MacCarthy; Mahdi Parsa (Eur. J. Oper. Res., 2018)