====== Martin Schirneck ======

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

Karlsruhe Institute of Technology (KIT)\\
Institute of Theoretical Informatics\\
\\
|         email | <martin.schirneck@kit.edu>                                                                                        |
|        office | [[http://www.uni-karlsruhe.de/fs/Uni/info/campusplan/index.php?id=50.34|Computer Science building 50.34]]: Room 308  |
|  office hours | I am best reached via email.\\ You can also just drop by my office anytime, but I am not always around.                                                                                                                   |
</WRAP>
</WRAP>

===== =====

I am the PI of a research project on the [[https://gepris.dfg.de/gepris/projekt/556899211|Design, Analysis, and Engineering of Enumeration Algorithms]] funded by the German Research Foundation ("DFG Eigene Stelle"). Enumeration is the task of computing and listing //all// solution to a combinatorial problem. The most important problem in enumeration is the generation of all minimal hitting sets of a hypergraph, known as the Transversal Hypergraph. In this project, I explore the combinatorics of finite sets to find new classes for which the Transversal Hypergraph problem is tractable. The resulting enumeration algorithms have applications in artificial intelligence and data profiling. 

===== Research Interests =====

My research interests include various topics in mathematics and theoretical computer science.
I have contributed to the following topics.

  * enumeration algorithms and complexity
  * data profiling  
  * fault-tolerant data structures
  * parameterized and fine-grained complexity
  * evolutionary computation and randomized search heuristics
  * time series classification
  * algorithmic learning theory

===== =====

A short CV can be found {{ :people:schirneck_cv.pdf |here}}.

===== (Co-)Supervised Theses and Projects =====

I have been fortunate to work with several outstanding students.

==== Master Theses ====

  * Simon Wietheger, Winter 2022/23 (HPI): //{{ resources:old_theses:wietheger_master_thesis.pdf |Fair Correlation Clustering in Forests}}//, appeared at [[https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2023.9|FORC 2023]]
  * Benjamin Feldmann, Winter 2019/20 (HPI): //{{ resources:old_theses:feldmann_masters_thesis.pdf |Distributed Unique Column Combinations Discovery}}//
  *  Philipp Fischbeck, Winter 2017/18 (HPI): //{{ resources:old_theses:fischbeck_masters_thesis.pdf |On the Effectiveness of Data Reduction for Covering Problems in Real-World Transit Networks}}//, appeared at [[https://link.springer.com/chapter/10.1007/978-3-030-25070-6_7|WAW 2019]]
 
==== Bachelor Theses ====

  *  Bennet Hörmann, Winter 2025/26: //A Lower Bound on Minimal-to-Maximal Conversion Search//
  * Marc Dollmann, Winter 2022/23 (U Vienna): //{{ resources:old_theses:dollmann_bachelor_thesis.pdf |Graph Clustering: A Comparison of Louvain and Leiden}}//
  * Linus Heinzl, Summer 2019 (HPI): //{{ resources:old_theses:heinzl_bachelor_thesis.pdf |Analysis of the Parameter Configuration of the Ramer-Douglas-Peucker Algorithm for Time Series Compression}}//
  * Felix Mujkanovic, Summer 2019 (HPI): //{{ resources:old_theses:mujkanovic_bachelor_thesis.pdf |Explaining the Predictions of Any Time Series Classifier}}//
  * Julius Lischeid, Summer 2018 (HPI): //{{ resources:old_theses:lischeid_bachelor_thesis.pdf |Lexicographic Enumeration of Hitting Sets in Hypergraphs}}//, appeared at [[https://epubs.siam.org/doi/10.1137/1.9781611975499.11|ALENEX 2019]] and [[https://www.sciencedirect.com/science/article/pii/S0022000021000994|JCSS 2022]]

==== Student Projects ====

  * Muhammad Raza Ali, Winter 2024/25 (U Vienna): //{{resources:old_theses:raza_ali_p1.pdf |Parallelizing Hitting Set Enumeration Algorithms for Data Profiling}}//
  * Winter 2021/22 (HPI): //[[https://hpi.de/friedrich/teaching/ws21/mp.html|Theory of Crossover-Based Optimization]]//, received a **Best Paper Award** at [[https://dl.acm.org/doi/10.1145/3512290.3528713|GECCO 2022]] and appeared at [[https://dl.acm.org/doi/10.1145/3603629|TELO 2023]]
  * Summer 2021 (HPI): //[[https://hpi.de/friedrich/teaching/ss21/faulttol.html|Fault Tolerant Algorithms]]//, appeared at [[https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.23|ITCS 2022]]
  * Academic Year 2018/19 (HPI): //[[https://hpi.de/friedrich/teaching/ws18/bp.html|Lossy Compression of Time Series Data]]//
  * Winter 2016/17 (HPI): //[[https://hpi.de/friedrich/teaching/ws16/mp.html|Distributed Evolutionary Search]]//, appeared at [[https://dl.acm.org/doi/10.1145/3071178.3071206|GECCO 2017]] and [[https://link.springer.com/article/10.1007/s00453-018-0445-2|Algorithmica 2019]]


===== Talks =====

Some of my conference talks are available online.

  * AAAI 2025: //[[https://underline.io/lecture/111569-efficient-fault-tolerant-search-by-fast-indexing-of-subnetworks|Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks]]// ({{ resources:slides:aaai-25_10392_schirneck.pdf|slides}})
  * STOC 2023: //[[https://hpi.de/oldsite/fileadmin/user_upload/fachgebiete/friedrich/videos/STOC23_Schirneck.mp4|Approximate Distance Sensitivity Oracles in Subquadratic Space]]// ({{ resources:slides:approximate_dso_stoc23_slides.pdf |slides}})
  * ITCS 2022: //[[https://hpi.de/friedrich/talks/itcs-2022.html|Fixed-Parameter Sensitivity Oracles]]// ({{ resources:slides:fixed-parameter_sensitivity_oracles_itcs22_slides.pdf|slides}})
  * ESA 2021: //[[https://hpi.de/friedrich/talks/esa-2021-2.html|Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles]]// ({{ resources:slides:single-source_distance_sensitivity_oracles_esa21_slides.pdf|slides}})
  * ESA 2020: //[[https://hpi.de/friedrich/talks/esa-2020.html|The Minimization of Random Hypergraphs]]// ({{ resources:slides:minimization_random_hypergraphs_esa20_slides.pdf|slides}})
===== Publications =====

{{section>:publist:176_1130_martinschirneck_byyear_nopreprint:&nofooter&noeditbtn}}