How to reach me

Ola Angelsmark (Note: As of June 30th, 2005, I am no longer at IDA.)
Department of Computer and Information Science
Linköping University
S-581 83 Linköping
SWEDEN

Phone: +46/(0)13-28 66 07 (office), +46/(0)736-212 799 (mobile)

email: olaan@ida.liu.se

Publications

• Ola Angelsmark. Constraints, Adjunctions and (Co)algebras. In Horst Reichel, editor, Coalgebraic Methods in Computer Science, volume 33 of Electronic Notes in Theoretical Computer Science, 2000.
• Ola Angelsmark, Vilhelm Dahllöf, and Peter Jonsson. Finite domain constraint satisfaction using quantum computation. In Krzysztof Diks and Wojciech Rytter, editors, Mathematical Foundations of Computer Science, 27th International Symposium (MFCS-2002), Warsaw, Poland, August 26-30, 2002, Proceedings, volume 2420 of Lecture Notes in Computer Science, pages 93 103. Springer Verlag, 2002.
• Ola Angelsmark and Peter Jonsson. Improved algorithms for counting solutions in constraint satisfaction problems. In Francesca Rossi, editor, Principles and Practice of Constraint Programming, 9th International Conference (CP-2003), Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, volume 2833 of Lecture Notes in Computer Science, pages 81 95. Springer Verlag, 2003.
• Ola Angelsmark, Peter Jonsson, Svante Linusson, and Johan Thapper. Determining the number of solutions to binary CSP instances. In Pascal Van Hentenryck, editor, Principles and Practice of Constraint Programming, 8th International Conference (CP-2002), Ithaca, NY, USA, September 9-13, 2002, Proceedings, volume 2470 of Lecture Notes in Computer Science, pages 327-340. Springer Verlag, 2002.
• Ola Angelsmark and Johan Thapper. New algorithms for the maximum hamming distance problem. In Boi Faltings, Francois Fages, Francesca Rossi, and Adrian Petcu, editors, CSCLP 2004 Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, EPFL, Lausanne, Switzerland, 23-25 June, 2004. Proceedings, pages 271-285, 2004.
• Ola Angelsmark and Johan Thapper. Algorithms for the maximum hamming distance problem. In Boi Faltings,Francois Fages, Francesca Rossi, and Adrian Petcu, editors, Constraint Satisfaction and Constraint Logic Programming: ERCIM/CoLogNet International Workshop (CSCLP- 2004), Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers, volume 3419 of Lecture Notes in Computer Science, pages 128 141. Springer Verlag, March 2005.
• Ola Angelsmark and Johan Thapper. A microstructure based approach to constraint satisfaction optimisation problems. In Proceedings of the 18th International FLAIRS Conference (FLAIRS-2005), 15-17 May, 2005, Clearwater Beach, Florida, USA, 2005.