Mikael Nilsson
Title
Cited by
Cited by
Year
Incremental dynamic controllability revisited
M Nilsson, J Kvarnström, P Doherty
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
262013
Incremental dynamic controllability in cubic worst-case time
M Nilsson, J Kvarnström, P Doherty
2014 21st International Symposium on Temporal Representation and Reasoning …, 2014
242014
Efficientidc: A faster incremental dynamic controllability algorithm
M Nilsson, J Kvarnström, P Doherty
Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014
192014
Classical Dynamic Controllability Revisited
M Nilsson, J Kvarnström, P Doherty
International Conference on Agents and Artificial Intelligence (ICAART), 130-141, 2014
152014
Classical Dynamic Controllability Revisited
M Nilsson, J Kvarnström, P Doherty
International Conference on Agents and Artificial Intelligence (ICAART), 130-141, 2014
152014
Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
M Nilsson, J Kvarnström, P Doherty
Acta Informatica 53 (6), 723-752, 2016
102016
Planning with temporal uncertainty, resources and non-linear control parameters
M Nilsson, J Kvarnström, P Doherty
Proceedings of the International Conference on Automated Planning and …, 2018
22018
Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis
M Nilsson, J Kvarnström, P Doherty
International Conference on Agents and Artificial Intelligence, 243-261, 2014
12014
Efficient Temporal Reasoning with Uncertainty
M Nilsson
Linköping University Electronic Press, 2015
2015
On the Complexity of Finding Spanner Paths
M Nilsson
The 29th European Workshop on Computational Geometry (EuroCG), March 17-20 …, 2013
2013
Spanneröar och spannervägar
M Nilsson
2009
Efficient Processing of Simple Temporal Networks with Uncertainty
M Nilsson, J Kvarnström, P Doherty
Revisiting Classical Dynamic Controllability
M Nilsson, J Kvarnström, P Doherty
The system can't perform the operation now. Try again later.
Articles 1–13