====== Maximilian Katzmann ======

<WRAP group>
<WRAP column 25%>

{{:people:maximilian_katzmann.jpg?nolink&225|}}
</WRAP>
<WRAP column 65%>
**Postdoctoral Researcher**\\

Karlsruhe Institute of Technology (KIT)\\
Institute of Theoretical Informatics\\
\\
|         email | <maximilian.katzmann@kit.edu>                                                                                        |
|        office | [[http://www.uni-karlsruhe.de/fs/Uni/info/campusplan/index.php?id=50.34|Computer Science building 50.34]]: Room 307  |
|  office hours | by appointment                                                                                                                     |
</WRAP>
</WRAP>

===== Research =====
I devoted my PhD studies to determining how //hyperbolic random graphs// can be utilized as a framework for average-case analysis. That is, we looked at graph algorithms that performed significantly better on real-world networks than one would expect when considering their worst-case running times, and used hyperbolic random graphs to model these networks in order to explain the observed phenomena theoretically.\\
\\

My research interests lie on **random graph models** that can be used to represent real-world networks and **analyzing algorithms** on them. In particular, I'm interested in investigating **networks with underlying geometry** and their connections to real-world graphs, for example in the context of **embedding algorithms**.

===== Teaching =====
Summer 2022:
  * [[teaching:2022ss:algo1:start|]] (teaching assistant together with [[people:marcuswilhelm|]])
  * [[https://i11www.iti.kit.edu/teaching/sommer2022/proseminar_nphard_problems/index|Proseminar: Algorithmen für NP-schwere Probleme]] (advisor for one topic)

Summer 2021:
  * Project Seminar: Fault Tolerant Algorithms, Hasso Plattner Institute, Chair for Algorithm Engineering

Winter 2020/2021:
  * Project Seminar: Uncovering Chains of Infection, Hasso Plattner Institute, Chair for Algorithm Engineering

Winter 2018:
  * Algorithmische Geometrie, Hasso Plattner Institute, Chair for Algorithm Engineering (teaching assistant)

Misc:
  * [[https://open.hpi.de/courses/learningtheory2020/items/48BoK9koNbaI1wwZLyH6uh|Short talk on embeddings]] for the Massive Open Online Course: Computational Learning Theory and Beyond, organized by Karen Seidel

===== Publications =====

{{section>:publist:172_3865_maximiliankatzmann_byyear:&nofooter&noeditbtn}}