Hardness and Approximation of Traffic Grooming. - Omid Amini; Stéphane Pérennes; Ignasi Sau (ISAAC, 2007)

Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. - Omid Amini; Ignasi Sau; Saket Saurabh 001 (IWPEC, 2008)

Degree-Constrained Subgraph Problems: Hardness and Approximation Results. - Omid Amini; David Peleg; Stéphane Pérennes; Ignasi Sau; Saket Saurabh 001 (WAOA, 2008)

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. - Xavier Muñoz; Ignasi Sau (WG, 2008)

An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. - Janez Zerovnik; Ignasi Sau (Discret. Math. Theor. Comput. Sci., 2008)

On Self-Duality of Branchwidth in Graphs of Bounded Genus. - Ignasi Sau; Dimitrios M. Thilikos (CTW, 2009)

Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. - David Coudert; Frédéric Giroire; Ignasi Sau (IWOCA, 2009)

MPLS Label Stacking on the Line Network. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Hervé Rivano; Ignasi Sau; Fernando Solano Donado (Networking, 2009)

Designing Hypergraph Layouts to GMPLS Routing Strategies. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (SIROCCO, 2009)

Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. - Zhentao Li; Ignasi Sau (WG, 2009)

A New Intersection Model and Improved Algorithms for Tolerance Graphs. - George B. Mertzios; Ignasi Sau; Shmuel Zaks (WG, 2009)

Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. - Ignasi Sau; Dimitrios M. Thilikos (Electron. Notes Discret. Math., 2009)

(l, k)-ROUTING ON PLANE GRIDS. - Florian Huc; Ignasi Sau; Janez Zerovnik (J. Interconnect. Networks, 2009)

Traffic Grooming: Combinatorial Results and Practical Resolutions. - Tibor Cinkler; David Coudert; Michele Flammini; Gianpiero Monaco; Luca Moscardelli; Xavier Muñoz; Ignasi Sau; Mordechai Shalom; Shmuel Zaks (Graphs and Algorithms in Communication Networks, 2010)

Permutation Routing and (ℓ, k)-Routing on Plane Grids. - Ignasi Sau; Janez Zerovnik (Graphs and Algorithms in Communication Networks, 2010)

Fast Minor Testing in Planar Graphs. - Isolde Adler; Frederic Dorn; Fedor V. Fomin; Ignasi Sau; Dimitrios M. Thilikos (ESA (1), 2010)

Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. - George B. Mertzios; Ignasi Sau; Mordechai Shalom; Shmuel Zaks (ICALP (2), 2010)

Dynamic Programming for Graphs on Surfaces. - Juanjo Rué; Ignasi Sau; Dimitrios M. Thilikos (ICALP (1), 2010)

Traffic Grooming in Star Networks via Matching Techniques. - Ignasi Sau; Mordechai Shalom; Shmuel Zaks (SIROCCO, 2010)

The Recognition of Tolerance and Bounded Tolerance Graphs. - George B. Mertzios; Ignasi Sau; Shmuel Zaks (STACS, 2010)

Faster Parameterized Algorithms for Minor Containment. - Isolde Adler; Frederic Dorn; Fedor V. Fomin; Ignasi Sau; Dimitrios M. Thilikos (SWAT, 2010)

Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. - Ignasi Sau; Dimitrios M. Thilikos (J. Discrete Algorithms, 2010)

Circuits in Graphs through a prescribed Set of Ordered vertices. - David Coudert; Frédéric Giroire; Ignasi Sau (J. Interconnect. Networks, 2010)

Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. - Jean-Claude Bermond; Charles J. Colbourn; Lucia Gionfriddo; Gaetano Quattrocchi; Ignasi Sau (SIAM J. Discret. Math., 2010)

Hitting and Harvesting Pumpkins. - Gwenaël Joret; Christophe Paul; Ignasi Sau; Saket Saurabh 001; Stéphan Thomassé (ESA, 2011)

On Approximating the d-Girth of a Graph. - David Peleg; Ignasi Sau; Mordechai Shalom (SOFSEM, 2011)

Traffic grooming in bidirectional WDM ring networks. - Jean-Claude Bermond; Xavier Muñoz; Ignasi Sau (Networks, 2011)

Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. - Xavier Muñoz; Zhentao Li; Ignasi Sau (SIAM J. Discret. Math., 2011)

Dynamic Programming for H-minor-free Graphs. - Juanjo Rué; Ignasi Sau; Dimitrios M. Thilikos (COCOON, 2012)

Parameterized Domination in Circle Graphs. - Nicolas Bousquet 001; Daniel Gonçalves 001; George B. Mertzios; Christophe Paul; Ignasi Sau; Stéphan Thomassé (WG, 2012)

On the approximability of some degree-constrained subgraph problems. - Omid Amini; David Peleg; Stéphane Pérennes; Ignasi Sau; Saket Saurabh 001 (Discret. Appl. Math., 2012)

Simpler multicoloring of triangle-free hexagonal graphs. - Ignasi Sau; Petra Sparl; Janez Zerovnik (Discret. Math., 2012)

Parameterized complexity of finding small degree-constrained subgraphs. - Omid Amini; Ignasi Sau; Saket Saurabh 001 (J. Discrete Algorithms, 2012)

GMPLS label space minimization through hypergraph layouts. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (Theor. Comput. Sci., 2012)

A linear kernel for planar red-blue dominating set. - Valentin Garnero; Ignasi Sau; Dimitrios M. Thilikos (CTW, 2013)

Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. - Eun Jung Kim 002; Alexander Langer; Christophe Paul; Felix Reidl; Peter Rossmanith; Ignasi Sau; Somnath Sikdar (ICALP (1), 2013)

Asymptotic enumeration of non-crossing partitions on surfaces. - Juanjo Rué; Ignasi Sau; Dimitrios M. Thilikos (Discret. Math., 2013)

The Role of Planarity in Connectivity Problems Parameterized by Treewidth. - Julien Baste; Ignasi Sau (IPEC, 2014)

Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs. - Henri Perret du Cray; Ignasi Sau (IPEC, 2014)

Explicit Linear Kernels via Dynamic Programming. - Valentin Garnero; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (STACS, 2014)

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. - Nathann Cohen; Daniel Gonçalves 001; Eunjung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos; Mathias Weller (CSR, 2015)

Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. - Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2015)

An O( log mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. - Dimitris Chatzidimitriou; Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (WAOA, 2015)

An FPT 2-Approximation for Tree-cut Decomposition. - Eunjung Kim 002; Sang-il Oum; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (WAOA, 2015)

On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. - Luis Pedro Montejano 001; Ignasi Sau (WG, 2015)

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. - Julien Baste; Christophe Paul; Ignasi Sau; Céline Scornavacca (AAIM, 2016)

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. - Sancrey Rodrigues Alves; Konrad Kazimierz Dabrowski; Luérbio Faria; Sulamita Klein; Ignasi Sau; Uéverton dos Santos Souza (COCOA, 2016)

Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. - Didem Gözüpek; Sibel Özkan; Christophe Paul; Ignasi Sau; Mordechai Shalom (WG, 2016)

An edge variant of the Erdős-Pósa property. - Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (Discret. Math., 2016)

Complexity Dichotomies for the Minimum ℱ -Overlay Problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (IWOCA, 2017)

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. - Julien Baste; Didem Gözüpek; Christophe Paul; Ignasi Sau; Mordechai Shalom; Dimitrios M. Thilikos (IPEC, 2017)

Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2017)

How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. - Marin Bougeret; Ignasi Sau (IPEC, 2017)

On the Number of Labeled Graphs of Bounded Treewidth. - Julien Baste; Marc Noy; Ignasi Sau (WG, 2017)

Uniquely Restricted Matchings and Edge Colorings. - Julien Baste; Dieter Rautenbach; Ignasi Sau (WG, 2017)

Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. - Luérbio Faria; Sulamita Klein; Ignasi Sau; Rubens Sucupira (Discret. Math. Theor. Comput. Sci., 2017)

Minors in graphs of large ϴr-girth. - Dimitris Chatzidimitriou; Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (Eur. J. Comb., 2017)

Ruling out FPT algorithms for Weighted Coloring on forests. - Júlio Araújo 001; Julien Baste; Ignasi Sau (Electron. Notes Discret. Math., 2017)

Maximum Cuts in Edge-colored Graphs. - Rubens Sucupira; Luérbio Faria; Sulamita Klein; Ignasi Sau; Uéverton S. Souza (Electron. Notes Discret. Math., 2017)

On the parameterized complexity of the Edge Monitoring problem. - Julien Baste; Fairouz Beggas; Hamamache Kheddouci; Ignasi Sau (Inf. Process. Lett., 2017)

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. - Julien Baste; Luérbio Faria; Sulamita Klein; Ignasi Sau (Theory Comput. Syst., 2017)

Some Contributions to Parameterized Complexity. (Quelques Contributions en Complexité Paramétrée). - Ignasi Sau (2018)

Dual Parameterization of Weighted Coloring. - Júlio Araújo 001; Victor A. Campos; Carlos Vinícius G. C. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Ana Silva 001 (IPEC, 2018)

A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2018)

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. - Júlio Araújo 001; Victor A. Campos; Ana Karolinna Maia; Ignasi Sau; Ana Silva 001 (LATIN, 2018)

An O(log OPT)-Approximation for Covering and Packing Minor Models of θr. - Dimitris Chatzidimitriou; Jean-Florent Raymond; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2018)

A Linear Kernel for Planar Total Dominating Set. - Valentin Garnero; Ignasi Sau (Discret. Math. Theor. Comput. Sci., 2018)

Complexity dichotomies for the MinimumF-Overlay problem. - Nathann Cohen; Frédéric Havet; Dorian Mazauric; Ignasi Sau; Rémi Watrigant (J. Discrete Algorithms, 2018)

A Tight Erdös-Pósa Function for Wheel Minors. - Pierre Aboulker; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond; Ignasi Sau (SIAM J. Discret. Math., 2018)

On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. - Sancrey Rodrigues Alves; Konrad K. Dabrowski; Luérbio Faria; Sulamita Klein; Ignasi Sau; Uéverton S. Souza (Theor. Comput. Sci., 2018)

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. - Guilherme de C. M. Gomes; Ignasi Sau (IPEC, 2019)

Explicit Linear Kernels for Packing Problems. - Valentin Garnero; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2019)

Approximating maximum uniquely restricted matchings in bipartite graphs. - Julien Baste; Dieter Rautenbach; Ignasi Sau (Discret. Appl. Math., 2019)

Counting Gallai 3-colorings of complete graphs. - Josefran de Oliveira Bastos; Fabrício Siqueira Benevides; Guilherme Oliveira Mota; Ignasi Sau (Discret. Math., 2019)

Upper bounds on the uniquely restricted chromatic index. - Julien Baste; Dieter Rautenbach; Ignasi Sau (J. Graph Theory, 2019)

Weighted proper orientations of trees and graphs of bounded treewidth. - Júlio Araújo 001; Cláudia Linhares Sales; Ignasi Sau; Ana Silva 001 (Theor. Comput. Sci., 2019)

Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. - Marin Bougeret; Bart M. P. Jansen; Ignasi Sau (ICALP, 2020)

An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (ICALP, 2020)

A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. - Raul Lopes 001; Ignasi Sau (MFCS, 2020)

Reducing Graph Transversals via Edge Contractions. - Paloma T. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Uéverton S. Souza (MFCS, 2020)

Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. - Ignasi Sau; Uéverton dos Santos Souza (MFCS, 2020)

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)

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. - Rémy Belmonte; Ignasi Sau (WG, 2020)

k-apices of minor-closed graph classes. II. Parameterized algorithms. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (CoRR, 2020)

Hitting minors on bounded treewidth graphs. III. Lower bounds. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2020)

Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (SIAM J. Discret. Math., 2020)

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (Theor. Comput. Sci., 2020)

A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. - Júlio Araújo 001; Marin Bougeret; Victor A. Campos; Ignasi Sau (IPEC, 2021)

Target set selection with maximum activation time. - Lucas Keiler; Carlos V. G. C. Lima; Ana Karolinna Maia; Rudini Menezes Sampaio; Ignasi Sau (LAGOS, 2021)

Coloring Problems on Bipartite Graphs of Small Diameter. - Victor A. Campos; Guilherme de C. M. Gomes; Allen Ibiapina; Raul Lopes 001; Ignasi Sau; Ana Silva 001 (Electron. J. Comb., 2021)

k-apices of minor-closed graph classes. I. Bounding the obstructions. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (CoRR, 2021)

A unifying model for locally constrained spanning tree problems. - Luiz Alberto do Carmo Viana; Manoel B. Campêlo; Ignasi Sau; Ana Silva 001 (J. Comb. Optim., 2021)

Reducing the Vertex Cover Number via Edge Contractions. - Paloma T. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Uéverton S. Souza; Prafullkumar Tale (MFCS, 2022)

Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. - Júlio Araújo 001; Marin Bougeret; Victor A. Campos; Ignasi Sau (Algorithmica, 2022)

k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (ACM Trans. Algorithms, 2022)

Adapting the Directed Grid Theorem into an FPT Algorithm. - Victor A. Campos; Raul Lopes 001; Ana Karolinna Maia; Ignasi Sau (SIAM J. Discret. Math., 2022)

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. - Marin Bougeret; Bart M. P. Jansen; Ignasi Sau (SIAM J. Discret. Math., 2022)

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. - Victor A. Campos; Jonas Costa Ferreira da Silva; Raul Lopes 001; Ignasi Sau (ESA, 2023)

Compound Logics for Modification Problems. - Fedor V. Fomin; Petr A. Golovach; Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (ICALP, 2023)

Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. - Laure Morelle; Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (ICALP, 2023)

Dynamic Programming on Bipartite Tree Decompositions. - Lars Jaffke; Laure Morelle; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2023)

Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. - Júlio Araújo 001; Marin Bougeret; Victor A. Campos; Ignasi Sau (Algorithmica, 2023)

k-apices of minor-closed graph classes. I. Bounding the obstructions. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (J. Comb. Theory B, 2023)

Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. - Julien Baste; Ignasi Sau; Dimitrios M. Thilikos (SIAM J. Comput., 2023)

Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. - Marin Bougeret; Bart M. P. Jansen; Ignasi Sau (ICALP, 2024)

On the Complexity of the Median and Closest Permutation Problems. - Luís Cunha 001; Ignasi Sau; Uéverton S. Souza (WABI, 2024)

On the parameterized complexity of computing good edge-labelings. - Davi de Andrade; Júlio Araújo 001; Laure Morelle; Ignasi Sau; Ana Silva 001 (CoRR, 2024)

FPT algorithms for packing k-safe spanning rooted sub(di)graphs. - Stéphane Bessy; Florian Hörsch; Ana Karolinna Maia; Dieter Rautenbach; Ignasi Sau (Discret. Appl. Math., 2024)

Redicolouring digraphs: Directed treewidth and cycle-degeneracy. - Nicolas Nisse; Lucas Picasarri-Arrieta; Ignasi Sau (Discret. Appl. Math., 2024)

A more accurate view of the Flat Wall Theorem. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (J. Graph Theory, 2024)

On the parameterized complexity of the median and closest problems under some permutation metrics. - Luís Cunha 001; Ignasi Sau; Uéverton S. Souza (Algorithms Mol. Biol., 2024)

Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion. - Laure Morelle; Ignasi Sau; Dimitrios M. Thilikos (ESA, 2025)

Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable. - Luís Felipe I. Cunha; Ignasi Sau; Uéverton S. Souza; Mario Valencia-Pabon (ICALP, 2025)

Revisiting Directed Disjoint Paths on Tournaments (And Relatives). - Guilherme de C. M. Gomes; Raul Lopes 001; Ignasi Sau (ICALP, 2025)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. - Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (SODA, 2025)

A Parameterized Perspective on Uniquely Restricted Matchings. - Juhi Chaudhary; Ignasi Sau; Meirav Zehavi (CoRR, 2025)

Finding subdigraphs in digraphs of bounded directed treewidth. - Raul Lopes 001; Ignasi Sau (CoRR, 2025)

Enumeration kernels for Vertex Cover and Feedback Vertex Set. - Marin Bougeret; Guilherme C. M. Gomes; Vinícius Fernandes dos Santos; Ignasi Sau (CoRR, 2025)

Constant congestion linkages in polynomially strong digraphs in polynomial time. - Raul Lopes 001; Ignasi Sau (Discret. Math., 2026)

Vertex identification to a forest. - Laure Morelle; Ignasi Sau; Dimitrios M. Thilikos (Discret. Math., 2026)