Bounded Tree-Width and CSP-Related Problems. - Tommy Färnqvist; Peter Jonsson (ISAAC, 2007)

Approximability Distance in the Space of H-Colourability Problems - Tommy Färnqvist; Peter Jonsson; Johan Thapper (CoRR, 2008)

Approximability Distance in the Space of H-Colourability Problems. - Tommy Färnqvist; Peter Jonsson; Johan Thapper (CSR, 2009)

Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts - Robert Engström; Tommy Färnqvist; Peter Jonsson; Johan Thapper (CoRR, 2009)

Properties of an Approximability-related Parameter on Circular Complete Graphs. - Robert Engström; Tommy Färnqvist; Peter Jonsson; Johan Thapper (Electron. Notes Discret. Math., 2009)

Constraint Optimization Problems and Bounded Tree-Width Revisited. - Tommy Färnqvist (CPAIOR, 2012)

Counting Homomorphisms via Hypergraph-Based Structural Restrictions. - Tommy Färnqvist (ISCO, 2012)

Exploiting Structure in CSP-related Problems. - Tommy Färnqvist (2013)

An Approximability-related Parameter on Graphs - Properties and Applications. - Robert Engström; Tommy Färnqvist; Peter Jonsson; Johan Thapper (Discret. Math. Theor. Comput. Sci., 2015)

A review of models for introducing computational thinking, computer science and computing in K-12 education. - Fredrik Heintz; Linda Mannila; Tommy Färnqvist (FIE, 2016)

Competition and Feedback through Automated Assessment in a Data Structures and Algorithms Course. - Tommy Färnqvist; Fredrik Heintz (ITiCSE, 2016)

Supporting Active Learning by Introducing an Interactive Teaching Tool in a Data Structures and Algorithms Course. - Tommy Färnqvist; Fredrik Heintz; Patrick Lambrix; Linda Mannila; Chunyan Wang 003 (SIGCSE, 2016)