Остановите войну!
for scientists:
default search action
Ignasi Sau
- > Home > Persons > Ignasi Sau
Publications
- 2023
- [j73]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52(4): 865-912 (2023) - 2021
- [i53]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR abs/2103.06536 (2021) - [i52]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR abs/2103.06614 (2021) - 2020
- [j58]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. 109: 56-77 (2020) - [j57]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks 75(3): 259-277 (2020) - [j56]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. 34(3): 1623-1648 (2020) - [j55]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. 814: 135-152 (2020) - [c45]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA 2020: 951-970 - 2019
- [j52]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. 267: 30-40 (2019) - [j50]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91(3): 251-258 (2019) - [i39]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR abs/1907.04442 (2019) - 2018
- [j44]Julien Baste, Marc Noy, Ignasi Sau:
On the number of labeled graphs of bounded treewidth. Eur. J. Comb. 71: 12-21 (2018) - [j41]Júlio Araújo, Julien Baste, Ignasi Sau:
Ruling out FPT algorithms for Weighted Coloring on forests. Theor. Comput. Sci. 729: 11-19 (2018) - [c41]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC 2018: 2:1-2:13 - 2017
- [j35]Júlio Araújo, Julien Baste, Ignasi Sau:
Ruling out FPT algorithms for Weighted Coloring on forests. Electron. Notes Discret. Math. 62: 195-200 (2017) - [j34]Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau:
On the parameterized complexity of the Edge Monitoring problem. Inf. Process. Lett. 121: 39-44 (2017) - [j31]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau:
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61(3): 777-794 (2017) - [c37]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC 2017: 3:1-3:12 - [c36]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC 2017: 4:1-4:12 - [c34]Julien Baste, Marc Noy, Ignasi Sau:
On the Number of Labeled Graphs of Bounded Treewidth. WG 2017: 88-99 - [c33]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely Restricted Matchings and Edge Colorings. WG 2017: 100-112 - [i34]Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR abs/1703.01686 (2017) - [i32]Júlio Araújo, Julien Baste, Ignasi Sau:
Ruling out FPT algorithms for Weighted Coloring on forests. CoRR abs/1703.09726 (2017) - [i31]Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR abs/1704.07284 (2017) - 2016
- [c32]Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca:
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM 2016: 53-64 - [i27]Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca:
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR abs/1604.03008 (2016) - [i26]Julien Baste, Marc Noy, Ignasi Sau:
The number of labeled graphs of bounded treewidth. CoRR abs/1604.07273 (2016) - [i22]Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely restricted matchings and edge colorings. CoRR abs/1611.06815 (2016) - 2015
- [j25]Julien Baste, Ignasi Sau:
The role of planarity in connectivity problems parameterized by treewidth. Theor. Comput. Sci. 570: 1-14 (2015) - [i20]Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau:
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR abs/1504.05515 (2015) - 2014
- [c24]Julien Baste, Ignasi Sau:
The Role of Planarity in Connectivity Problems Parameterized by Treewidth. IPEC 2014: 63-74 - 2013
- [i9]Julien Baste, Ignasi Sau:
The role of planarity in connectivity problems parameterized by treewidth. CoRR abs/1312.2889 (2013)
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-25 01:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint