Mahdi Parsa

According to our database, Mahdi Parsa authored at least 6 papers between 2009 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Continuous sampling plan design for processes with inspection errors and uncertainty, motivated by applications in biosecurity.

Belinda Barnes, Mahdi Parsa, Marco Kienzle

Eur. J. Oper. Res., 2026

2018

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

2016

Hardness and tractability of detecting connected communities.

Vladimir Estivill-Castro, Mahdi Parsa

Proceedings of the Australasian Computer Science Week Multiconference, 2016

2012

On the parameterized complexity of dominant strategies.

Vladimir Estivill-Castro, Mahdi Parsa

Proceedings of the Thirty-Fifth Australasian Computer Science Conference, 2012

2010

Single Parameter FPT-Algorithms for Non-trivial Games.

Vladimir Estivill-Castro, Mahdi Parsa

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity.

Vladimir Estivill-Castro, Mahdi Parsa

Proceedings of the Theory of Computing 2009, 2009