×
Author ID: sau.ignasi Recent zbMATH articles by "Sau, Ignasi"
Published as: Sau, Ignasi
External Links: ORCID
all top 5

Co-Authors

0 single-authored
40 Thilikos, Dimitrios M.
22 Baste, Julien
21 Paul, Christophe
11 Campos, Victor A.
10 Araújo, Júlio César Silva
9 Shalom, Mordechai
8 Kim, Eunjung
7 Bougeret, Marin
7 Mertzios, George B.
7 Silva, Ana Shirley
7 Souza, Uéverton S.
7 Zaks, Shmuel
6 Amini, Omid
6 Faria, Luerbio
6 Klein, Sulamita
6 Lopes, Raul H. C.
6 Maia, Ana Karolinna
6 Pérennes, Stéphane
6 Saurabh, Saket
5 Fomin, Fedor V.
5 Garnero, Valentin
5 Raymond, Jean-Florent
5 Stamoulis, Giannos
4 Adler, Isolde
4 Bermond, Jean-Claude
4 Cohen, Nathann
4 Coudert, David
4 Dorn, Frederic
4 dos Santos, Vinícius Fernandes
4 Gonçalves, Daniel
4 Gözüpek, Didem
4 Muñoz, Xavier
4 Peleg, David
4 Rautenbach, Dieter
4 Rué, Juanjo
4 Thomassé, Stéphan
3 Chatzidimitriou, Dimitris
3 dos Santos Souza, Uéverton
3 Gomes, Guilherme C. M.
3 Joret, Gwenaël
3 Lima, Carlos Vinicius Gomes Costa
3 Lima, Paloma T.
3 Sucupira, Rubens
3 Žerovnik, Janez
2 Alves, Sancrey Rodrigues
2 Belmonte, Rémy
2 Bousquet, Nicolas
2 Dabrowski, Konrad Kazimierz
2 Havet, Frédéric
2 Jansen, Bart M. P.
2 Langer, Alexander
2 Li, Zhentao
2 Mazauric, Dorian
2 Montejano, Luis Pedro
2 Moulierac, Joanna
2 Noy, Marc
2 Oum, Sang-Il
2 Ozkan, Sibel
2 Reidl, Felix
2 Rossmanith, Peter
2 Scornavacca, Celine
2 Sikdar, Somnath
2 Solano Donado, Fernando
2 Watrigant, Rémi
2 Weller, Mathias
1 Aboulker, Pierre
1 Beggas, Fairouz
1 Benevides, Fabricio Siqueira
1 Bessy, Stéphane
1 Campêlo, Manoel B.
1 Cinkler, Tibor
1 Colbourn, Charles J.
1 Costa, Jonas
1 Cray, Henri
1 Cunha, Luís Felipe Ignácio
1 de Oliveira Bastos, Josefran
1 du Cray, Henri Perret
1 Fernandes, Dos Santos Viníícius
1 Fiorini, Samuel
1 Flammini, Michele
1 Gionfriddo, Lucia
1 Giroire, Frédéric
1 Golovach, Petr A.
1 Hörsch, Florian
1 Huynh, Tony
1 Ibiapina, Allen
1 Keiler, Lucas
1 Kheddouci, Hamamache
1 Linhares-Sales, Claudia
1 Monaco, Gianpiero
1 Morelle, Laure
1 Moscardelli, Luca
1 Mota, Guilherme Oliveira
1 Nisse, Nicolas
1 Picasarri-Arrieta, Lucas
1 Quattrocchi, Gaetano
1 Sampaio, Rudini Menezes
1 Šparl, Petra
1 Tale, Prafullkumar
1 Viana, Luiz

Publications by Year

Citations contained in zbMATH Open

102 Publications have been cited 468 times in 316 Documents Cited by Year
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
33
2016
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
24
2013
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Zbl 1430.68126
Bougeret, Marin; Sau, Ignasi
12
2019
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Zbl 1192.90239
Sau, Ignasi; Thilikos, Dimitrios M.
12
2010
Faster parameterized algorithms for minor containment. Zbl 1228.68035
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
12
2011
Degree-constrained subgraph problems: Hardness and approximation results. Zbl 1209.68629
Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket
12
2009
Explicit linear kernels via dynamic programming. Zbl 1323.05119
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
11
2015
An edge variant of the Erdős-Pósa property. Zbl 1336.05108
Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
10
2016
Parameterized complexity of the smallest degree-constrained subgraph problem. Zbl 1142.68450
Amini, Omid; Sau, Ignasi; Saurabh, Saket
10
2008
An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68221
Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
10
2018
Dynamic programming for graphs on surfaces. Zbl 1321.05276
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
9
2014
Dynamic programming for graphs on surfaces. Zbl 1288.05286
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
9
2010
The recognition of tolerance and bounded tolerance graphs. Zbl 1235.05098
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
9
2011
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. Zbl 1520.68108
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
9
2020
Hardness and approximation of traffic grooming. Zbl 1171.68049
Amini, Omid; Pérennes, Stéphane; Sau, Ignasi
8
2009
On the approximability of some degree-constrained subgraph problems. Zbl 1246.05040
Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket
8
2012
Parameterized complexity of finding small degree-constrained subgraphs. Zbl 1242.68119
Amini, Omid; Sau, Ignasi; Saurabh, Saket
8
2012
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. Zbl 1400.68078
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.
8
2018
Counting Gallai 3-colorings of complete graphs. Zbl 1416.05098
Bastos, Josefran de Oliveira; Benevides, Fabrício Siqueira; Mota, Guilherme Oliveira; Sau, Ignasi
7
2019
Hitting and harvesting pumpkins. Zbl 1305.05221
Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan
7
2014
Faster parameterized algorithms for minor containment. Zbl 1285.68206
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
7
2010
Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth. Zbl 1443.68120
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
7
2018
Hitting minors on bounded treewidth graphs. III. Lower bounds. Zbl 1435.68121
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
6
2020
Weighted proper orientations of trees and graphs of bounded treewidth. Zbl 1421.68104
Araújo, Júlio; Sales, Cláudia Linhares; Sau, Ignasi; Silva, Ana
6
2019
An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\). Zbl 1386.05149
Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
6
2018
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability. Zbl 1372.68126
Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai
6
2017
An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68222
Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
6
2015
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. Zbl 1516.68063
Gomes, Guilherme C. M.; Sau, Ignasi
6
2019
Dynamic programming for \(H\)-minor-free graphs. Zbl 1364.68231
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
6
2012
A linear kernel for planar red-blue dominating set. Zbl 1358.05217
Garnero, Valentin; Sau, Ignasi; Thilikos, Dimitrios M.
6
2017
Hitting minors on bounded treewidth graphs. I: General upper bounds. Zbl 1450.05084
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
6
2020
\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions. Zbl 1512.05370
Sau, Ignasi; Stamoulis, Giannos; Thilikos, Dimitrios M.
6
2023
On the complexity of computing the \(k\)-restricted edge-connectivity of a graph. Zbl 1356.68107
Montejano, Luis Pedro; Sau, Ignasi
5
2017
The role of planarity in connectivity problems parameterized by treewidth. Zbl 1306.05123
Baste, Julien; Sau, Ignasi
5
2015
Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014
Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
5
2010
A new intersection model and improved algorithms for tolerance graphs. Zbl 1207.05132
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
5
2009
A complexity dichotomy for hitting small planar minors parameterized by treewidth. Zbl 1520.68109
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
5
2019
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Zbl 1435.68122
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
5
2020
Uniquely restricted matchings and edge colorings. Zbl 1483.05171
Baste, Julien; Rautenbach, Dieter; Sau, Ignasi
5
2017
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. Zbl 1516.68062
Gomes, Guilherme C. M.; Sau, Ignasi
5
2021
Ruling out FPT algorithms for weighted coloring on forests. Zbl 1391.68045
Araújo, Júlio; Baste, Julien; Sau, Ignasi
4
2018
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1372.92069
Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine
4
2017
Minors in graphs of large \(\theta_r\)-girth. Zbl 1369.05187
Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
4
2017
Fast minor testing in planar graphs. Zbl 1287.05141
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
4
2010
Hitting forbidden induced subgraphs on bounded treewidth graphs. Zbl 1518.68275
Sau, Ignasi; dos Santos Souza, Uéverton
4
2021
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Zbl 1443.68071
Bougeret, Marin; Sau, Ignasi
4
2018
Improved FPT algorithms for weighted independent set in bull-free graphs. Zbl 1376.05155
du Cray, Henri Perret; Sau, Ignasi
4
2018
On the number of labeled graphs of bounded treewidth. Zbl 1387.05114
Baste, Julien; Noy, Marc; Sau, Ignasi
3
2018
A polynomial-time algorithm for outerplanar diameter improvement. Zbl 1372.05216
Cohen, Nathann; Gonçalves, Daniel; Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias
3
2017
On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. Zbl 1483.68247
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton
3
2016
An \(O(\log \mathrm{OPT})\)-approximation for covering/packing minor models of \(\theta _{r}\). Zbl 1473.05237
Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
3
2015
Parameterized domination in circle graphs. Zbl 1286.68222
Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan
3
2014
Explicit linear kernels for packing problems. Zbl 1422.68111
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
3
2019
On the parameterized complexity of the edge monitoring problem. Zbl 1404.68080
Baste, Julien; Beggas, Fairouz; Kheddouci, Hamamache; Sau, Ignasi
3
2017
Simpler multicoloring of triangle-free hexagonal graphs. Zbl 1233.05107
Sau, Ignasi; Šparl, Petra; Žerovnik, Janez
3
2012
Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs. Zbl 1237.05168
Muñoz, Xavier; Li, Zhentao; Sau, Ignasi
3
2011
Hardness and approximation of traffic grooming. Zbl 1193.68285
Amini, Omid; Pérennes, Stéphane; Sau, Ignasi
3
2007
Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel. Zbl 1503.05095
Bougeret, Marin; Jansen, Bart M. P.; Sau, Ignasi
3
2022
Adapting the directed grid theorem into an FPT algorithm. Zbl 07515183
Campos, Victor; Lopes, Raul; Maia, Ana Karolinna; Sau, Ignasi
3
2019
Asymptotic enumeration of non-crossing partitions on surfaces. Zbl 1259.05013
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
3
2013
\(k\)-apices of minor-closed graph classes. II. Parameterized algorithms. Zbl 07758415
Sau, Ignasi; Stamoulis, Giannos; Thilikos, Dimitrios M.
3
2022
Upper bounds on the uniquely restricted chromatic index. Zbl 1417.05058
Baste, Julien; Rautenbach, Dieter; Sau, Ignasi
2
2019
Improved kernels for Signed Max Cut parameterized above lower bound on \((r,\ell)\)-graphs. Zbl 1400.05105
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Sucupira, Rubens
2
2017
Parameterized complexity dichotomy for \((r, \ell)\)-Vertex Deletion. Zbl 1378.68057
Baste, Julien; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi
2
2017
Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Zbl 1370.68131
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
2
2017
Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs. Zbl 1267.05271
Sau, Ignasi; Thilikos, Dimitrios M.
2
2009
Drop cost and wavelength optimal two-period grooming with ratio 4. Zbl 1214.68260
Bermond, Jean-Claude; Colbourn, Charles J.; Gionfriddo, Lucia; Quattrocchi, Gaetano; Sau, Ignasi
2
2010
On approximating the \(d\)-girth of a graph. Zbl 1285.05041
Peleg, David; Sau, Ignasi; Shalom, Mordechai
2
2013
Fast minor testing in planar graphs. Zbl 1254.05185
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
2
2012
Traffic grooming in unidirectional WDM rings with bounded degree request graph. Zbl 1202.68040
Muñoz, Xavier; Sau, Ignasi
2
2008
Coloring problems on bipartite graphs of small diameter. Zbl 1464.05143
Campos, Victor A.; Gomes, Guilherme C. M.; Ibiapina, Allen; Lopes, Raul; Sau, Ignasi; Silva, Ana
2
2021
Dual parameterization of weighted coloring. Zbl 1520.68106
Araújo, Júlio; Campos, Victor A.; Lima, Carlos Vinícius G. C.; Fernandes, Dos Santos Viníícius; Sau, Ignasi; Silva, Ana
2
2019
Hitting forbidden induced subgraphs on bounded treewidth graphs. Zbl 1518.68276
Sau, Ignasi; Souza, Uéverton Dos Santos
2
2020
Reducing graph transversals via edge contractions. Zbl 1477.68239
Lima, Paloma T.; dos Santos, Vinicius F.; Sau, Ignasi; Souza, Uéverton S.
2
2021
On the number of labeled graphs of bounded treewidth. Zbl 1486.05292
Baste, Julien; Noy, Marc; Sau, Ignasi
2
2017
On the complexity of finding large odd induced subgraphs and odd colorings. Zbl 1515.68224
Belmonte, Rémy; Sau, Ignasi
2
2021
On the complexity of finding internally vertex-disjoint long directed paths. Zbl 1485.68171
Araújo, Júlio; Campos, Victor A.; Maia, Ana Karolinna; Sau, Ignasi; Silva, Ana
1
2018
A linear kernel for planar total dominating set. Zbl 1401.05218
Garnero, Valentin; Sau, Ignasi
1
2018
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1480.92142
Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine
1
2016
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068
Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai
1
2016
Approximating maximum uniquely restricted matchings in bipartite graphs. Zbl 1419.05173
Baste, Julien; Rautenbach, Dieter; Sau, Ignasi
1
2019
Maximum cuts in edge-colored graphs. Zbl 1383.05122
Sucupira, Rubens; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.
1
2017
Ruling out FPT algorithms for weighted coloring on forests. Zbl 1383.05090
Araújo, Júlio; Baste, Julien; Sau, Ignasi
1
2017
Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. Zbl 1378.68084
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
1
2015
A polynomial-time algorithm for outerplanar diameter improvement. Zbl 1464.68280
Cohen, Nathann; Gonçalves, Daniel; Kim, Eunjung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias
1
2015
On approximating the \(d\)-girth of a graph. Zbl 1298.68297
Peleg, David; Sau, Ignasi; Shalom, Mordechai
1
2011
Traffic grooming in bidirectional WDM ring networks. Zbl 1231.90124
Bermond, Jean-Claude; Muñoz, Xavier; Sau, Ignasi
1
2011
GMPLS label space minimization through hypergraph layouts. Zbl 1243.68024
Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando
1
2012
Hitting and harvesting pumpkins. Zbl 1346.68111
Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan
1
2011
The recognition of tolerance and bounded tolerance graphs. Zbl 1230.68095
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
1
2010
Explicit linear kernels via dynamic programming. Zbl 1359.68132
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
1
2014
Designing hypergraph layouts to GMPLS routing strategies. Zbl 1274.68004
Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando
1
2010
Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027
Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
1
2010
Parameterized domination in circle graphs. Zbl 1341.05184
Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan
1
2012
On self-duality of branchwidth in graphs of bounded genus. Zbl 1237.05135
Sau, Ignasi; Thilikos, Dimitrios M.
1
2011
A unifying model for locally constrained spanning tree problems. Zbl 1470.05035
Viana, Luiz; Campêlo, Manoel; Sau, Ignasi; Silva, Ana
1
2021
Maximum cuts in edge-colored graphs. Zbl 1440.05085
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.; Sucupira, Rubens
1
2020
Reducing graph transversals via edge contractions. Zbl 07559435
Lima, Paloma T.; Dos Santos, Vinicius F.; Sau, Ignasi; Souza, Uéverton S.
1
2020
A relaxation of the directed disjoint paths problem: a global congestion metric helps. Zbl 07559439
Lopes, Raul; Sau, Ignasi
1
2020
Adapting the directed grid theorem into an FPT algorithm. Zbl 1496.05059
Campos, Victor; Lopes, Raul; Maia, Ana Karolinna; Sau, Ignasi
1
2022
\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions. Zbl 1512.05370
Sau, Ignasi; Stamoulis, Giannos; Thilikos, Dimitrios M.
6
2023
Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel. Zbl 1503.05095
Bougeret, Marin; Jansen, Bart M. P.; Sau, Ignasi
3
2022
\(k\)-apices of minor-closed graph classes. II. Parameterized algorithms. Zbl 07758415
Sau, Ignasi; Stamoulis, Giannos; Thilikos, Dimitrios M.
3
2022
Adapting the directed grid theorem into an FPT algorithm. Zbl 1496.05059
Campos, Victor; Lopes, Raul; Maia, Ana Karolinna; Sau, Ignasi
1
2022
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. Zbl 1516.68062
Gomes, Guilherme C. M.; Sau, Ignasi
5
2021
Hitting forbidden induced subgraphs on bounded treewidth graphs. Zbl 1518.68275
Sau, Ignasi; dos Santos Souza, Uéverton
4
2021
Coloring problems on bipartite graphs of small diameter. Zbl 1464.05143
Campos, Victor A.; Gomes, Guilherme C. M.; Ibiapina, Allen; Lopes, Raul; Sau, Ignasi; Silva, Ana
2
2021
Reducing graph transversals via edge contractions. Zbl 1477.68239
Lima, Paloma T.; dos Santos, Vinicius F.; Sau, Ignasi; Souza, Uéverton S.
2
2021
On the complexity of finding large odd induced subgraphs and odd colorings. Zbl 1515.68224
Belmonte, Rémy; Sau, Ignasi
2
2021
A unifying model for locally constrained spanning tree problems. Zbl 1470.05035
Viana, Luiz; Campêlo, Manoel; Sau, Ignasi; Silva, Ana
1
2021
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. Zbl 1520.68108
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
9
2020
Hitting minors on bounded treewidth graphs. III. Lower bounds. Zbl 1435.68121
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
6
2020
Hitting minors on bounded treewidth graphs. I: General upper bounds. Zbl 1450.05084
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
6
2020
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Zbl 1435.68122
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
5
2020
Hitting forbidden induced subgraphs on bounded treewidth graphs. Zbl 1518.68276
Sau, Ignasi; Souza, Uéverton Dos Santos
2
2020
Maximum cuts in edge-colored graphs. Zbl 1440.05085
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.; Sucupira, Rubens
1
2020
Reducing graph transversals via edge contractions. Zbl 07559435
Lima, Paloma T.; Dos Santos, Vinicius F.; Sau, Ignasi; Souza, Uéverton S.
1
2020
A relaxation of the directed disjoint paths problem: a global congestion metric helps. Zbl 07559439
Lopes, Raul; Sau, Ignasi
1
2020
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Zbl 1430.68126
Bougeret, Marin; Sau, Ignasi
12
2019
Counting Gallai 3-colorings of complete graphs. Zbl 1416.05098
Bastos, Josefran de Oliveira; Benevides, Fabrício Siqueira; Mota, Guilherme Oliveira; Sau, Ignasi
7
2019
Weighted proper orientations of trees and graphs of bounded treewidth. Zbl 1421.68104
Araújo, Júlio; Sales, Cláudia Linhares; Sau, Ignasi; Silva, Ana
6
2019
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. Zbl 1516.68063
Gomes, Guilherme C. M.; Sau, Ignasi
6
2019
A complexity dichotomy for hitting small planar minors parameterized by treewidth. Zbl 1520.68109
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
5
2019
Explicit linear kernels for packing problems. Zbl 1422.68111
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
3
2019
Adapting the directed grid theorem into an FPT algorithm. Zbl 07515183
Campos, Victor; Lopes, Raul; Maia, Ana Karolinna; Sau, Ignasi
3
2019
Upper bounds on the uniquely restricted chromatic index. Zbl 1417.05058
Baste, Julien; Rautenbach, Dieter; Sau, Ignasi
2
2019
Dual parameterization of weighted coloring. Zbl 1520.68106
Araújo, Júlio; Campos, Victor A.; Lima, Carlos Vinícius G. C.; Fernandes, Dos Santos Viníícius; Sau, Ignasi; Silva, Ana
2
2019
Approximating maximum uniquely restricted matchings in bipartite graphs. Zbl 1419.05173
Baste, Julien; Rautenbach, Dieter; Sau, Ignasi
1
2019
An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68221
Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
10
2018
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph. Zbl 1400.68078
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.
8
2018
Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth. Zbl 1443.68120
Baste, Julien; Sau, Ignasi; Thilikos, Dimitrios M.
7
2018
An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\). Zbl 1386.05149
Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
6
2018
Ruling out FPT algorithms for weighted coloring on forests. Zbl 1391.68045
Araújo, Júlio; Baste, Julien; Sau, Ignasi
4
2018
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? Zbl 1443.68071
Bougeret, Marin; Sau, Ignasi
4
2018
Improved FPT algorithms for weighted independent set in bull-free graphs. Zbl 1376.05155
du Cray, Henri Perret; Sau, Ignasi
4
2018
On the number of labeled graphs of bounded treewidth. Zbl 1387.05114
Baste, Julien; Noy, Marc; Sau, Ignasi
3
2018
On the complexity of finding internally vertex-disjoint long directed paths. Zbl 1485.68171
Araújo, Júlio; Campos, Victor A.; Maia, Ana Karolinna; Sau, Ignasi; Silva, Ana
1
2018
A linear kernel for planar total dominating set. Zbl 1401.05218
Garnero, Valentin; Sau, Ignasi
1
2018
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Zbl 1443.68119
Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M.
1
2018
A tight Erdős-Pósa function for wheel minors. Zbl 1395.05130
Aboulker, Pierre; Fiorini, Samuel; Huynh, Tony; Joret, Gwenaël; Raymond, Jean-Florent; Sau, Ignasi
1
2018
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability. Zbl 1372.68126
Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai
6
2017
A linear kernel for planar red-blue dominating set. Zbl 1358.05217
Garnero, Valentin; Sau, Ignasi; Thilikos, Dimitrios M.
6
2017
On the complexity of computing the \(k\)-restricted edge-connectivity of a graph. Zbl 1356.68107
Montejano, Luis Pedro; Sau, Ignasi
5
2017
Uniquely restricted matchings and edge colorings. Zbl 1483.05171
Baste, Julien; Rautenbach, Dieter; Sau, Ignasi
5
2017
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1372.92069
Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine
4
2017
Minors in graphs of large \(\theta_r\)-girth. Zbl 1369.05187
Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
4
2017
A polynomial-time algorithm for outerplanar diameter improvement. Zbl 1372.05216
Cohen, Nathann; Gonçalves, Daniel; Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias
3
2017
On the parameterized complexity of the edge monitoring problem. Zbl 1404.68080
Baste, Julien; Beggas, Fairouz; Kheddouci, Hamamache; Sau, Ignasi
3
2017
Improved kernels for Signed Max Cut parameterized above lower bound on \((r,\ell)\)-graphs. Zbl 1400.05105
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Sucupira, Rubens
2
2017
Parameterized complexity dichotomy for \((r, \ell)\)-Vertex Deletion. Zbl 1378.68057
Baste, Julien; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi
2
2017
Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Zbl 1370.68131
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
2
2017
On the number of labeled graphs of bounded treewidth. Zbl 1486.05292
Baste, Julien; Noy, Marc; Sau, Ignasi
2
2017
Maximum cuts in edge-colored graphs. Zbl 1383.05122
Sucupira, Rubens; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.
1
2017
Ruling out FPT algorithms for weighted coloring on forests. Zbl 1383.05090
Araújo, Júlio; Baste, Julien; Sau, Ignasi
1
2017
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
33
2016
An edge variant of the Erdős-Pósa property. Zbl 1336.05108
Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
10
2016
On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs. Zbl 1483.68247
Alves, Sancrey Rodrigues; Dabrowski, Konrad K.; Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; dos Santos Souza, Uéverton
3
2016
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. Zbl 1480.92142
Baste, Julien; Paul, Christophe; Sau, Ignasi; Scornavacca, Celine
1
2016
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Zbl 1417.68068
Gözüpek, Didem; Özkan, Sibel; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai
1
2016
Explicit linear kernels via dynamic programming. Zbl 1323.05119
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
11
2015
An FPT 2-approximation for tree-cut decomposition. Zbl 1386.68222
Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
6
2015
The role of planarity in connectivity problems parameterized by treewidth. Zbl 1306.05123
Baste, Julien; Sau, Ignasi
5
2015
An \(O(\log \mathrm{OPT})\)-approximation for covering/packing minor models of \(\theta _{r}\). Zbl 1473.05237
Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M.
3
2015
Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. Zbl 1378.68084
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
1
2015
A polynomial-time algorithm for outerplanar diameter improvement. Zbl 1464.68280
Cohen, Nathann; Gonçalves, Daniel; Kim, Eunjung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias
1
2015
Dynamic programming for graphs on surfaces. Zbl 1321.05276
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
9
2014
Hitting and harvesting pumpkins. Zbl 1305.05221
Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan
7
2014
Parameterized domination in circle graphs. Zbl 1286.68222
Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan
3
2014
Explicit linear kernels via dynamic programming. Zbl 1359.68132
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.
1
2014
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
24
2013
Asymptotic enumeration of non-crossing partitions on surfaces. Zbl 1259.05013
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
3
2013
On approximating the \(d\)-girth of a graph. Zbl 1285.05041
Peleg, David; Sau, Ignasi; Shalom, Mordechai
2
2013
On the approximability of some degree-constrained subgraph problems. Zbl 1246.05040
Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket
8
2012
Parameterized complexity of finding small degree-constrained subgraphs. Zbl 1242.68119
Amini, Omid; Sau, Ignasi; Saurabh, Saket
8
2012
Dynamic programming for \(H\)-minor-free graphs. Zbl 1364.68231
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
6
2012
Simpler multicoloring of triangle-free hexagonal graphs. Zbl 1233.05107
Sau, Ignasi; Šparl, Petra; Žerovnik, Janez
3
2012
Fast minor testing in planar graphs. Zbl 1254.05185
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
2
2012
GMPLS label space minimization through hypergraph layouts. Zbl 1243.68024
Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando
1
2012
Parameterized domination in circle graphs. Zbl 1341.05184
Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan
1
2012
Faster parameterized algorithms for minor containment. Zbl 1228.68035
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
12
2011
The recognition of tolerance and bounded tolerance graphs. Zbl 1235.05098
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
9
2011
Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs. Zbl 1237.05168
Muñoz, Xavier; Li, Zhentao; Sau, Ignasi
3
2011
On approximating the \(d\)-girth of a graph. Zbl 1298.68297
Peleg, David; Sau, Ignasi; Shalom, Mordechai
1
2011
Traffic grooming in bidirectional WDM ring networks. Zbl 1231.90124
Bermond, Jean-Claude; Muñoz, Xavier; Sau, Ignasi
1
2011
Hitting and harvesting pumpkins. Zbl 1346.68111
Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan
1
2011
On self-duality of branchwidth in graphs of bounded genus. Zbl 1237.05135
Sau, Ignasi; Thilikos, Dimitrios M.
1
2011
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Zbl 1192.90239
Sau, Ignasi; Thilikos, Dimitrios M.
12
2010
Dynamic programming for graphs on surfaces. Zbl 1288.05286
Rué, Juanjo; Sau, Ignasi; Thilikos, Dimitrios M.
9
2010
Faster parameterized algorithms for minor containment. Zbl 1285.68206
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
7
2010
Placing regenerators in optical networks to satisfy multiple sets of requests. Zbl 1288.68014
Mertzios, George B.; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
5
2010
Fast minor testing in planar graphs. Zbl 1287.05141
Adler, Isolde; Dorn, Frederic; Fomin, Fedor V.; Sau, Ignasi; Thilikos, Dimitrios M.
4
2010
Drop cost and wavelength optimal two-period grooming with ratio 4. Zbl 1214.68260
Bermond, Jean-Claude; Colbourn, Charles J.; Gionfriddo, Lucia; Quattrocchi, Gaetano; Sau, Ignasi
2
2010
The recognition of tolerance and bounded tolerance graphs. Zbl 1230.68095
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
1
2010
Designing hypergraph layouts to GMPLS routing strategies. Zbl 1274.68004
Bermond, Jean-Claude; Coudert, David; Moulierac, Joanna; Pérennes, Stéphane; Sau, Ignasi; Solano Donado, Fernando
1
2010
Traffic grooming: combinatorial results and practical resolutions. Zbl 1187.68027
Cinkler, Tibor; Coudert, David; Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Muñoz, Xavier; Sau, Ignasi; Shalom, Mordechai; Zaks, Shmuel
1
2010
Degree-constrained subgraph problems: Hardness and approximation results. Zbl 1209.68629
Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket
12
2009
Hardness and approximation of traffic grooming. Zbl 1171.68049
Amini, Omid; Pérennes, Stéphane; Sau, Ignasi
8
2009
A new intersection model and improved algorithms for tolerance graphs. Zbl 1207.05132
Mertzios, George B.; Sau, Ignasi; Zaks, Shmuel
5
2009
Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs. Zbl 1267.05271
Sau, Ignasi; Thilikos, Dimitrios M.
2
2009
Parameterized complexity of the smallest degree-constrained subgraph problem. Zbl 1142.68450
Amini, Omid; Sau, Ignasi; Saurabh, Saket
10
2008
...and 2 more Documents
all top 5

Cited by 484 Authors

53 Sau, Ignasi
53 Thilikos, Dimitrios M.
20 Saurabh, Saket
15 Golovach, Petr A.
15 Jansen, Bart M. P.
15 Kwon, O. joung
14 Baste, Julien
11 Raymond, Jean-Florent
10 Giannopoulou, Archontia C.
10 Kim, Eunjung
10 Lokshtanov, Daniel
10 Paul, Christophe
10 Shalom, Mordechai
9 Fomin, Fedor V.
9 Ganian, Robert
9 Mertzios, George B.
9 Souza, Uéverton S.
7 Agrawal, Akanksha
7 Bonnet, Edouard
7 Gözüpek, Didem
6 Araújo, Júlio César Silva
6 Lê Văn Băng
6 Paulusma, Daniël
6 Silva, Ana Shirley
6 Stamoulis, Giannos
6 Zehavi, Meirav
5 Amini, Omid
5 Faria, Luerbio
5 Ordyniak, Sebastian
5 Pérennes, Stéphane
5 Ramanujan, M. S.
5 Thomassé, Stéphan
5 Zaks, Shmuel
4 Bougeret, Marin
4 Brettell, Nick
4 Campos, Victor A.
4 Chakraborty, Dibyayan
4 Eiben, Eduard
4 Kamiński, Marcin Marek
4 Komusiewicz, Christian
4 Kratsch, Stefan
4 Marx, Dániel
4 Panolan, Fahad
4 Peleg, David
4 Pieterse, Astrid
4 Pilipczuk, Michał
4 Reidl, Felix
4 Rossmanith, Peter
4 Sorge, Manuel
3 Adler, Isolde
3 Aravind, N. R.
3 Bousquet, Nicolas
3 Chandran, L. Sunil
3 Chaudhary, Juhi
3 Dabrowski, Konrad Kazimierz
3 Dehghan, Ali A.
3 Dorn, Frederic
3 dos Santos, Vinícius Fernandes
3 Heinlein, Matthias
3 Joret, Gwenaël
3 Kelk, Steven
3 Kim, Eun Jung
3 Klein, Sulamita
3 Klute, Fabian
3 Knop, Dušan
3 Lima, Carlos Vinicius Gomes Costa
3 Lopes, Raul H. C.
3 Milanič, Martin
3 Muñoz, Xavier
3 Padinhatteeri, Sajith
3 Philip, Geevarghese
3 Pilipczuk, Marcin L.
3 Pillai, Raji R.
3 Rai, Ashutosh
3 Sánchez Villaamil, Fernando
3 Sikdar, Somnath
3 Szeider, Stefan
3 Tale, Prafullkumar
3 Telle, Jan Arne
3 Watrigant, Rémi
3 Wiederrecht, Sebastian
3 Zhang, Mingzu
2 Ahn, Jungho
2 Alves, Sancrey Rodrigues
2 Bagan, Guillaume
2 Bermond, Jean-Claude
2 Bishnu, Arijit
2 Broersma, Hajo J.
2 Bruhn, Henning
2 Bulteau, Laurent
2 Chandrasekaran, Karthekeyan
2 Charbit, Pierre
2 Chatzidimitriou, Dimitris
2 Damaschke, Peter
2 de Kroon, Arnoud A. W. M.
2 Dekker, David J. C.
2 Donkers, Huib
2 dos Santos Souza, Uéverton
2 Erveš, Rija
2 Fertin, Guillaume
...and 384 more Authors
all top 5

Cited in 45 Serials

36 Theoretical Computer Science
34 Algorithmica
33 Discrete Applied Mathematics
21 SIAM Journal on Discrete Mathematics
15 Journal of Computer and System Sciences
9 Discrete Mathematics
7 Journal of Combinatorial Theory. Series B
6 Networks
6 Theory of Computing Systems
4 European Journal of Combinatorics
4 Graphs and Combinatorics
4 Journal of Combinatorial Optimization
4 Quantum Information Processing
3 Applied Mathematics and Computation
3 SIAM Journal on Computing
3 Advances in Applied Mathematics
3 Information and Computation
3 ACM Transactions on Algorithms
3 Computer Science Review
2 Information Processing Letters
2 Information Sciences
2 Journal of Graph Theory
2 Annals of Operations Research
2 Journal of Graph Algorithms and Applications
2 Journal of Discrete Algorithms
2 Discrete Optimization
1 Computers & Mathematics with Applications
1 Combinatorica
1 Discrete & Computational Geometry
1 Asia-Pacific Journal of Operational Research
1 Computational Geometry
1 Distributed Computing
1 The Australasian Journal of Combinatorics
1 Computational and Applied Mathematics
1 International Transactions in Operational Research
1 INFORMS Journal on Computing
1 Journal of Integer Sequences
1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Parallel Processing Letters
1 Journal of Physics A: Mathematical and Theoretical
1 Logical Methods in Computer Science
1 Applicable Analysis and Discrete Mathematics
1 Journal of Mathematical Modelling and Algorithms in Operations Research
1 Bulletin of the Hellenic Mathematical Society

Citations by Year