I am Fernando Sánchez Villaamil, a PhD candidate at the Theoretical Computer Science chair at RWTH Aachen University since 2013. I am originally from the Canary Islands (Spain). While in Spain I attended a German school. With my German highschool degree in hand, I came to Germany in 2005 for my studies also at RWTH Aachen University. After an internship in the USA at Siemens working in Data Mining I came back to Aachen to pursue my PhD under my advisor Peter Rossmanith. Have a look at my CV.
I mainly work on Fixed Parameter Tractability, mostly on Algorithm Design for graph problems. Lately I have dabbled in Complex Networks, trying to apply deep mathematical results from graph theory to aid their analysis and the design of new algorithms.
In my free time I listen to more music than is healthy, read a few books, watch movies and conjure pseudo-deep philosophies.
- The presentation Fun with Parameterized Complexity at the NCSU Theory Seminar together with Felix Reidl.
- My lecture about MSO-checking on graphs for Blair Sullivan's CSC707 'Theory of computation' course.
- The presentation at ICALP 2014 of the paper A Faster Parameterized Algorithm for Treedepth.
- A talk on the finished tree-depth algorithm at the Department of Informatics, University of Bergen.
- A talk on the problem of computing tree-depth held at the Faculty of Informatics, Masaryk University.
- Fast Biclustering by Dual Parameterization
Kernelization and Sparseness: the case of Dominating
To be submitted
Zig-Zag Numberlink is NP-Complete
Accepted for a special edition of the Journal of Information Processing
Hyperbolicity, degeneracy, and expansion of
random intersection graphs
Work in progress
Structural Sparsity of Complex Networks:
Random Graph Models and Linear Algorithms
Work in progress
- Finite Integer Index of Pathwidth
Faster Parameterized Algorithm for Treedepth
Kernelization Using Structural Parameters on
Sparse Graph Classes.
Hierarchical Clustering for Real-Time Stream
Data with Noise.
Black--and--White Threshold Graphs.
Implementation of an Automated Proof for an
Algorithm Solving the Maximum Independent Set Problem.
2009, Technical Report