Det finns bra (polynomiska) och dåliga (superpolynomiska) metoder för att lösa problem. Vissa problem tycks vara beräkningsmässigt svåra att lösa och bara dåliga metoder är kända. Med hjälp av universell algebra försöker jag göra dåliga metoder något bättre och via algebraiska modeller förklara hur de svåra problemen är relaterade till varandra.
Victor Lagerkvist
Biträdande professor
Jag är universitetslektor vid Laboratoriet för teoretisk datalogi (TCSLAB).
Universitetslektor vid Laboratoriet för teoretisk datalogi
Mitt huvudsakliga forskningsintresse är den så kallade algebraiska metoden för att analysera beräkningskomplexitet.
Kortfattat CV (på engelska)
Employment History
- November 2022 –, Associate professor (universitetslektor) at TCSLAB, Linköping University, Sweden.
- May 2020 – October 2022, Assistant professor (biträdande universitetslektor) at TCSLAB, Linköping University, Sweden.
- April 2018 – April 2020, Postdoctoral researcher at TCSLAB, Linköping University, Sweden.
- March 2016 – March 2018, Postdoctoral researcher at the institute of algebra, Technische Universität Dresden, Germany.
- November 2012 – Februari 2016, PhD student at TCSLAB, Linköping University, Sweden.
- Juli 2012 – October 2012, Research assistant at TCSLAB, Linköping University, Sweden
Academic Degrees
- 2020 Habilitation (docent), Linköping University, Sweden.
- 2016 PhD in Computer Science, Linköping University, Sweden. Thesis Title: Strong Partial Clones and the Complexity of Constraint Satisfaction Problems: Limitations and Applications. Advisor: Peter Jonsson.
- 2012 M.Sc in Computer Science, Linköping University, Sweden. Thesis Title: Restricted Constraint Satisfaction Problems and the Exponential-time Hypothesis. Examiner: Peter Jonsson.
- 2010 B.Sc in Computer Science, Linköping University, Sweden. Thesis Title: A Comparison of SL- and Unit-resolution Search Rules for Stratified Logic Programs. Examiner: Ulf Nilsson.
Academic Award and Grants
- Finkornig komplexitet för satisfierbarhets- och villkorsproblem (Fine-grained complexity of satisfiability and constraint satisfaction problems). The Swedish Research Council, starting grant, 2020-01-01
- Recipient of the 2017 young researcher price of the Ruth and Nils-Erik Stenbäck foundation
Refereeing
- Reviewer for the American Mathematical Society (AMS).
- Program committee member for the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI-2020).
- Referee for several international conferences and journals in computer science, including the International Conference on Principles and Practice of Constraint Programming (CP), the ACM-SIAM Symposium on Discrete Algorithms (SODA), the International Colloquium on Automata, Languages and Programming (ICALP), and the International Symposium on Theoretical Aspects of Computer Science (STACS).
- Expert referee for three grant proposals from Agence Nationale de la Recherche (ANR), the Czech Science Foundation (GACR), and the Austrian science Fund (FWF).
Workshops and Seminars
- Speaker at Logic and Search (LASH-2017), Melbourne, Australia, 2017.
- Invited speaker at QuantLA research seminar, Dresden, Germany, 2017.
- SAT and Interactions, Dagstuhl, Germany, 2016.
- Speaker at Workshop on Qualitative Spatial and Temporal Reasoning (QUAC-2015), Dresden, Germany, 2015.
Supervision
- Main supervisor of Leif Eriksson, PhD student, TCSLAB, Linköping University.
- Secondary supervisor of Baril Ambroise, PhD student, Université de Lorraine.
- Secondary supervisor of George Osipov, PhD student, TCSLAB, Linköping University.
- Secondary supervisor of Biman Roy, PhD student, TCSLAB, Linköping University. Thesis title: Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems, 2020.
- Examiner of Leif Eriksson, master’s student, Linköping University. Thesis title: Solving Temporal CSPs via Enumeration and SAT Compilation, 2019.
- Supervisor of Adam Shi, master’s student, Linköping University. Thesis title: Automatic Enumeration
of Intervals of Partial Co-Clones, 2016.
Publikationer
2025
Vidare till DOI
2024
2023
Vidare till DOI
Vidare till DOI
Vidare till DOI
