Dr. Hecher previously worked as a researcher at MIT and the CNRS in France and is particularly passionate about research questions involving structural graph theory, complexity, or counting problems. Graphs describe a wide variety of everyday networks – most of which are not random but exhibit a specific structure. The research field of structural graph theory develops methods for efficiently solving complex problems on such graphs, both theoretically and practically. It can often be shown that algorithms cannot overcome certain lower bounds under the usual assumptions in complexity theory. This is especially interesting in counting problems because fine-grained investigations often remain unsolved, even though the concept of counting solutions is very fundamental.
In the upcoming semester, Dr. Hecher will be offering the lectures "Algorithms and Data Structures," "Theoretical Computer Science II," and a seminar on theoretical computer science that deals with complexity and structural graph algorithms. These topics also offer numerous exciting opportunities for theses and (international) internships. Further information can be found at: dbai.tuwien.ac.at/staff/hecher/.