Accéder directement au contenu

Ignasi Sau

23
Documents
Identifiants chercheurs

Présentation

See also : <http://www.lirmm.fr/~sau/Pubs.html>

Publications

baste
Image document

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
SIAM Journal on Computing, 2023, 52 (4), pp.865-912. ⟨10.1137/21M140482X⟩
Article dans une revue lirmm-04171495v1
Image document

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
SIAM Journal on Discrete Mathematics, 2020, 34 (3), pp.1623-1648. ⟨10.1137/19M1287146⟩
Article dans une revue lirmm-02989921v1
Image document

Hitting minors on bounded treewidth graphs. III. Lower bounds

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
Journal of Computer and System Sciences, 2020, 109, pp.56-77. ⟨10.1016/j.jcss.2019.11.002⟩
Article dans une revue lirmm-02989938v1
Image document

Parameterized complexity of finding a spanning tree with minimum reload cost diameter

Julien Baste , Didem Gözüpek , Christophe Paul , Ignasi Sau , Mordechai Shalom
Networks, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩
Article dans une revue lirmm-02989889v1
Image document

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
Theoretical Computer Science, 2020, 814, pp.135-152. ⟨10.1016/j.tcs.2020.01.026⟩
Article dans une revue lirmm-02989928v1
Image document

Approximating maximum uniquely restricted matchings in bipartite graphs

Julien Baste , Dieter Rautenbach , Ignasi Sau
Discrete Applied Mathematics, 2019, 267, pp.30-40. ⟨10.1016/j.dam.2019.04.024⟩
Article dans une revue lirmm-02410617v1
Image document

Upper bounds on the uniquely restricted chromatic index

Julien Baste , Dieter Rautenbach , Ignasi Sau
Journal of Graph Theory, 2019, 91 (3), pp.251-258. ⟨10.1002/jgt.22429⟩
Article dans une revue lirmm-02412578v1
Image document

Ruling out FPT algorithms for Weighted Coloring on forests

Julio Araujo , Julien Baste , Ignasi Sau
Theoretical Computer Science, 2018, 729, pp.11-19. ⟨10.1016/j.tcs.2018.03.013⟩
Article dans une revue hal-03109986v1
Image document

On the number of labeled graphs of bounded treewidth

Julien Baste , Marc Noy , Ignasi Sau
European Journal of Combinatorics, 2018, 71, pp.12-21. ⟨10.1016/j.ejc.2018.02.030⟩
Article dans une revue hal-03109959v1
Image document

Ruling out FPT algorithms for Weighted Coloring on forests

Julio Araujo , Julien Baste , Ignasi Sau
Electronic Notes in Discrete Mathematics, 2017, 62, pp.195-200. ⟨10.1016/j.endm.2017.10.034⟩
Article dans une revue hal-01733595v1

On the parameterized complexity of the Edge Monitoring problem

Julien Baste , Fairouz Beggas , Hamamache Kheddouci , Ignasi Sau
Information Processing Letters, 2017, 121, pp.39-44. ⟨10.1016/j.ipl.2017.01.008⟩
Article dans une revue lirmm-01487565v1

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion

Julien Baste , Luerbio Faria , Sulamita Klein , Ignasi Sau
Theory of Computing Systems, 2017, 61 (3), pp.777-794. ⟨10.1007/s00224-016-9716-y⟩
Article dans une revue lirmm-01630773v1

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees

Julien Baste , Christophe Paul , Ignasi Sau , Celine Scornavacca
Bulletin of Mathematical Biology, 2016, 79 (4), pp.920-938. ⟨10.1007/s11538-017-0260-y⟩
Article dans une revue lirmm-03113710v1

The role of planarity in connectivity problems parameterized by treewidth

Julien Baste , Ignasi Sau
Theoretical Computer Science, 2015, 570, pp.1-14. ⟨10.1016/j.tcs.2014.12.010⟩
Article dans une revue lirmm-01272664v1
Image document

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
SODA 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
Image document

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
IPEC 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
Image document

On the Number of Labeled Graphs of Bounded Treewidth

Julien Baste , Marc Noy , Ignasi Sau
WG 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
Image document

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth

Julien Baste , Ignasi Sau , Dimitrios M. Thilikos
IPEC 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

Uniquely Restricted Matchings and Edge Colorings

Julien Baste , Dieter Rautenbach , Ignasi Sau
WG 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
Image document

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter

Julien Baste , Didem Gözüpek , Ignasi Sau , Mordechai Shalom , Dimitrios M. Thilikos
IPEC 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
Image document

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees

Julien Baste , Christophe Paul , Ignasi Sau , Celine Scornavacca
AAIM: 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
Image document

The role of planarity in connectivity problems parameterized by treewidth

Julien Baste , Ignasi Sau
IPEC 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