Martin Koutecký

Martin Koutecký is an Associate Professor at the Institute of Informatics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. His research primarily focuses on parameterized complexity of integer programming, combinatorial optimization, and computational social choice. He completed his PhD under Petr Kolman at Charles University and conducted postdoctoral research at Technion (Haifa, Israel) under Asaf Levin and Shmuel Onn.

Research Interests: Koutecký's work bridges theoretical computer science and optimization, with emphasis on:

• Designing efficient algorithms for integer programming under structural constraints
• Applying optimization techniques to computational social choice problems
• Developing parameterized approaches for combinatorial optimization
• Exploring geometric perspectives in election modeling and bribery problems

Publication Focus: His recent articles (2020-2025) demonstrate consistent work in algorithm design for optimization problems, particularly in integer programming variants and computational social choice. Key themes include block-structured IP, parameterized complexity, election modeling, and convex optimization. Methodological innovations frequently involve polyhedral theory, approximation algorithms, and complexity analysis.