I left KTH for Ericsson and do not keep this page up-to-date anymore.

Previously, I was a postdoc working with Jakob Nordström on SAT Solving, in the Theoretical Computer Science Group at the School of Computer Science and Communication (CSC). Prior to that I was a PhD student at Linköping University and defended my thesis in June of 2017.

CV (up to 2017)

Here is a word cloud of my research on computational complexity of automated planning problems:

Publications

Journal Articles:

# Author(s) Title Journal Title Info.
1 Meysam Aghighi, Christer Bäckström, Peter Jonsson and Simon Ståhlberg Refining Complexity Analyses in Planning by Exploiting the Exponential-time Hypothesis Annals of Mathematics and Artificial Intelligence (AMAI-2016) link

Conference Papers:

# Author(s) Title Proceedings Info.
6 Meysam Aghighi and Christer Bäckström Plan Reordering and Parallel Execution – A Parameterized Complexity View 31st AAAI Conference on Artificial Intelligence (AAAI-2017) link poster spotlight
5 Meysam Aghighi, Christer Bäckström, Peter Jonsson and Simon Ståhlberg Analysing Approximability and Heuristics in Planning Using the Exponential-time Hypothesis 22nd European Conference on Artificial Intelligence (ECAI-2016) link
4 Meysam Aghighi and Christer Bäckström A Multi-parameter Complexity Analysis of Cost-optimal and Net-benefit Planning 26th International Conference on Automated Planning and Scheduling (ICAPS-2016) link slides
3 Meysam Aghighi and Christer Bäckström Cost-optimal and Net-benefit Planning - A parameterized Complexity View 24th International Joint Conference on Artificial Intelligence (IJCAI-2015) link poster slides
2 Meysam Aghighi, Peter Jonsson and Simon Ståhlberg Tractable Cost-optimal Planning over Restricted Polytree Causal Graphs 29th AAAI Conference on Artificial Intelligence (AAAI-2015) link poster
1 Meysam Aghighi and Peter Jonsson Oversubscription Planning: Complexity and Compilability 28th AAAI Conference on Artificial Intelligence (AAAI-2014) link poster

 

Code

In my spare time I sometimes solve competitive programming problems.
Here are two Git repositories of the problems I have solved on Kattis and UVa.

Links