Markus was a postdoc at TU Vienna, Austria. In January 2023 he joined MIT based on an FWF Schroedinger grant working with Erik Demaine. His research interests revolve around the graph parameter treewidth and runtime lower bounds as well as complexity analysis involving treewidth. Markus analyzes problems related to Boolean Satisfiability and richer formalisms such as quantified Boolean Formulas, Answer Set Programming, and other problems relevant to Logic, AI, and Databases.Markus Hecher finished his PhD in July 2021 within an individual binational agreement between TU Vienna and the University of Potsdam. In his thesis, Markus focused on ways to improve solving computationally hard problems. This thesis has been awarded with the EurAI Dissertation Award 2021 and the GI dissertation award 2021.Markus passionately participates in competitions, where he recently contributed to winning teams of the International Planning Competition 2023 as well as the International Path Counting Competition 2023. He actively has helped in the organization of several workshops, competitions and international conferences, e.g., IJCAI 2022.