Meysam Aghighi

According to our database, Meysam Aghighi authored at least 8 papers between 2014 and 2017.

Collaborative distances:

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

2017

Computational Complexity of some Optimization Problems in Planning.

Meysam Aghighi

PhD thesis, 2017

Plan Reordering and Parallel Execution - A Parameterized Complexity View.

Meysam Aghighi, Christer Bäckström

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Refining complexity analyses in planning by exploiting the exponential time hypothesis.

Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg

Ann. Math. Artif. Intell., 2016

Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis.

Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning.

Meysam Aghighi, Christer Bäckström

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015

Cost-Optimal and Net-Benefit Planning - A Parameterised Complexity View.

Meysam Aghighi, Christer Bäckström

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs.

Meysam Aghighi, Peter Jonsson, Simon Ståhlberg

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Oversubscription Planning: Complexity and Compilability.

Meysam Aghighi, Peter Jonsson

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014