Tommy Färnqvist

According to our database1, Tommy Färnqvist authored at least 12 papers between 2007 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Supporting Active Learning by Introducing an Interactive Teaching Tool in a Data Structures and Algorithms Course.
Proceedings of the 47th ACM Technical Symposium on Computing Science Education, 2016

Competition and Feedback through Automated Assessment in a Data Structures and Algorithms Course.
Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education, 2016

A review of models for introducing computational thinking, computer science and computing in K-12 education.
Proceedings of the 2016 IEEE Frontiers in Education Conference, 2016

2015
An Approximability-related Parameter on Graphs - Properties and Applications.
Discret. Math. Theor. Comput. Sci., 2015

2013
Exploiting Structure in CSP-related Problems.
PhD thesis, 2013

2012
Counting Homomorphisms via Hypergraph-Based Structural Restrictions.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Constraint Optimization Problems and Bounded Tree-Width Revisited.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2009
Properties of an Approximability-related Parameter on Circular Complete Graphs.
Electron. Notes Discret. Math., 2009

Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts
CoRR, 2009

Approximability Distance in the Space of <i>H</i>-Colourability Problems.
Proceedings of the Computer Science, 2009

2008
Approximability Distance in the Space of H-Colourability Problems
CoRR, 2008

2007
Bounded Tree-Width and CSP-Related Problems.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007


  Loading...