Oversubscription Planning: Complexity and Compilability. - Meysam Aghighi; Peter Jonsson (AAAI, 2014)

Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. - Meysam Aghighi; Peter Jonsson; Simon Ståhlberg (AAAI, 2015)

Cost-Optimal and Net-Benefit Planning - A Parameterised Complexity View. - Meysam Aghighi; Christer Bäckström (IJCAI, 2015)

A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning. - Meysam Aghighi; Christer Bäckström (ICAPS, 2016)

Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. - Meysam Aghighi; Christer Bäckström; Peter Jonsson; Simon Ståhlberg (ECAI, 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)

Plan Reordering and Parallel Execution - A Parameterized Complexity View. - Meysam Aghighi; Christer Bäckström (AAAI, 2017)

Computational Complexity of some Optimization Problems in Planning. - Meysam Aghighi (2017)