![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Fernando Sánchez Villaamil
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j6]Katrin Casel, Jan Dreier
, Henning Fernau
, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen:
Complexity of independency and cliquy trees. Discret. Appl. Math. 272: 2-15 (2020)
2010 – 2019
- 2019
- [j5]Felix Reidl
, Fernando Sánchez Villaamil, Konstantinos S. Stavropoulos:
Characterising bounded expansion by neighbourhood complexity. Eur. J. Comb. 75: 152-168 (2019) - [j4]Erik D. Demaine, Felix Reidl
, Peter Rossmanith
, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
:
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. 105: 199-241 (2019) - 2018
- [j3]Li-Hsuan Chen, Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. Algorithms 11(7): 98 (2018) - [c9]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl
, Fernando Sánchez Villaamil, Blair D. Sullivan
, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. ALENEX 2018: 75-86 - 2017
- [j2]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Sebastian Ordyniak
, Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84: 219-242 (2017) - [i11]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. CoRR abs/1706.07851 (2017) - 2016
- [c8]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:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [i10]Felix Reidl, Fernando Sánchez Villaamil, Konstantinos S. Stavropoulos:
Characterising Bounded Expansion by Neighbourhood Complexity. CoRR abs/1603.09532 (2016) - [i9]Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, depth and space. CoRR abs/1607.00945 (2016) - 2015
- [j1]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl
, Fernando Sánchez Villaamil, Blair D. Sullivan
:
Zig-Zag Numberlink is NP-Complete. J. Inf. Process. 23(3): 239-245 (2015) - [c7]Pål Grønås Drange, Felix Reidl
, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. IPEC 2015: 402-413 - [c6]Matthew Farrell
, Timothy D. Goodrich, Nathan Lemons, Felix Reidl
, Fernando Sánchez Villaamil, Blair D. Sullivan
:
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. WAW 2015: 29-41 - [i8]Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar:
Fast Biclustering by Dual Parameterization. CoRR abs/1507.08158 (2015) - 2014
- [c5]Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
A Faster Parameterized Algorithm for Treedepth. ICALP (1) 2014: 931-942 - [c4]Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Finite Integer Index of Pathwidth and Treewidth. IPEC 2014: 258-269 - [i7]Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
A Faster Parameterized Algorithm for Treedepth. CoRR abs/1401.7540 (2014) - [i6]Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan:
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. CoRR abs/1406.2587 (2014) - [i5]Matthew Farrell, Timothy Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Hyperbolicity, degeneracy, and expansion of random intersection graphs. CoRR abs/1409.8196 (2014) - [i4]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Zig-Zag Numberlink is NP-Complete. CoRR abs/1410.5845 (2014) - [i3]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:
Kernelization and Sparseness: the case of Dominating Set. CoRR abs/1411.4575 (2014) - 2013
- [c3]Jakub Gajarský, Petr Hlinený
, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl
, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. ESA 2013: 529-540 - [i2]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. CoRR abs/1302.6863 (2013) - 2011
- [c2]Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil:
Black-and-White Threshold Graphs. CATS 2011: 121-130 - [c1]Philipp Kranen, Felix Reidl
, Fernando Sánchez Villaamil, Thomas Seidl
:
Hierarchical Clustering for Real-Time Stream Data with Noise. SSDBM 2011: 405-413 - [i1]Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil:
Black-and-white threshold graphs. CoRR abs/1104.3917 (2011)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint