Dr Felix Reidl — Birkbeck, University of London

Overview

ORCID

0000-0002-2354-3003

Research

Research interests

Sparse graphs
Parametrised algorithms
Real-world networks

Supervision and teaching

Supervision

Supervisions within Birkbeck:: 2

Current doctoral researchers

CHRISTINE AWOFESO

Nature of supervision:
Joint Principal Supervisor, Jan 2022 onwards
PATRICK GREAVES

Nature of supervision:
Joint Principal Supervisor, Oct 2022 onwards

Teaching

Teaching modules

Foundations of Data Science I (BUCI069H4)
Analytical Foundations of Data Science (BUCI091H7)

Publications

Article

Bentert, M. and Crane, A. and Drange, P.G. and Reidl, Felix and Sullivan, B.D. (2024) Correlation clustering with vertex splitting. Leibniz International Proceedings in Informatics (LIPIcs) 294, pp. 8:1-8:17. ISSN 1868-8969.
Reidl, Felix and Sullivan, B. (2023) A color-avoiding approach to subgraph counting in Bounded Expansion Classes. Algorithmica 85 (8), pp. 2318-2347. ISSN 0178-4617.
Lachish, Oded and Reidl, Felix and Trehan, Chhaya (2022) When you come at the King you best not miss. Leibniz International Proceedings in Informatics (LIPIcs). 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022) 250, pp. 25:1-25:12. ISSN 1868-8969.
Drange, P.G. and Muzi, I. and Reidl, Felix (2022) Harmless sets in sparse classes. Lecture Notes in Computer Science 13270, pp. 299-312. ISSN 0302-9743.
Brown, C.T. and Moritz, D. and O'Brien, M.P. and Reidl, Felix and Reiter, T. and Sullivan, B.D. (2020) Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity. Genome Biology 21 (164), ISSN 1474-760X.
Demaine, E.D. and Reidl, Felix and Rossmanith, P. and Villaamil Sánchez, F. and Sikdar, S. and Sullivan, B.D. (2019) Structural sparsity of complex networks: bounded expansion in random models and real-world graphs. Journal of Computer and System Sciences 105, pp. 199-241. ISSN 0022-0000.
Reidl, Felix and Sánchez Villaamil, F. and Stavropoulos, K. (2018) Characterising bounded expansion by neighbourhood complexity. European Journal of Combinatorics 75, pp. 152-168. ISSN 0195-6698.
Gutin, G.Z. and Reidl, Felix and Wahlström, M. and Zehavi, M. (2018) Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. Journal of Computer and System Sciences 95, pp. 69-85. ISSN 0022-0000.
Gutin, G.Z. and Reidl, Felix and Wahlström, M. (2018) k-distinct in- and out-branchings in digraphs. Journal of Computer and System Sciences 95, pp. 86-97. ISSN 0022-0000.
Gajarský, J. and Hlinený, P. and Obdrzálek, J. and Ordyniak, S. and Reidl, Felix and Rossmanith, P. and Sánchez Villaamil, F. and Sikdar, S. (2016) Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences 84, pp. 219-242. ISSN 0022-0000.
Kim, E.J. and Langer, A. and Paul, C. and Reidl, Felix and Rossmanith, P. and Sau, I. and Sikdar, S. (2015) Linear kernels and single-exponential algorithms via Protrusion Decompositions. ACM Transactions on Algorithms 12 (2), pp. 21:1-21:41. ISSN 1549-6325.

External Repositories

DBLP