Ignasi Sau

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 127

Top Venues

Publications

Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR (2024)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346 (2024)
Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
Redicolouring digraphs: Directed treewidth and cycle-degeneracy. Discret. Appl. Math. 356 (2024)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR (2024)
Luís Cunha, Ignasi Sau, Uéverton S. Souza
On the Complexity of the Median and Closest Permutation Problems. WABI (2024)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP (2024)
Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
Dynamic programming on bipartite tree decompositions. CoRR (2023)
Luís Cunha, Ignasi Sau, Uéverton S. Souza
On the Complexity of the Median and Closest Permutation Problems. CoRR (2023)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52 (4) (2023)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Algorithmica 85 (2) (2023)
Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
Redicolouring digraphs: directed treewidth and cycle-degeneracy. CoRR (2023)
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the vertex cover number via edge contractions. J. Comput. Syst. Sci. 136 (2023)
Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ESA (2023)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
-apices of minor-closed graph classes. I. Bounding the obstructions. J. Comb. Theory, Ser. B 161 (2023)
Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
Dynamic Programming on Bipartite Tree Decompositions. IPEC (2023)
Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau
New Menger-like dualities in digraphs and applications to half-integral linkages. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Compound Logics for Modification Problems. ICALP (2023)
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
Target set selection with maximum activation time. Discret. Appl. Math. 338 (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. CoRR (2022)
Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Faster parameterized algorithms for modification problems to minor-closed classes. CoRR (2022)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. SIAM J. Discret. Math. 36 (4) (2022)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. MFCS (2022)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. ACM Trans. Algorithms 18 (3) (2022)
Raul Lopes, Ignasi Sau
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps. Theor. Comput. Sci. 898 (2022)
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting the Directed Grid Theorem into an FPT Algorithm. SIAM J. Discret. Math. 36 (3) (2022)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Algorithmica 84 (11) (2022)
Guilherme de C. M. Gomes, Ignasi Sau
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. Algorithmica 83 (6) (2021)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. IPEC (2021)
Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva
A unifying model for locally constrained spanning tree problems. J. Comb. Optim. 42 (1) (2021)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR (2021)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Introducing lop-kernels: a framework for kernelization lower bounds. CoRR (2021)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR (2021)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing graph transversals via edge contractions. J. Comput. Syst. Sci. 120 (2021)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
A more accurate view of the Flat Wall Theorem. CoRR (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
A Compound Logic for Modification Problems: Big Kingdoms Fall from Within. CoRR (2021)
Rémy Belmonte, Ignasi Sau
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Algorithmica 83 (8) (2021)
Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva
Coloring Problems on Bipartite Graphs of Small Diameter. Electron. J. Comb. 28 (2) (2021)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR (2021)
Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Parameterized complexity of computing maximum minimal blocking and hitting sets. CoRR (2021)
Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
Target set selection with maximum activation time. LAGOS (2021)
Ignasi Sau, Uéverton dos Santos Souza
Hitting forbidden induced subgraphs on bounded treewidth graphs. Inf. Comput. 281 (2021)
Rémy Belmonte, Ignasi Sau
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. WG (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. 109 (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. 814 (2020)
Rémy Belmonte, Ignasi Sau
On the complexity of finding large odd induced subgraphs and odd colorings. CoRR (2020)
Ignasi Sau, Uéverton dos Santos Souza
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. MFCS (2020)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing graph transversals via edge contractions. CoRR (2020)
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)
Raul Lopes, Ignasi Sau
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. MFCS (2020)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP (2020)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. 34 (3) (2020)
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
Target set selection with maximum activation time. CoRR (2020)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP (2020)
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) (2020)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing Graph Transversals via Edge Contractions. MFCS (2020)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
Maximum cuts in edge-colored graphs. Discret. Appl. Math. 281 (2020)
Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva
Dual Parameterization of Weighted Coloring. Algorithmica 82 (8) (2020)
Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Algorithmica 82 (6) (2020)
Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva
Coloring Problems on Bipartite Graphs of Small Diameter. CoRR (2020)
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR (2020)
Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR (2020)
Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva
A Unifying Model for Locally Constrained Spanning Tree Problems. CoRR (2020)
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting the Directed Grid Theorem into an FPT Algorithm. CoRR (2020)
Ignasi Sau, Uéverton S. Souza
Hitting forbidden induced subgraphs on bounded treewidth graphs. CoRR (2020)
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting The Directed Grid Theorem into an FPT Algorithm. LAGOS (2019)
Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Explicit Linear Kernels for Packing Problems. Algorithmica 81 (4) (2019)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. 267 (2019)
Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva
Weighted proper orientations of trees and graphs of bounded treewidth. Theor. Comput. Sci. 771 (2019)
Guilherme de C. M. Gomes, Ignasi Sau
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. CoRR (2019)
Marin Bougeret, Ignasi Sau
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Algorithmica 81 (10) (2019)
Guilherme de C. M. Gomes, Ignasi Sau
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. IPEC (2019)
Julien Baste, Dieter Rautenbach, Ignasi Sau
Upper bounds on the uniquely restricted chromatic index. J. Graph Theory 91 (3) (2019)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR (2019)
Raul Lopes, Ignasi Sau
A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps. CoRR (2019)
Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau
Counting Gallai 3-colorings of complete graphs. Discret. Math. 342 (9) (2019)
Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva
Weighted proper orientations of trees and graphs of bounded treewidth. CoRR (2018)
Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. LATIN (2018)
Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32 (3) (2018)
Valentin Garnero, Ignasi Sau
A Linear Kernel for Planar Total Dominating Set. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
Maximum cuts in edge-colored graphs. CoRR (2018)
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms (2018)
Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
)-graph. Theor. Comput. Sci. 746 (2018)
Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
. Algorithmica 80 (4) (2018)
Júlio Araújo, Julien Baste, Ignasi Sau
Ruling out FPT algorithms for Weighted Coloring on forests. Theor. Comput. Sci. 729 (2018)
Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva
Dual parameterization of Weighted Coloring. CoRR (2018)
Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva
Dual Parameterization of Weighted Coloring. IPEC (2018)
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC (2018)
Julien Baste, Marc Noy, Ignasi Sau
On the number of labeled graphs of bounded treewidth. Eur. J. Comb. 71 (2018)
Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80 (1) (2018)
Henri Perret du Cray, Ignasi Sau
Improved FPT algorithms for weighted independent set in bull-free graphs. Discret. Math. 341 (2) (2018)
Julien Baste, Marc Noy, Ignasi Sau
On the Number of Labeled Graphs of Bounded Treewidth. WG (2017)
Luis Pedro Montejano, Ignasi Sau
On the complexity of computing the k-restricted edge-connectivity of a graph. Theor. Comput. Sci. 662 (2017)
Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau
On the parameterized complexity of the Edge Monitoring problem. Inf. Process. Lett. 121 (2017)
Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. 61 (3) (2017)
Júlio Araújo, Julien Baste, Ignasi Sau
Ruling out FPT algorithms for Weighted Coloring on forests. CoRR (2017)
Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira
Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
A tight Erdős-Pósa function for wheel minors. CoRR (2017)
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)

Ignasi Sau.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ignasi Sau