AIICS

Mikael Nilsson

All Publications

Show abstracts (where available) BibTeX entries
2015
[9] Full text  Mikael Nilsson, Jonas Kvarnstr√∂m and Patrick Doherty. 2015.
Efficient Processing of Simple Temporal Networks with Uncertainty: Algorithms for Dynamic Controllability Verification.
Acta Informatica, ??(??):1–30.
DOI: 10.1007/s00236-015-0248-8.
Publication status: Epub ahead of print
[8] Mikael Nilsson, Jonas Kvarnstr√∂m and Patrick Doherty. 2015.
Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis.
In B√©atrice Duval; Jaap van den Herik; Stephane Loiseau; Joaquim Filipe, editor, Agents and Artificial Intelligence: 6th International Conference, ICAART 2014, Angers, France, March 6‚Äď8, 2014, Revised Selected Papers, pages 243–261. In series: Lecture Notes in Computer Science #8946. Springer. ISBN: 978-3-319-25209-4 (print), 978-3-319-25210-0 (online).
DOI: 10.1007/978-3-319-25210-0_15.
[7] Full text  Mikael Nilsson. 2015.
Efficient Temporal Reasoning with Uncertainty.
Licentiate Thesis. In series: Link√∂ping Studies in Science and Technology. Thesis #1722. Link√∂ping University Electronic Press. 116 pages. ISBN: 978-91-7685-991-9 (print).
DOI: 10.3384/lic.diva-119409.
2014
[6] Full text  Mikael Nilsson, Jonas Kvarnstr√∂m and Patrick Doherty. 2014.
Incremental Dynamic Controllability in Cubic Worst-Case Time.
In Cesta, A; Combi, C; Laroussinie, F, editors, Proceedings of the 21st International Symposium on Temporal Representation and Reasoning (TIME), pages 17–26. In series: International Workshop on Temporal Representation and Reasoning. Proceedings #??. IEEE Computer Society Digital Library. ISBN: 978-1-4799-4227-5.
DOI: 10.1109/TIME.2014.13.
[5] Full text  Mikael Nilsson, Jonas Kvarnstr√∂m and Patrick Doherty. 2014.
EfficientIDC: A Faster Incremental Dynamic Controllability Algorithm.
In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS), pages 199–207. ISBN: ISBN:978-1-57735-660-8.
[4] Full text  Mikael Nilsson, Jonas Kvarnstr√∂m and Patrick Doherty. 2014.
Classical Dynamic Controllability Revisited: A Tighter Bound on the Classical Algorithm.
In Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART), pages 130–141. ISBN: 978-989-758-015-4.
DOI: 10.5220/0004815801300141.
2013
[3] Full text  Mikael Nilsson. 2013.
On the Complexity of Finding Spanner Paths.
In Sandor P. Fekete, editor, Booklet of Abstracts, The European Workshop on Computational Geometry (EuroCG), pages 77–80.
Booklet of Abstracts: http://www.ibr.cs.tu-bs.de/alg/eurocg13/...
[2] Full text  Mikael Nilsson, Jonas Kvarnstr√∂m and Patrick Doherty. 2013.
Incremental Dynamic Controllability Revisited.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS). AAAI Press. ISBN: 978-1-57735-609-7.
2009
[1] Full text  Mikael Nilsson. 2009.
Spanneröar och spannervägar.
Student Thesis. 126 pages. ISRN: -.