====== Marcus Wilhelm ======

<WRAP group>
<WRAP column 25%>
{{:people:marcus_dslr.jpg?nolink&225 |}}
</WRAP>
<WRAP column 65%>
**Ph.D. student**\\

Karlsruhe Institute of Technology (KIT)\\
Institute of Theoretical Informatics\\
\\
|         email | <marcus.wilhelm@kit.edu>                                                                                                                          |
|        office | [[http://www.uni-karlsruhe.de/fs/Uni/info/campusplan/index.php?id=50.34|Computer Science building 50.34]]: Room 310, currently working from home  |
|  office hours | feel free to drop by my office or schedule an appointment via email to make sure I'm free                                                         |
</WRAP>
</WRAP>

===== Research interests====

  * (graph) algorithms and their analysis
  * narrowing down the theory practice gap, by understanding why some problems are easier than suggested by worst-case analysis
    * parameterization
    * randomised analysis
    * distribution-free analysis
    * geometry
===== Publications =====

{{section>:publist:244_9971_marcuswilhelm_byyear:&nofooter&noeditbtn}}

Also have a look at my [[https://dblp.uni-trier.de/pid/244/9971.html|dblp-entry]].

===== Teaching =====
Winter 2023:
  * [[teaching:2023ws:beating_wc|Beating the Worst Case]] together with [[people:vonderheydt|]]

Summer 2023:
  * [[teaching:2023ss:algo1:start|]] (teaching assistant together with [[people:maximiliankatzmann|]] and [[people:wendyyi|]])

Winter 2022:
  * [[teaching:2022ws:param_algo:|]] (teaching assistant)
  * [[teaching:2022ws:seminar|]] (advisor for one topic)

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

Winter 2021/22:
  * [[teaching:2021ws:comput_geom|Parametrized Algorithms]] (teaching assistant)
  * [[teaching:2021ws:seminar|Seminar Algorithmentechnik]]


Summer 2021:
  * [[teaching:2021ss:pse:start|Praxis der Softwareentwicklung]]
  * [[teaching:2021ss:param_algo:start|Parametrized Algorithms]] (teaching assistant)

Winter 2020/21:
  * [[teaching:2020ws:comput_geom|Computational Geometry]]
  * [[teaching:2020ws:beating_wc|Beating the Worst Case]] (teaching assistant)

\\
Supervised bachelor / master theses:
{{section>:thesislist:theses_wilhelm:&nofooter&noeditbtn}}
===== Short CV =====

  * from Oct. 2020: PhD student in the group of [[people:thomasblaesius|Thomas Bläsius]] at the Institute of Theoretical Informatics at KIT, Karlsruhe
  * 2020: **Master of Science in IT Systems Engineering** from HPI, title of thesis: //Beating the Worst-Case: Analysis of a Practical Algorithm for Treewidth//{{ :people:marcus_thesis.pdf |(download)}}
  * Sep. 2018 - Mar. 2019: Internship at SAP Security Research, SAP Labs France, topic: homomorphic encryption of neural networks, see [[https://www.scitepress.org/Link.aspx?doi=10.5220/0007922404390447|this paper]]
  * 2017-2020: Graduate Studies in IT Systems Engineering at the [[https://www.hpi.de|Hasso Plattner Institute]] (HPI) Potsdam
  * 2017: **Bachelor of Science in Computer Science** from the University of Würzburg
  * Aug. 2016 - Jan. 2017: ERASMUS exchange semester at Blekinge Institute of Technology (BTH), Sweden
  * 2014-2017: Undergraduate Studies in Computer Science at the University of Würzburg