George Osipov

George Osipov is a researcher at Linköping University's Department of Computer and Information Science (IDA), affiliated with the Faculty of Science and Engineering. He holds a PhD in Computer Science from Linköping University, where his thesis focused on the parameterized complexity of constraint satisfaction problems (CSPs) at the intersection of theoretical computer science and artificial intelligence. His work explores efficient algorithms for solving almost-satisfiable CSPs, emphasizing scalability and practical applications in data processing and automatic reasoning.

• Education: Bachelor's in Computer Science from Free University of Tbilisi, Georgia; Master's in Mathematics from Ilia State University, Georgia (with an Erasmus year in Uppsala University, Sweden).
• Affiliations: Member of the Wallenberg AI, Autonomous Systems and Software Program (WASP) graduate school; Postdoctoral researcher funded by the Swedish Research Council.
• Collaborations: Partnered with institutions in the UK (Royal Holloway, Newcastle, Leeds), Germany (Saarbrücken), and Poland (Warsaw).

His research interests include parameterized complexity, constraint satisfaction problems, and algorithm design, with a focus on theoretical foundations and practical applications. He has received the prestigious 2023 Lawson Scholarship for excellence in computer science and is currently conducting postdoctoral research at Oxford University and Royal Holloway University of London. His work bridges theoretical computer science and AI, addressing challenges in scalable algorithmic solutions for complex computational problems.

George's contributions have been recognized through grants and international collaborations, reflecting his commitment to advancing the frontiers of computational theory and its real-world utility.