Curriculum Vitae

Lecturer in Theoretical Computer Science

School of Electronic Engineering and Computer Science, Queen Mary University of London

Senior Research Associate in Algorithms and Complexity Theory

Member of the Algorithms and Complexity Theory Theme at the Department for Computer Science at Oxford University, headed by Leslie Ann Goldberg.

Julia de Lacy Mann Fellow

Merton College, University of Oxford

Junior Research Fellow in Computer Science

Merton College, University of Oxford

PhD Student in Computer Science

Saarland University and Cluster of Excellence (MMCI), supervised by Holger Dell.

Thesis Title: Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications.

Defended on July 15th, 2019.

Graduate School of Computer Science at Saarland University

Simons Institute for the Theory of Computing

Visiting graduate student in the program Counting Complexity and Phase Transitions.

Bachelor of Science in Computer Science 

Thesis Title: The Complexity of (Parameterized) Counting Problems on Line Graphs.

Supervised by Markus Bläser.

Awarded with the Bachelor-Prize of the Computer Science Faculty of Saarland University.

Bachelor's studies in Computer Science

Saarland University.

Minor subject: Mathematics.

03/2024: Computer Science Seminar, Birkbeck University of London 

06/2023: FPT Fest 2023 in the honour of Mike Fellows, University of Bergen

05/2023: Pop-up Spring TCS Workshop, King's College London 

01/2023: Combinatorics Study Group, Queen Mary University of London

05/2022: Theoretical Computer Science Seminar, University of Birmingham 

03/2022: ACiD Seminar, University of Durham 

11/2021: Seminar at the Dept. of Computer Science, University of Milan

08/2021: GGGC Conference, University of Newcastle

05/2021: Parameterised Complexity Seminar, Online Seminar Series

11/2022: Counting and Sampling: Algorithms and Complexity, Schloss Dagstuhl - Leibniz Center for Informatics 

10/2019: IGAFIT Workshop for Algorithms Postdocs in Europe (AlgPiE by IGAFIT 2019), Będlewo Palace

09/2018: Operations Research and Parameterized Complexity Workshop, Bergen 

08/2017: Computational Counting, Schloss Dagstuhl - Leibniz Center for Informatics 

06/2017: Syntax and Semantics of Low-Level Languages (LOLA), Reykjavik

Presentation of: Yannick Forster, Fabian Kunze and Marc Roth. The Strong Invariance Thesis for a Lambda Calculus.

01/2017: Randomization in Parameterized Complexity Theory, Schloss Dagstuhl - Leibniz Center for Informatics 

2026: PC Member of the 2026 ACM Symposium on the Principles of Database Theory (PODS 2026)

2025: External reviewer for SODA, LICS, ICALP

2024: External reviewer for Journal of the ACM, FOCS

2023: 

PC Member of the 31tst Annual European Symposium on Algorithms (ESA 2023, Track A)

External Reviewer for SODA, ICALP, Computational Complexity, SIAM Journal on Computing and the Journal of the ACM

2022: External reviewer for CCC, Discrete Applied Mathematics and SIAM Journal on Discrete Mathematics

2021: External reviewer for FOCS, SODA, ICALP, WG, ESA, Algorithmica, and ACM Transactions on Algorithms

2020: 

PC Member of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)

External Reviewer for SODA, ITCS, STACS, FOCS , MFCS, CCC, SIAM Journal on Computing and the Journal of Computer and System Sciences

2019: External reviewer for ICALP, SODA, WG, MFCS and ESA

2018: External reviewer for CSR, ICALP, STACS and the Journal of Computer and System Sciences

2017: External reviewer for ISAAC and Algorithmica

2016: External reviewer for ESA

I am playing the clarinet since 2000 and have very basic knowledge and experience in conducting wind ensembles.

I enjoy dancing and have some experience in ballroom and Latin dances. My favourite is Quick Step.

I enjoy modern mainstream pop-culture in almost every form.