Black-and-White Threshold Graphs. - Ling-Ju Hung; Ton Kloks; Fernando Sánchez Villaamil (CATS, 2011)

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

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)

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)

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)

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)

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

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)

Complexity of independency and cliquy trees. - Katrin Casel; Jan Dreier; Henning Fernau; Moritz Gobbert; Philipp Kuinke; Fernando Sánchez Villaamil; Markus L. Schmid; Erik Jan van Leeuwen (Discret. Appl. Math., 2020)