Mahdi Parsa

Orcid: 0000-0001-6729-4267

According to our database1, Mahdi Parsa authored at least 5 papers between 2009 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Supplier quality improvement: The value of information under uncertainty.
Eur. J. Oper. Res., 2018

2016
Hardness and tractability of detecting connected communities.
Proceedings of the Australasian Computer Science Week Multiconference, 2016

2012
On the parameterized complexity of dominant strategies.
Proceedings of the Thirty-Fifth Australasian Computer Science Conference, 2012

2010
Single Parameter FPT-Algorithms for Non-trivial Games.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity.
Proceedings of the Theory of Computing 2009, 2009


  Loading...