Tommy Färnqvist's homepage

Contact information

I was a Ph.D. student at the Theoretical Computer Science Laboratory in the Department of Computer and Information Science (IDA), Linköping University, Sweden. My advisor was Prof. Peter Jonsson. I defended my dissertation on 8 February 2013. Now I have a temporary position teaching and as undergraduate studies area manager (studierektor) of the SaS division at LiU/IDA.

( Try to spot me!)


Conference Papers

Tommy Färnqvist, Constraint Optimization Problems and Bounded Tree-width Revisited, in: Proceedings of the 9th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR-2012), Nantes, France, May, 2012.

Tommy Färnqvist, Counting Homomorphisms via Hypergraph-based Structural Restrictions, in: Proceedings of the 2nd International Symposium on Combinatorial Optimization (ISCO-2012), Athens, Greece, April, 2012.

Robert Engström, Tommy Färnqvist, Peter Jonsson, and Johan Thapper, Properties of an Approximability-related Parameter on Circular Complete Graphs, in: Proceedings of the 5th Latin-american Algorithms, Graphs, and Optimization Symposium (LAGOS-2009), Gramado (Rio Grande do Sul), Brazil, Nov, 2009.

Tommy Färnqvist, Peter Jonsson and Johan Thapper, Approximability Distance in the Space of H-Colourability Problems, in: Proceedings of the 4th International Computer Science Symposium in Russia (CSR-2009), Novosibirsk, Russia, Aug, 2009.

Tommy Färnqvist and Peter Jonsson, Bounded Tree-width and CSP-related Problems, in: Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC-2007), Sendai, Japan, Dec, 2007.

Technical Reports

Robert Engström, Tommy Färnqvist, Peter Jonsson, and Johan Thapper, Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts, CoRR cs/arXiv:0904.4600.

Tommy Färnqvist, Peter Jonsson, and Johan Thapper, Approximability Distance in the Space of H-colourability Problems, CoRR cs/arXiv:0802.0423.

PhD Thesis

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

Master of Science Thesis

Tommy Färnqvist, Number Theory Meets Cache Locality -- Efficient Implementation of a Small Prime FFT for the GNU Multiple Precision Arithmetic Library, 2005.

Computer Science Education Research

Fredrik Heintz and Tommy Färnqvist, Pedagogical Experiences of Competitive Elements in an Algorithms Course, in: Proceedings of LTHs 7:e Pedagogiska Inspirationskonferens (LTH), Lund, Sweden, August, 2012.

Fredrik Heintz and Tommy Färnqvist, IMPA: A Challenge-based University-Level Programming Competition, presented at: 2012 ACM-ICPC World Final Collaborative Learning Institute Symposium (CLIS), Warsaw, Poland, May, 2012.


729G06 Programming and Logic Lecturer in Logic part (Spring '13, Spring '14)

TDDC32 Design and implementation of a software module in Java Lecturer/Examiner (Spring '13)

TDDC70 Data Structures and Algorithms Teaching Assistant (Fall '07) Course Assistant (Fall '08) Lecturer/Examiner (Fall '09, Fall '10, Fall '11, Fall '12, Fall '13)

TDDC75 Discrete Structures Course Assistant (Fall '07, Fall '08)

TDDC91 Data Structures and Algorithms Lecturer/Examiner (Fall '09, Fall '10, Fall '11, Fall '12, Fall '13, Fall '14)

TDDD63 Perspectives in Computer Science and Computer Engineering Maps project (Fall '13, Fall '14)

TDDD71 Data Structures and Algorithms Lecturer/Examiner (Fall '13, Fall '14)

TDDD83 Computer Engineering - Bachelor Project Guest lectures (Spring '14)

TDDI16 Data Structures and Algorithms Lecturer/Examiner (Fall '12, Fall '13, Fall '14)

TTIT01 Programming and Modeling Course Assistant (Spring '07, Spring '08)

Professionalism for Engineers Mentor (Fall '13, Spring '14)


Seminar in theoretical computer science

CUGS, the national computer science graduate school, of which I was a student.

Thesis proposals (exjobb) at IDA.

IMPA, programming competition at IDA.

Swedish Open Championship in Programming. I help out with the local arrangments in Linköping.

Nordic Collegiate Programming Contest 2012 (NCPC), of which I was co-Head of Jury.

The NCPC is a part of the ACM International Collegiate Programming Contest (ACM ICPC). I was part of the ICPC Live team as a Live Analyst at the 2012 and 2013 World Finals. I was also a member of the jury for the North Western European Regional Programming Contest 2012 (NWERC 2012) and 2013 (NWERC 2013)

NoNA, Nordic Network on Algorithms, Spring School on Algorithms, Istanbul 2009, Summer School on Complexity Theory, St. Petersburg 2009.

tomfa at ida liu se
Last modified: Tue Apr 1 11:05:00 CET 2014
This is a personal www page. Opinions expressed here do not represent the official views of Linköpings universitet. Please refer to the web policy of Linköping University (link).