Tommy Färnqvist

12 papers A 1B 3C 2Misc 1Journal 4
YearRankTypeTitle / Venue / Authors
2016 C conf
A review of models for introducing computational thinking, computer science and computing in K-12 education.
FIE
Fredrik Heintz, Linda Mannila, Tommy Färnqvist
2016 B conf
Competition and Feedback through Automated Assessment in a Data Structures and Algorithms Course.
ITiCSE
Tommy Färnqvist, Fredrik Heintz
2016 A conf
Supporting Active Learning by Introducing an Interactive Teaching Tool in a Data Structures and Algorithms Course.
SIGCSE
Tommy Färnqvist, Fredrik Heintz, Patrick Lambrix, Linda Mannila, Chunyan Wang
2015 J jnl
An Approximability-related Parameter on Graphs - Properties and Applications.
Discret. Math. Theor. Comput. Sci.
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2013 — —
Exploiting Structure in CSP-related Problems.
Tommy Färnqvist
2012 B conf
Constraint Optimization Problems and Bounded Tree-Width Revisited.
CPAIOR
Tommy Färnqvist
2012 C conf
Counting Homomorphisms via Hypergraph-Based Structural Restrictions.
ISCO
Tommy Färnqvist
2009 Misc conf
Approximability Distance in the Space of
CSR
Tommy Färnqvist, Peter Jonsson, Johan Thapper
2009 J jnl
Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts
CoRR
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2009 J jnl
Properties of an Approximability-related Parameter on Circular Complete Graphs.
Electron. Notes Discret. Math.
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2008 J jnl
Approximability Distance in the Space of H-Colourability Problems
CoRR
Tommy Färnqvist, Peter Jonsson, Johan Thapper
2007 B conf
Bounded Tree-Width and CSP-Related Problems.
ISAAC
Tommy Färnqvist, Peter Jonsson