Air-Indexing on Error Prone Communication Channels. - Emmanuel Müller; Philipp Kranen; Michael Nett; Felix Reidl; Thomas Seidl 001 (DASFAA (1), 2010)

Hierarchical Clustering for Real-Time Stream Data with Noise. - Philipp Kranen; Felix Reidl; Fernando Sánchez Villaamil; Thomas Seidl 001 (SSDBM, 2011)

Evaluation of an MSO-Solver. - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (ALENEX, 2012)

Linear Kernels on Graphs Excluding Topological Minors - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (CoRR, 2012)

A Faster Parameterized Algorithm for Treedepth. - Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (ICALP (1), 2014)

Finite Integer Index of Pathwidth and Treewidth. - Jakub Gajarský; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2014)

Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (CoRR, 2014)

Kernelization and Sparseness: the case of Dominating Set. - Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Saket Saurabh 001; Fernando Sánchez Villaamil; Somnath Sikdar (CoRR, 2014)

Overlapping Communities in Social Networks. - Jan Dreier; Philipp Kuinke; Rafael Przybylski; Felix Reidl; Peter Rossmanith; Somnath Sikdar (CoRR, 2014)

Practical algorithms for MSO model-checking on tree-decomposable graphs. - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (Comput. Sci. Rev., 2014)

Fast Biclustering by Dual Parameterization. - Pål Grønås Drange; Felix Reidl; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2015)

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. - Matthew Farrell; Timothy D. Goodrich; Nathan Lemons; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan (WAW, 2015)

Zig-Zag Numberlink is NP-Complete. - Aaron B. Adcock; Erik D. Demaine; Martin L. Demaine; Michael P. O'Brien; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan (J. Inf. Process., 2015)

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. - Alex J. Chin; Timothy D. Goodrich; Michael P. O'Brien; Felix Reidl; Blair D. Sullivan; Andrew van der Poel (ICDM, 2016)

Kernelization and Sparseness: the Case of Dominating Set. - Pål Grønås Drange; Markus Sortland Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Fernando Sánchez Villaamil; Saket Saurabh 001; Sebastian Siebertz; Somnath Sikdar (STACS, 2016)

Width, depth and space. - Li-Hsuan Chen; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil (CoRR, 2016)

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. - Eun Jung Kim 002; Alexander Langer; Christophe Paul; Felix Reidl; Peter Rossmanith; Ignasi Sau; Somnath Sikdar (ACM Trans. Algorithms, 2016)

Structural sparseness and complex networks. - Felix Reidl (2016)

k-Distinct In- and Out-Branchings in Digraphs. - Gregory Z. Gutin; Felix Reidl; Magnus Wahlström (ICALP, 2017)

Being Even Slightly Shallow Makes Life Hard. - Irene Muzi; Michael P. O'Brien; Felix Reidl; Blair D. Sullivan (MFCS, 2017)

Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. - Gregory Z. Gutin; Felix Reidl; Magnus Wahlström; Meirav Zehavi (CoRR, 2017)

Kernelization using structural parameters on sparse graph classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (J. Comput. Syst. Sci., 2017)

A practical fpt algorithm for Flow Decomposition and transcript assembly. - Kyle Kloster; Philipp Kuinke; Michael P. O'Brien; Felix Reidl; Fernando Sánchez Villaamil; Blair D. Sullivan; Andrew van der Poel (ALENEX, 2018)

Parameterized Algorithms for Zero Extension and Metric Labelling Problems. - Felix Reidl; Magnus Wahlström (ICALP, 2018)

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. - Li-Hsuan Chen; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil (Algorithms, 2018)

Searching for Maximum Out-Degree Vertices in Tournaments. - Gregory Z. Gutin; George B. Mertzios; Felix Reidl (CoRR, 2018)

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. - Gregory Z. Gutin; George B. Mertzios; Felix Reidl (CoRR, 2018)

k-distinct in- and out-branchings in digraphs. - Gregory Z. Gutin; Felix Reidl; Magnus Wahlström (J. Comput. Syst. Sci., 2018)

Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. - Gregory Z. Gutin; Felix Reidl; Magnus Wahlström; Meirav Zehavi (J. Comput. Syst. Sci., 2018)

Domination Above r-Independence: Does Sparseness Help? - Carl Einarson; Felix Reidl (MFCS, 2019)

Longest paths in 2-edge-connected cubic graphs. - Nikola K. Blanchard; Eldar Fischer; Oded Lachish; Felix Reidl (CoRR, 2019)

Characterising bounded expansion by neighbourhood complexity. - Felix Reidl; Fernando Sánchez Villaamil; Konstantinos S. Stavropoulos (Eur. J. Comb., 2019)

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (J. Comput. Syst. Sci., 2019)

Path-contractions, edge deletions and connectivity preservation. - Gregory Z. Gutin; M. S. Ramanujan 001; Felix Reidl; Magnus Wahlström (J. Comput. Syst. Sci., 2019)

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. - Wojciech Nadara; Marcin Pilipczuk; Roman Rabinovich 001; Felix Reidl; Sebastian Siebertz (ACM J. Exp. Algorithmics, 2019)

A General Kernelization Technique for Domination and Independence Problems in Sparse Classes. - Carl Einarson; Felix Reidl (IPEC, 2020)

Alternative parameterizations of Metric Dimension. - Gregory Z. Gutin; M. S. Ramanujan 001; Felix Reidl; Magnus Wahlström (Theor. Comput. Sci., 2020)

Kernelization and hardness of harmless sets in sparse classes. - Pål Grønås Drange; Irene Muzi; Felix Reidl (CoRR, 2021)

When You Come at the King You Best Not Miss. - Oded Lachish; Felix Reidl; Chhaya Trehan (FSTTCS, 2022)

Harmless Sets in Sparse Classes. - Pål Grønås Drange; Irene Muzi; Felix Reidl (IWOCA, 2022)

When you come at the kings you best not miss. - Oded Lachish; Felix Reidl; Chhaya Trehan (CoRR, 2022)

Computing Complexity Measures of Degenerate Graphs. - Pål Grønås Drange; Patrick Greaves; Irene Muzi; Felix Reidl (IPEC, 2023)

A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. - Felix Reidl; Blair D. Sullivan (Algorithmica, 2023)

Correlation Clustering with Vertex Splitting. - Matthias Bentert; Alex Crane; Pål Grønås Drange; Felix Reidl; Blair D. Sullivan (SWAT, 2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. - Yosuke Mizutani; Daniel Coimbra Salomao; Alex Crane; Matthias Bentert; Pål Grønås Drange; Felix Reidl; Alan Kuntz; Blair D. Sullivan (CoRR, 2024)

Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help? - Matthias Bentert; Daniel Coimbra Salomao; Alex Crane; Yosuke Mizutani; Felix Reidl; Blair D. Sullivan (CoRR, 2024)

Testing C_k-Freeness in Bounded Admissibility Graphs. - Christine Awofeso; Patrick Greaves; Oded Lachish; Amit Levi; Felix Reidl (ICALP, 2025)

Results on H-Freeness Testing in Graphs of Bounded r-Admissibility. - Christine Awofeso; Patrick Greaves; Oded Lachish; Felix Reidl (STACS, 2025)

A Practical Algorithm for 2-Admissibility. - Christine Awofeso; Patrick Greaves; Oded Lachish; Felix Reidl (SEA, 2025)