After aquiring my PhD in 2015 at the Theory Group (RWTH Aachen University), I worked for one year as a postdoc at the Theory in Practice Group (NCSU) and another year at Royal Holloway. I currently work as a lecturer for Birkbeck University of London.

My main interests are in parameterized complexity and graph theory. Currently I try to reconcile network theory and structural sparsity in order to bring efficient algorithms into application. Consequently I torture myself with random graph models and data analysis.

I really enjoy visualizing the concepts that crop up in our work. The following pictures are a selection of my favorites, feel free to use them however you see fit (with attribution, please).

The font used in these pictures is the great Alegreya which is available via google fonts.The authors of the excellent book Parameterized Algorithms asked me to illustrate it, which is why the book now contains drawings of a Platypus, a Squirrel, a Woodpecker, a Lemming and a Lokshtanov.

The following is a list of slides from past presentations. Feel free to contact me if you feel that something is missing.

- Slides for my talk on “Sparsity in Practice” for the Dagstuhl seminar “Sparsity in Algorithms, Combinatorics and Logic”
- My talk on algorithmic aspects of sparsity at the CanaDAM 2021 minisymposium “Invitation to Sparsity”
- A video of my talk on kernelization of domination and independence problems in sparse classes for IPEC 2021
- The four sets of slides on “Complex Networks and Sparsity” from the Sparsity DocCourse in Prague/Český Krumlov: All four talks where a joint collaboration with Professor Sullivan.
- The slides for Professor Sullivan's talk on our joint work BEAM me up: A tale of Bounded Expansion Algorithms in Metagenomics (huge pdf!), also at the Workshop on Structural Sparsity, Logic and Algorithms
- The slides for my talk on Finding classes of low complexity at the 2018 Warwick Workshop on Structural Sparsity, Logic and Algorithms
- My talk on Dense but sparse: graphs of low complexity at the Brno Working Seminar on Formal Models, Discrete Structures, and Algorithms
- My invited talk on applying theory in practise at the Workshop on Algorithms and Structure for Sparse Graphs in Warsaw
- The presentation of our paper on k-distinct in- and out-branchings for ICALP 2017
- The slides for my talk on neighbourhood complexity which I gave at Warwick and Royal Holloway (the corresponding paper is available on arxiv)
- My talk on Structural sparsity and complex networks at SIAM DM 2016 (for the mathematics community) and its counterpart held SIAM NS 2016 (for the netsci community)
- An undergraduate talk about Ramsey Theory for the SUM Series at NCSU
- The slides of my defense
- My talk on Structural sparsity in the real world at the ABC-Workshop 2015 in Aachen
- My talk on Structural sparsity in the real world at the Bergen algorithms seminar
- My joint talk with Fernando about Fun with Parameterized Complexity for the NCSU Theory Seminar
- My guest talk on Structural sparseness of complex networks at the Finse Winter School 2014.
- My talk on treedepth and graphs of bounded expansion at the Bergen algorithms seminar
- My talk on kernels in sparse graph classes via structural parameters at the Dagstuhl Seminar 'Bidimensional Structures: Algorithms, Combinatorics and Logic'
- My talk on kernels in sparse graph classes via structural parameters at TACO Day 2013 in Utrecht
- A talk on possible directions for kernels in sparse graphs for a working seminar in fall 2012 at Masaryk University, Brno
- My talk on linear kernels on graphs excluding a topological minor at TACO Day 2012 in Maastricht (I held the same talk at APEX 2012)
- The single slide of my One Minute Madness presentation at Tag der Informatik 2011
- Parameterized Reoptimization at the Young Researcher's Forum in Brno 2009

All publications prior to 2012 were during my undergraduate times.