- 17
- 3
- 1
- 1
- 1
Ignasi Sau
23
Documents
Identifiants chercheurs
- ignasi-sau
- 0000-0002-8981-9287
- IdRef : 137767420
Présentation
See also : <http://www.lirmm.fr/~sau/Pubs.html>
Publications
- 14
- 11
- 11
- 6
- 6
- 5
- 5
- 5
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 23
- 9
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 23
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 2
- 3
- 7
- 3
- 1
- 1
- 15
- 8
- 1
- 1
|
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundarySODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.951-970, ⟨10.1137/1.9781611975994.57⟩
Communication dans un congrès
lirmm-02991215v1
|
|
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by TreewidthIPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13, ⟨10.4230/LIPIcs.IPEC.2018.2⟩
Communication dans un congrès
lirmm-02342806v1
|
|
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12, ⟨10.4230/LIPIcs.IPEC.2017.4⟩
Communication dans un congrès
hal-01733845v1
|
|
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost DiameterIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12, ⟨10.4230/LIPIcs.IPEC.2017.3⟩
Communication dans un congrès
hal-01733767v1
|
Uniquely Restricted Matchings and Edge ColoringsWG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.100-112, ⟨10.1007/978-3-319-68705-6_8⟩
Communication dans un congrès
hal-01734132v1
|
|
|
On the Number of Labeled Graphs of Bounded TreewidthWG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.88-99, ⟨10.1007/978-3-319-68705-6_7⟩
Communication dans un congrès
hal-01734085v1
|
|
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesAAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64, ⟨10.1007/978-3-319-41168-2_5⟩
Communication dans un congrès
lirmm-01481368v1
|
|
The role of planarity in connectivity problems parameterized by treewidthIPEC 2014 - 9th International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.63-74, ⟨10.1007/978-3-319-13524-3_6⟩
Communication dans un congrès
lirmm-01481432v1
|
Parameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion2016
Pré-publication, Document de travail
lirmm-01272704v1
|