Fernando Sánchez Villaamil

According to our database, Fernando Sánchez Villaamil authored at least 17 papers between 2011 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

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

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

Characterising bounded expansion by neighbourhood complexity.

Felix Reidl, Fernando Sánchez Villaamil, Konstantinos S. Stavropoulos

Eur. J. Comb., 2019

2018

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming.

Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil

Algorithms, 2018

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

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

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

2016

Width, depth and space.

Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil

CoRR, 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, Sebastian Siebertz, Somnath Sikdar

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

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

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs.

Matthew Farrell, Timothy D. Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

Fast Biclustering by Dual Parameterization.

Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

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, Fernando Sánchez Villaamil, Somnath Sikdar

CoRR, 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

Finite Integer Index of Pathwidth and Treewidth.

Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

A Faster Parameterized Algorithm for Treedepth.

Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2011

Hierarchical Clustering for Real-Time Stream Data with Noise.

Philipp Kranen, Felix Reidl, Fernando Sánchez Villaamil, Thomas Seidl

Proceedings of the Scientific and Statistical Database Management, 2011

Black-and-White Threshold Graphs.

Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011