Access content directly

Ignasi Sau

141
Documents
Researcher identifiers

Presentation

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

Publications

Image document

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

Stéphane Bessy , Florian Hörsch , Ana Karolinna Maia , Dieter Rautenbach , Ignasi Sau
Discrete Applied Mathematics, 2024, 346, pp.80-94. ⟨10.1016/j.dam.2023.11.026⟩
Journal articles lirmm-04352990v1
Image document

k-apices of minor-closed graph classes. I. Bounding the obstructions

Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
Journal of Combinatorial Theory, Series B, 2023, 161, pp.180-227. ⟨10.1016/j.jctb.2023.02.012⟩
Journal articles lirmm-04028310v1
Image document

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets

Júlio Araújo , Marin Bougeret , Victor Campos , Ignasi Sau
Algorithmica, 2023, 85 (2), pp.444-491. ⟨10.1007/s00453-022-01036-5⟩
Journal articles lirmm-04028295v1
Image document

Target set selection with maximum activation time

Lucas Keiler , Carlos Vinicius Gomes Costa Lima , Ana Karolinna Maia , Rudini Sampaio , Ignasi Sau
Discrete Applied Mathematics, 2023, 338, pp.199-217. ⟨10.1016/j.dam.2023.06.004⟩
Journal articles lirmm-04140763v1
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⟩
Journal articles lirmm-04171495v1
Image document

Reducing the vertex cover number via edge contractions

Paloma Thomé de Lima , Vinicius F. dos Santos , Ignasi Sau , Uéverton dos Santos Souza , Prafullkumar Tale
Journal of Computer and System Sciences, 2023, 136, pp.63-87. ⟨10.1016/j.jcss.2023.03.003⟩
Journal articles lirmm-04107607v1
Image document

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Marin Bougeret , Bart M P Jansen , Ignasi Sau
SIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2737-2773. ⟨10.1137/21m1400766⟩
Journal articles lirmm-04028294v1
Image document

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms

Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
ACM Transactions on Algorithms, 2022, 18 (3), pp.1-30. ⟨10.1145/3519028⟩
Journal articles hal-03835923v1
Image document

Adapting the Directed Grid Theorem into an FPT Algorithm

Victor Campos , Raul Lopes , Ana Karolinna Maia , Ignasi Sau
SIAM Journal on Discrete Mathematics, 2022, 36 (3), pp.1887-1917. ⟨10.1137/21m1452664⟩
Journal articles lirmm-04028302v1
Image document

Introducing lop-Kernels: A Framework for Kernelization Lower Bounds

Júlio Araújo , Marin Bougeret , Victor Campos , Ignasi Sau
Algorithmica, 2022, 84 (11), pp.3365-3406. ⟨10.1007/s00453-022-00979-z⟩
Journal articles lirmm-03991247v1
Image document

A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps

Raul Lopes , Ignasi Sau
Theoretical Computer Science, 2022, 898, pp.75-91. ⟨10.1016/j.tcs.2021.10.023⟩
Journal articles lirmm-03772271v1
Image document

Coloring Problems on Bipartite Graphs of Small Diameter

Victor A Campos , Guilherme C.M. Gomes , Allen Ibiapina , Raul Lopes , Ignasi Sau
The Electronic Journal of Combinatorics, 2021, 28 (2), pp.#P2.14. ⟨10.37236/9931⟩
Journal articles lirmm-03374527v1
Image document

A Unifying Model for Locally Constrained Spanning Tree Problems

Luiz Alberto Do Carmo Viana , Manoel Campêlo , Ignasi Sau , Ana Silva
Journal of Combinatorial Optimization, 2021, 42 (1), pp.125-150. ⟨10.1007/s10878-021-00740-2⟩
Journal articles lirmm-03374555v1
Image document

Finding Cuts of Bounded Degree

Guilherme C M Gomes , Ignasi Sau
Algorithmica, 2021, 83 (6), pp.1677-1706. ⟨10.1007/s00453-021-00798-8⟩
Journal articles lirmm-03374542v1
Image document

On the complexity of finding large odd induced subgraphs and odd colorings

Rémy Belmonte , Ignasi Sau
Algorithmica, 2021, 83 (8), pp.2351-2373. ⟨10.1007/s00453-021-00830-x⟩
Journal articles lirmm-03374591v1
Image document

Reducing graph transversals via edge contractions

Paloma T Lima , Vinicius F dos Santos , Ignasi Sau , Uéverton S Souza
Journal of Computer and System Sciences, 2021, 120, pp.62-74. ⟨10.1016/j.jcss.2021.03.003⟩
Journal articles lirmm-03374537v1
Image document

Target set selection with maximum activation time

Lucas Keiler , Carlos V.G.C. Lima , Ana Karolinna Maia , Rudini Sampaio , Ignasi Sau
Procedia Computer Science, 2021, 195, pp.86-96. ⟨10.1016/j.procs.2021.11.014⟩
Journal articles lirmm-03772657v1
Image document

Hitting forbidden induced subgraphs on bounded treewidth graphs

Ignasi Sau , Uéverton dos Santos Souza
Information and Computation, 2021, 281, pp.104812. ⟨10.1016/j.ic.2021.104812⟩
Journal articles lirmm-03772257v1
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⟩
Journal articles lirmm-02989928v1
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⟩
Journal articles lirmm-02989921v1
Image document

Maximum cuts in edge-colored graphs

Luerbio Faria , Sulamita Klein , Ignasi Sau , Uéverton dos Santos Souza , Rubens Sucupira
Discrete Applied Mathematics, 2020, 281, pp.229-234. ⟨10.1016/j.dam.2019.02.038⟩
Journal articles lirmm-02989852v1
Image document

Dual Parameterization of Weighted Coloring

Júlio Araújo , Victor A Campos , Carlos Vinícius G. C. Lima , Vinícius Fernandes dos Santos , Ignasi Sau
Algorithmica, 2020, 82 (8), pp.2316-2336. ⟨10.1007/s00453-020-00686-7⟩
Journal articles lirmm-02989870v1
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⟩
Journal articles lirmm-02989938v1
Image document

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths

Júlio Araújo , Victor A Campos , Ana Karolinna Maia de Oliveira , Ignasi Sau , Ana Silva
Algorithmica, 2020, 82 (6), pp.1616-1639. ⟨10.1007/s00453-019-00659-5⟩
Journal articles lirmm-02989813v1
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⟩
Journal articles lirmm-02989889v1
Image document

Counting Gallai 3-colorings of complete graphs

Josefran de Oliveira Bastos , Fabrício Siqueira Benevides , Guilherme Oliveira Mota , Ignasi Sau
Discrete Mathematics, 2019, 342 (9), pp.2618-2631. ⟨10.1016/j.disc.2019.05.015⟩
Journal articles lirmm-02410619v1
Image document

Weighted proper orientations of trees and graphs of bounded treewidth

Julio Araujo , Cláudia Linhares Sales , Ignasi Sau , Ana Silva
Theoretical Computer Science, 2019, 771, pp.39-48. ⟨10.1016/j.tcs.2018.11.013⟩
Journal articles lirmm-02410622v1
Image document

Adapting The Directed Grid Theorem into an FPT Algorithm

Victor Campos , Raul Lopes , Ana Karolinna Maia de Oliviera , Ignasi Sau
Electronic Notes in Theoretical Computer Science, 2019, 346, pp.229-240. ⟨10.1016/j.entcs.2019.08.021⟩
Journal articles lirmm-02410620v1
Image document

How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?

Marin Bougeret , Ignasi Sau
Algorithmica, 2019, 81 (10), pp.4043-4068. ⟨10.1007/s00453-018-0468-8⟩
Journal articles lirmm-02410618v1
Image document

Explicit Linear Kernels for Packing Problems

Valentin Garnero , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
Algorithmica, 2019, 81 (4), pp.1615-1656. ⟨10.1007/s00453-018-0495-5⟩
Journal articles lirmm-02342736v1
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⟩
Journal articles 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⟩
Journal articles lirmm-02412578v1
Image document

On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs

Sancrey Rodrigues Alves , Konrad K. Dabrowski , Luerbio Faria , Sulamita Klein , Ignasi Sau
Theoretical Computer Science, 2018, 746, pp.36-48. ⟨10.1016/j.tcs.2018.06.024⟩
Journal articles lirmm-03110090v1
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⟩
Journal articles hal-03109986v1

A Tight Erdös-Pósa Function for Wheel Minors

Pierre Aboulker , Samuel Fiorini , Tony Huynh , Gwénaël Joret , Jean-Florent Raymond
SIAM Journal on Discrete Mathematics, 2018, 32 (3), pp.2302-2312. ⟨10.1137/17M1153169⟩
Journal articles hal-01995696v1
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⟩
Journal articles hal-03109959v1
Image document

An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
Algorithmica, 2018, 80 (4), pp.1330-1356. ⟨10.1007/s00453-017-0313-5⟩
Journal articles lirmm-01609998v1

Improved FPT algorithms for weighted independent set in bull-free graphs

Henri Perret Du Cray , Ignasi Sau
Discrete Mathematics, 2018, 341 (2), pp.451-462. ⟨10.1016/j.disc.2017.09.012⟩
Journal articles hal-01733496v1

A Linear Kernel for Planar Total Dominating Set

Valentin Garnero , Ignasi Sau
Discrete Mathematics and Theoretical Computer Science, 2018, 20 (1), ⟨10.23638/DMTCS-20-1-14⟩
Journal articles lirmm-03124041v1
Image document

Complexity dichotomies for the Minimum F -Overlay problem

Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant
Journal of Discrete Algorithms, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩
Journal articles hal-01947563v1
Image document

An FPT 2-Approximation for Tree-Cut Decomposition

Eun Jung Kim , Sang-Il Oum , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
Algorithmica, 2018, 80 (1), pp.116-135. ⟨10.1007/s00453-016-0245-5⟩
Journal articles hal-01690385v1

Parameterized algorithms for min-max multiway cut and list digraph homomorphism

Eun Jung Kim , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
Journal of Computer and System Sciences, 2017, 86, pp.191-206. ⟨10.1016/j.jcss.2017.01.003⟩
Journal articles lirmm-01487567v1

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

Didem Gözüpek , Sibel Özkan , Christophe Paul , Ignasi Sau , Mordechai Shalom
Theoretical Computer Science, 2017, 690, pp.91-103. ⟨10.1016/j.tcs.2017.06.013⟩
Journal articles lirmm-01630777v1

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⟩
Journal articles lirmm-01487565v1
Image document

A polynomial-time algorithm for Outerplanar Diameter Improvement

Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau
Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩
Journal articles hal-01592242v1

Maximum Cuts in Edge-colored Graphs

Rubens Sucupira , Luerbio Faria , Sulamita Klein , Ignasi Sau , Uéverton dos Santos Souza
Electronic Notes in Discrete Mathematics, 2017, 62, pp.87 - 92. ⟨10.1016/j.endm.2017.10.016⟩
Journal articles hal-01733581v1
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⟩
Journal articles hal-01733595v1
Image document

Minors in graphs of large θr-girth

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
European Journal of Combinatorics, 2017, 65, pp.106-121. ⟨10.1016/j.ejc.2017.04.011⟩
Journal articles hal-01218519v2
Image document

On the complexity of computing the k-restricted edge-connectivity of a graph

Luis Pedro Montejano , Ignasi Sau
Theoretical Computer Science, 2017, 662, pp.31-39. ⟨10.1016/j.tcs.2016.12.006⟩
Journal articles lirmm-01481786v1

A linear kernel for planar red–blue dominating set

Valentin Garnero , Ignasi Sau , Dimitrios M. Thilikos
Discrete Applied Mathematics, 2017, 217, pp.536-547. ⟨10.1016/j.dam.2016.09.045⟩
Journal articles lirmm-01481785v1

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⟩
Journal articles lirmm-01630773v1

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions

Eun Jung Kim , Alexander Langer , Christophe Paul , Felix Reidl , Peter Rossmanith
ACM Transactions on Algorithms, 2016, 12 (2), pp.No. 21. ⟨10.1145/2797140⟩
Journal articles lirmm-01288472v1

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⟩
Journal articles lirmm-03113710v1
Image document

An edge variant of the Erdős–Pósa property

Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
Discrete Mathematics, 2016, 339 (8), pp.2027-2035. ⟨10.1016/j.disc.2016.03.004⟩
Journal articles lirmm-01347430v2

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⟩
Journal articles lirmm-01272664v1

Explicit Linear Kernels via Dynamic Programming

Valentin Garnero , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
SIAM Journal on Discrete Mathematics, 2015, 29 (4), pp.1864-1894. ⟨10.1137/140968975⟩
Journal articles lirmm-01263857v1

Hitting and harvesting pumpkins

Gwénaël Joret , Christophe Paul , Ignasi Sau , Saket Saurabh , Stéphan Thomassé
SIAM Journal on Discrete Mathematics, 2014, 28 (3), pp.1363-1390. ⟨10.1137/120883736⟩
Journal articles hal-01178192v1
Image document

Dynamic Programming for Graphs on Surfaces

Juanjo Rué , Ignasi Sau , Dimitrios M. Thilikos
ACM Transactions on Algorithms, 2014, 10 (2), pp.1-26/8. ⟨10.1145/2556952⟩
Journal articles lirmm-01083690v1

Parameterized domination in circle graphs

Christophe Paul , Nicolas Bousquet , Daniel Gonçalves , George Mertzios , Ignasi Sau
Theory of Computing Systems, 2014, 54 (1), pp.45-72. ⟨10.1007/s00224-013-9478-8⟩
Journal articles hal-01178188v1

On approximating the $d$-girth of a graph

David Peleg , Ignasi Sau , Mordechai Shalom
Discrete Applied Mathematics, 2013, 161 (16-17), pp.2587-2596. ⟨10.1016/j.dam.2013.04.022⟩
Journal articles lirmm-01272717v1

Asymptotic enumeration of non-crossing partitions on surfaces

Dimitrios M. Thilikos , Ignasi Sau , Juanjo Rué
Discrete Mathematics, 2013, pp.635-649. ⟨10.1016/j.disc.2012.12.011⟩
Journal articles lirmm-00804780v1
Image document

Fast Minor Testing in Planar Graphs

Isolde Adler , Frederic Dorn , Fedor V. Fomin , Ignasi Sau , Dimitrios M. Thilikos
Algorithmica, 2012, 64 (1), pp.69-84. ⟨10.1007/s00453-011-9563-9⟩
Journal articles lirmm-00904515v1

Simpler multicoloring of triangle-free hexagonal graphs

Ignasi Sau , Petra Šparl , Janez Žerovnik
Discrete Mathematics, 2012, 312 (1), pp.181-187. ⟨10.1016/j.disc.2011.07.031⟩
Journal articles lirmm-00736521v1

Parameterized complexity of finding small degree-constrained subgraphs

Omid Amini , Ignasi Sau , Saket Saurabh
Journal of Discrete Algorithms, 2012, 10, pp.70-83. ⟨10.1016/j.jda.2011.05.001⟩
Journal articles lirmm-00736517v1

Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

George B. Mertzios , Ignasi Sau , Mordechai Shalom , Shmuel Zaks
IEEE/ACM Transactions on Networking, 2012, 20, pp.1-15. ⟨10.1109/TNET.2012.2186462⟩
Journal articles lirmm-00736699v1

On the approximability of some degree-constrained subgraph problems

Omid Amini , David Peleg , Stéphane Pérennes , Ignasi Sau , Saket Saurabh
Discrete Applied Mathematics, 2012, 160 (2), pp.1661-1679. ⟨10.1016/j.dam.2012.03.025⟩
Journal articles lirmm-00736702v1
Image document

GMPLS Label Space Minimization through Hypergraph Layouts

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Ignasi Sau
Theoretical Computer Science, 2012, 444, pp.3-16. ⟨10.1016/j.tcs.2012.01.033⟩
Journal articles hal-00706260v1

The Recognition of Tolerance and Bounded Tolerance Graphs

George B. Mertzios , Ignasi Sau , Shmuel Zaks
SIAM Journal on Computing, 2011, 40 (5), pp.1234-1257. ⟨10.1137/090780328⟩
Journal articles lirmm-00736512v1

Faster parameterized algorithms for minor containment

Isolde Adler , Frederic Dorn , Fedor V. Fomin , Ignasi Sau , Dimitrios M. Thilikos
Theoretical Computer Science, 2011, 412 (50), pp.7018-7028. ⟨10.1016/j.tcs.2011.09.015⟩
Journal articles lirmm-00736522v1
Image document

Traffic grooming in bidirectional WDM ring networks

Jean-Claude Bermond , Xavier Muñoz , Ignasi Sau
Networks, 2011, 58 (1), pp.20-35. ⟨10.1002/net.20410⟩
Journal articles hal-00643800v1
Image document

Circuits in graphs through a prescribed set of ordered vertices

David Coudert , Frédéric Giroire , Ignasi Sau
Journal of Interconnection Networks, 2011, 11 (3-4), pp.121-141. ⟨10.1142/S0219265910002763⟩
Journal articles inria-00585561v1

On self-duality of branchwidth in graphs of bounded genus

Ignasi Sau , Dimitrios M. Thilikos
Discrete Applied Mathematics, 2011, 159 (17), pp.2184-2186. ⟨10.1016/j.dam.2011.06.028⟩
Journal articles lirmm-00736520v1

Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs

Xavier Muñoz , Zhentao Li , Ignasi Sau
SIAM Journal on Discrete Mathematics, 2011, 25 (4), pp.1490-1505. ⟨10.1137/090775440⟩
Journal articles lirmm-00736697v1

Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4

Jean-Claude Bermond , Charles J. Colbourn , Lucia Gionfriddo , Gaetano Quattrocchi , Ignasi Sau
SIAM Journal on Discrete Mathematics, 2010, 24 (2), pp.400-419. ⟨10.1137/080744190⟩
Journal articles lirmm-00736478v1
Image document

DROP COST AND WAVELENGTH OPTIMAL TWO-PERIOD GROOMING WITH RATIO 4∗

Jean-Claude Bermond , Charles J. Colbourn , Lucia Gionfriddo , Gaetano Quattrocchi , Ignasi Sau
SIAM Journal on Discrete Mathematics, 2010, 24 (2), pp.400-419
Journal articles inria-00505516v1

Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

Ignasi Sau , Dimitrios M. Thilikos
Journal of Discrete Algorithms, 2010, 8 (3), pp.330-338. ⟨10.1016/j.jda.2010.02.002⟩
Journal articles lirmm-00736490v1
Image document

An optimal permutation routing algorithm on full-duplex hexagonal networks

Ignasi Sau , Janez Žerovnik
Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 3 (3), pp.49--62. ⟨10.46298/dmtcs.443⟩
Journal articles hal-00972334v1
Image document

Faster parameterized algorithms for modification problems to minor-closed classes

Laure Morelle , Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.93:1-93:19, ⟨10.48550/arXiv.2210.02167⟩
Conference papers lirmm-04253814v1
Image document

Compound Logics for Modification Problems

Fedor V. Fomin , Petr A. Golovach , Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.1-21, ⟨10.4230/LIPIcs.ICALP.2023.51⟩
Conference papers lirmm-04253801v1
Image document

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages

Victor Campos , Jonas Costa , Raul Lopes , Ignasi Sau
ESA 2023 - 31st Annual European Symposium on Algorithms, Sep 2023, Amsterdam, Netherlands. pp.30:1-30:18, ⟨10.4230/LIPIcs.ESA.2023.30⟩
Conference papers hal-04215020v1
Image document

Dynamic programming on bipartite tree decompositions

Lars Jaffke , Laure Morelle , Ignasi Sau , Dimitrios M. Thilikos
IPEC 2023 - 18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. pp.16:1-16:22
Conference papers lirmm-04253839v1
Image document

Reducing the Vertex Cover Number via Edge Contraction

Paloma T. Lima , Vinicius Fernandes dos Santos , Ignasi Sau , Uéverton dos Santos Souza , Prafullkumar Tale
MFCS 2022 - 47th International Symposium on Mathematical Foundations of Computer Science, Aug 2022, Vienna, Austria. pp.69:1-69:14, ⟨10.4230/LIPIcs.MFCS.2022.69⟩
Conference papers lirmm-03772619v1
Image document

A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover

Júlio Araújo , Marin Bougeret , Victor Campos , Ignasi Sau
IPEC 2021 - 16th International Symposium on Parameterized and Exact Computation, Sep 2021, Virtual, Portugal. pp.4:1-4:19, ⟨10.4230/LIPIcs.IPEC.2021.4⟩
Conference papers lirmm-03526704v1
Image document

A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps

Raul Lopes , Ignasi Sau
MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.68:1-68:15, ⟨10.4230/LIPIcs.MFCS.2020.68⟩
Conference papers lirmm-02991855v1
Image document

Reducing Graph Transversals via Edge Contractions

Paloma T. Lima , Vinicius Fernandes dos Santos , Ignasi Sau , Uéverton dos Santos Souza
MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.64:1-64:15, ⟨10.4230/LIPIcs.MFCS.2020.64⟩
Conference papers lirmm-02991812v1
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⟩
Conference papers lirmm-02991215v1
Image document

An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes

Ignasi Sau , Giannos Stamoulis , Dimitrios M. Thilikos
ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.95:1-95:20, ⟨10.4230/LIPIcs.ICALP.2020.95⟩
Conference papers lirmm-02991704v1
Image document

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

Marin Bougeret , Bart M P Jansen , Ignasi Sau
ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.16:1--16:19, ⟨10.4230/LIPIcs.ICALP.2020.16⟩
Conference papers lirmm-02991230v1
Image document

On the complexity of finding large odd induced subgraphs and odd colorings

Rémy Belmonte , Ignasi Sau
WG 2020 - 46th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2020, Leeds, United Kingdom. pp.67-79, ⟨10.1007/978-3-030-60440-0_6⟩
Conference papers lirmm-02991977v1
Image document

Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs

Ignasi Sau , Uéverton dos Santos Souza
MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.82:1-82:15, ⟨10.4230/LIPIcs.MFCS.2020.82⟩
Conference papers lirmm-02991913v1
Image document

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization

Guilherme C. M. Gomes , Ignasi Sau
IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.19:1--19:15, ⟨10.4230/LIPIcs.IPEC.2019.19⟩
Conference papers lirmm-02410703v1
Image document

Dual parameterization of Weighted Coloring

Julio Araujo , Victor Campos , Carlos Vinícius G. C. Lima , Vinicius Fernandes dos Santos , Ignasi Sau
IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.12:1--12:14, ⟨10.4230/LIPIcs.IPEC.2018.12⟩
Conference papers lirmm-02410739v1
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⟩
Conference papers lirmm-02342806v1
Image document

On the complexity of finding internally vertex-disjoint long directed paths

Julio Araujo , Victor Campos , Ana Karolinna Maia de Oliveira , Ignasi Sau , Ana Silva
LATIN 2018 - 13th Latin American Symposium on Theoretical Informatics, Apr 2018, Buenos Aires, Argentina. pp.66-79, ⟨10.1007/978-3-319-77404-6_6⟩
Conference papers lirmm-02410722v1
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⟩
Conference papers hal-01733845v1
Image document

On the Number of Labeled Graphs of Bounded Treewidth

Julien Baste , Marc Noy , Ignasi Sau
WG 2017 - 43rd International on Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.88-99, ⟨10.1007/978-3-319-68705-6_7⟩
Conference papers hal-01734085v1
Image document

How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?

Marin Bougeret , Ignasi Sau
IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.10:1--10:13, ⟨10.4230/LIPIcs.IPEC.2017.10⟩
Conference papers lirmm-01730228v1
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⟩
Conference papers hal-01733767v1
Image document

Complexity Dichotomies for the Minimum $F$-Overlay Problem

Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant
28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127, ⟨10.1007/978-3-319-78825-8_10⟩
Conference papers hal-01571229v1

Uniquely Restricted Matchings and Edge Colorings

Julien Baste , Dieter Rautenbach , Ignasi Sau
WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.100-112, ⟨10.1007/978-3-319-68705-6_8⟩
Conference papers hal-01734132v1

On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs

Sancrey Rodrigues Alves , Konrad K. Dabrowski , Luerbio Faria , Sulamita Klein , Ignasi Sau
COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437, ⟨10.1007/978-3-319-48749-6_31⟩
Conference papers lirmm-01481787v1
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⟩
Conference papers lirmm-01481368v1
Image document

Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability

Didem Gözüpek , Sibel Özkan , Christophe Paul , Ignasi Sau , Mordeshai Shalom
WG 2016 - 42nd International on Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.195-206, ⟨10.1007/978-3-662-53536-3_17⟩
Conference papers lirmm-01481360v1
Image document

An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩
Conference papers hal-01218496v1

An FPT 2-Approximation for Tree-cut Decomposition

Eun Jung Kim , Sang-Il Oum , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩
Conference papers lirmm-01264015v1
Image document

Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism

Eun Jung Kim , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩
Conference papers lirmm-01263999v1

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement

Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau
CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩
Conference papers hal-01178222v1
Image document

The role of planarity in connectivity problems parameterized by treewidth

Julien Baste , Ignasi Sau
IPEC: International symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.63-74, ⟨10.1007/978-3-319-13524-3_6⟩
Conference papers lirmm-01481432v1
Image document

Explicit linear kernels via dynamic programming

Valentin Garnero , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩
Conference papers hal-01084007v1

An edge variant of the Erdős-Pósa property

Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers lirmm-00904544v1
Image document

Covering and packing pumpkin models

Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos
ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Conference papers lirmm-01083652v1

Linear Kernels and Single-exponential Algorithms via Protrusion Decompositions

Eun Jung Kim , Alexander Langer , Christophe Paul , Felix Reidl , Peter Rossmanith
ICALP: International Colloquium on Automata, Languages and Programming, Jul 2013, Riga, Latvia. pp.613-624, ⟨10.1007/978-3-642-39206-1_52⟩
Conference papers lirmm-00829999v1
Image document

A linear kernel for planar red-blue dominating set

Valentin Garnero , Ignasi Sau , Dimitrios M. Thilikos
CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120
Conference papers lirmm-00846771v1
Image document

Dynamic Programming for $H$-minor-free Graphs

Juanjo Rué , Ignasi Sau , Dimitrios M. Thilikos
COCOON: Computing and Combinatorics Conference, Aug 2012, Sydney, NSW, Australia. pp.86-97, ⟨10.1007/978-3-642-32241-9_8⟩
Conference papers lirmm-00736708v1
Image document

Parameterized domination in circle graphs

Nicolas Bousquet , Daniel Gonçalves , George B. Mertzios , Christophe Paul , Ignasi Sau
WG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.45-72, ⟨10.1007/s00224-013-9478-8⟩
Conference papers lirmm-00738534v1
Image document

On Approximating the $d$-Girth of a Graph

David Peleg , Ignasi Sau , Mordechai Shalom
SOFSEM, Jan 2011, Nový Smokovec, Slovakia. pp.467-481, ⟨10.1007/978-3-642-18381-2_39⟩
Conference papers lirmm-00736705v1

Hitting and Harvesting Pumpkins

Gwénaël Joret , Christophe Paul , Ignasi Sau , Saket Saurabh , Stéphan Thomassé
ESA 2011 - 19th Annual European Symposium on Algorithms, Sep 2011, Saarbrücken, Germany. pp.394-407, ⟨10.1007/978-3-642-23719-5_34⟩
Conference papers lirmm-00642341v1
Image document

The Recognition of Tolerance and Bounded Tolerance Graphs

George B. Mertzios , Ignasi Sau , Shmuel Zaks
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.585-596
Conference papers inria-00455774v1
Image document

Fast Minor Testing in Planar Graphs

Isolde Adler , Frederic Dorn , Fedor V. Fomin , Ignasi Sau , Dimitrios M. Thilikos
ESA 2010 - 18th Annual European Symposium on Algorithms, Sep 2010, Liverpool, United Kingdom. pp.97-109, ⟨10.1007/978-3-642-15775-2_9⟩
Conference papers lirmm-00736769v1

Dynamic programming for graphs on surfaces

Juanjo Rué , Ignasi Sau , Dimitrios M. Thilikos
ICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383
Conference papers lirmm-00736703v1
Image document

Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids

David Coudert , Frédéric Giroire , Ignasi Sau
International Workshop on Combinatorial Algorithms -- IWOCA, Jun 2009, Hradec nad Moravicì, Czech Republic
Conference papers inria-00429146v1
Image document

Hardness of Approximating the Traffic Grooming Problem

Omid Amini , Stéphane Pérennes , Ignasi Sau
9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.45-48
Conference papers inria-00176960v1
Image document

Traffic Grooming in Bidirectional WDM Ring Networks

Jean-Claude Bermond , David Coudert , Xavier Munoz , Ignasi Sau
International Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. pp.19 - 22, ⟨10.1109/ICTON.2006.248390⟩
Conference papers inria-00429168v1

Traffic Grooming: Combinatorial Results and Practical Resolutions.

Tibor Cinkler , David Coudert , Michele Flammini , Gianpiero Monaco , Luca Moscardelli
Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. ⟨10.1007/978-3-642-02250-0⟩
Book sections inria-00530964v1
Image document

Redicolouring digraphs: directed treewidth and cycle-degeneracy

Nicolas Nisse , Lucas Picasarri-Arrieta , Ignasi Sau
Inria. 2023
Reports hal-04271445v1

An FPT 2-Approximation for Tree-Cut Decomposition

Eunjung Kim , Sang-Il Oum , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
[Research Report] LIRMM. 2015
Reports lirmm-01225569v1

Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism

Eun Jung Kim , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos
[Research Report] LIRMM. 2015
Reports lirmm-01225570v1
Image document

Complexity Dichotomies for the Minimum F-Overlay Problem

Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant
[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Reports hal-01490535v1
Image document

MPLS label stacking on the line network

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Hervé Rivano
[Research Report] RR-6803, INRIA. 2009
Reports inria-00354267v1
Image document

Dynamic Programming for Graphs on Surfaces

Juanjo Rué , Ignasi Sau , Dimitrios M. Thilikos
[Research Report] RR-7166, INRIA. 2009, pp.39
Reports inria-00443582v1
Image document

GMPLS Routing Strategies based on the Design of Hypergraph Layouts

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Ignasi Sau
[Research Report] RR-6842, INRIA. 2009
Reports inria-00360576v1
Image document

Drop cost and wavelength optimal two-period grooming with ratio 4

Jean-Claude Bermond , Charles J. Colbourn , Lucia Gionfriddo , Gaetano Quattrocchi , Ignasi Sau
[Research Report] RR-7101, INRIA. 2009, pp.24
Reports inria-00432801v1
Image document

Circuit visiting 10 ordered vertices in infinite grids

David Coudert , Frédéric Giroire , Ignasi Sau
[Research Report] RR-6910, INRIA. 2009
Reports inria-00378586v1
Image document

Parameterized Complexity of the Smallest Degree Constraint Subgraph Problem

Omid Amini , Ignasi Sau , Saket Saurabh
[Research Report] RR-6237, INRIA. 2007, pp.20
Reports inria-00157970v4
Image document

Hardness and Approximation of Traffic Grooming

Omid Amini , Stéphane Pérennes , Ignasi Sau
[Research Report] RR-6236, INRIA. 2007, pp.17
Reports inria-00158341v3
Image document

Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks

Ignasi Sau
Mathematics [math]. Université Nice Sophia Antipolis; Universitat Politécnica de Catalunya, 2009. English. ⟨NNT : ⟩
Theses tel-00429092v1
Image document

Some Contributions to Parameterized Complexity

Ignasi Sau
Computer Science [cs]. Université de Montpellier, 2018
Habilitation à diriger des recherches tel-02079241v1