Daniel Andersson

According to our database, Daniel Andersson authored at least 12 papers between 2007 and 2023.

Collaborative distances:

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

2023

An Ultrawideband System for Measuring the Dielectric Properties of Mineral Compounds in a Heat-Reaction Chamber at High Temperatures.

Patrik Ottosson, Daniel Andersson, Vipin Choudhary, Daniel Rönnow

IEEE Trans. Instrum. Meas., 2023

2020

Using Augmented Reality to Train Flow Patterns for Pilot Students - An Explorative Study.

Günter Alce, Karl-Johan Klang, Daniel Andersson, Stefan Nyström, Mattias Wallergård, Diederick C. Niehorster

Proceedings of the Augmented Reality, Virtual Reality, and Computer Graphics, 2020

2012

Deterministic Graphical Games Revisited.

Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen

J. Log. Comput., 2012

2010

A maximum principle for relaxed stochastic control of linear SDEs with application to bond portfolio optimization.

Daniel Andersson, Boualem Djehiche

Math. Methods Oper. Res., 2010

On acyclicity of games with cycles.

Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen

Discret. Appl. Math., 2010

2009

The relaxed general maximum principle for singular optimal control of diffusions.

Daniel Andersson

Syst. Control. Lett., 2009

Hashiwokakero is NP-complete.

Daniel Andersson

Inf. Process. Lett., 2009

The Complexity of Solving Stochastic Games on Graphs.

Daniel Andersson, Peter Bro Miltersen

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Solving Min-Max Problems with Applications to Games

Daniel Andersson

CoRR, 2008

2007

Simple Recursive Games

Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen

CoRR, 2007

A Model to Describe the Relationships Man - Machine - Maintenance - Economy (MMME).

Basim Al-Najjar, Daniel Andersson, Martin Jacobsson

Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

HIROIMONO Is NP-Complete.

Daniel Andersson

Proceedings of the Fun with Algorithms, 4th International Conference, 2007