Marcus Wilhelm
Ph.D. student
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
| marcus.wilhelm@kit.edu | |
| office | 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 |
Research interests
- (graph) algorithms and their analysis
- narrowing down the theory practice gap, by understanding why in practice some problems are easier than suggested by worst-case analysis
- parameterization
- randomised analysis
- distribution-free analysis
- geometry
Publications
Here is an automatically generated list of my publications. Also have a look at my dblp-entry.
2024
Structure and Independence in Hyperbolic Uniform Disk Graphs.
Computing Research Repository (CoRR) 2024
2023
From symmetry to asymmetry: Generalizing TSP approximations by parametrization.
Journal of Computer and System Sciences (JCSS) 2023
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks.
International Workshop on Combinatorial Algorithms (IWOCA) 2023
Partitioning the Bags of a Tree Decomposition into Cliques.
Symposium on Experimental and Efficient Algorithms (SEA) 2023
Partitioning the Bags of a Tree Decomposition Into Cliques.
Computing Research Repository (CoRR) 2023
2022
A Branch-And-Bound Algorithm for Cluster Editing.
Symposium on Experimental and Efficient Algorithms (SEA) 2022
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks.
Computing Research Repository (CoRR) 2022
2021
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization.
International Symposium on Fundamentals of Computation Theory (FCT) 2021
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
2019
Security for Distributed Deep Neural Networks: Towards Data Confidentiality & Intellectual Property Protection.
International Conference on E-Business and Telecommunication Networks (ICETE) 2019
Security for Distributed Deep Neural Networks Towards Data Confidentiality & Intellectual Property Protection.
Computing Research Repository (CoRR) 2019
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization.
Computing Research Repository (CoRR) 2019
Teaching
Summer 2025:
Winter 2024:
- Parametrisierte Algorithmen (teaching assistant together with Jean-Pierre von der Heydt and Wendy Yi)
Summer 2024
- Praxis der Forschung, advisor for one topic
Winter 2023:
- Beating the Worst Case together with Jean-Pierre von der Heydt
Summer 2023:
Winter 2022:
- Parametrisierte Algorithmen (teaching assistant)
- Seminar Algorithmentechnik (advisor for one topic)
Summer 2022:
- Algorithmen 1 (teaching assistant together with Maximilian Katzmann)
- Proseminar: Algorithmen für NP-schwere Probleme (advisor for one topic)
- Praxis der Forschung, advisor for one topic
Winter 2021/22:
- Parametrized Algorithms (teaching assistant)
Summer 2021:
- Parametrized Algorithms (teaching assistant)
Winter 2020/21:
- Beating the Worst Case (teaching assistant)
Supervised bachelor / master theses:
- Maxime Rambaud, 2025: Bachelor thesis Generating Geometric Random Graphs with Boolean Distance Functions, co-supervised by Jean-Pierre von der Heydt
- Antonia Heiming, 2025: Bachelor thesis Embedding into Graph Products: Computational Complexity and Algorithms, co-supervised by Thomas, Torsten Ueckerdt
- Tobias Gröger, 2024: Bachelor thesis Engineering Algorithms for CP-Treewidth
- Marcus Wunderlich, 2024: Master thesis Theoretical Study of Data Reduction in Real-World Hitting Set Instances, co-supervised by Thomas
- Annemarie Schaub, 2024: Bachelor thesis Computing the Diameter of Toroidal Random Geometric Graphs
- Carina Weber, 2023: Master thesis On the Connection Between Exactly Solving and Approximating Vertex Cover, co-supervised by Maximilian Katzmann, Thomas
- Sven Geißler, 2023: Bachelor thesis Exploring Clique-Partitioned Treewidth, co-supervised by Thomas
- Matthew Akram, 2022: Bachelor thesis On Difference-Labellings for Directed Graphs, co-supervised by Thomas
- Michael Zündorf, 2022: Master thesis Minimum Linear Arrangement revisited, co-supervised by Thomas
- Henriette Kissling, 2021: Bachelor thesis Solving Dynamic Macroeconomic Models with an Entrepreneurial Sector, co-supervised by Thomas (cooperation with Christopher Krause and Johannes Brumm from the Chair of Macroeconomics)
- Marcus Wunderlich, 2021: Bachelor thesis Analysis of Heuristics for Treewidth, co-supervised by Thomas
Short CV
- from Oct. 2020: PhD student in the group of 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(download)
- Sep. 2018 - Mar. 2019: Internship at SAP Security Research, SAP Labs France, topic: homomorphic encryption of neural networks, see this paper
- 2017-2020: Graduate Studies in IT Systems Engineering at the 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