Felix Reidl
Lecturer, Ethics Officer, Admissions Tutor - MSc CS, MSc DSTeaches: Foundations of Data Science I, Systems Analysis and Design I
Contact Information
- Room
- MAL157
- Telephone
- 020 3926 1275
- Email address
- Enable JavaScript to view protected content.
Research
Areas of interest: Algorithmic graph theory, random graph models of complex networks, structural sparsity, parameterized complexity.
Key Publications
- Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity. (2020)
- Practical algorithms for MSO model-checking on tree-decomposable graphs. (2014)
- Zig-Zag Numberlink is NP-Complete. (2015)
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. (2016)
- Kernelization using structural parameters on sparse graph classes. (2017)