Daniel Andersson | Publications

Journal Articles

• D. Andersson, K.A. Hansen, P.B. Miltersen and T.B. Sørensen, Deterministic Graphical Games Revisited, Journal of Logic and Computation, doi:10.1093/logcom/exq001 (in press).
• D. Andersson, V. Gurvich and T.D. Hansen, On Acyclicity of Games with Cycles, Discrete Applied Mathematics 158 (2010).
• D. Andersson, Hashiwokakero is NP-Complete, Information Processing Letters 109 (2009).

Conference Proceedings

• D. Andersson and P.B. Miltersen, The Complexity of Solving Stochastic Games on Graphs, in Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), LNCS 5878.
• D. Andersson, V. Gurvich and T.D. Hansen, On Acyclicity of Games with Cycles, in Proceedings of the Fifth International Conference on Algorithmic Aspects in Information and Management (AAIM 2009), LNCS 5564.
• D. Andersson, K.A. Hansen, P.B. Miltersen and T.B. Sørensen, Deterministic Graphical Games Revisited, in Proceedings of the Fourth Conference on Computability in Europe (CiE 2008), LNCS 5028.
• D. Andersson, Hiroimono is NP-Complete, in Proceedings of the Fourth International Conference on Fun with Algorithms (FUN 2007), LNCS 4475. Online implementation. Presentation (SVG+JavaScript).
• D. Andersson, An Improved Algorithm for Discounted Payoff Games, in Proceedings of the Eleventh ESSLLI Student Session, June 2006.

Theses

• D. Andersson, Perfect-Information Games with Cycles, PhD thesis, Aarhus University, August 2009.
• D. Andersson, Improved Combinatorial Algorithms for Discounted Payoff Games, Master's thesis, Uppsala University, August 2006.

Technical Reports

• D. Andersson, V. Gurvich and T.D. Hansen, On Ayclicity of Games with Cycles, DIMACS Technical Report 2009-09.
• D. Andersson, HIROIMONO is NP-complete, BRICS Report Series RS-07-1, January 2007.
• D. Andersson and S. Vorobyov, Fast Algorithms for Monotonic Discounted Linear Programs with Two Variables per Inequality, Isaac Newton Institute Preprint Series NI06019-LAA, May 2006.