Ignasi Sau - RankMe

233 papers A* 9A 6B 35C 11Misc 2Journal 161Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Constant congestion linkages in polynomially strong digraphs in polynomial time. Discret. Math. Raul Lopes, Ignasi Sau
2026	J	`jnl`	Dynamic programming on bipartite tree decompositions. J. Comput. Syst. Sci. Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2026	A	`conf`	Kernelization Dichotomies for Hitting Minors Under Structural Parameterizations. STACS Marin Bougeret, Eric Brandwein, Ignasi Sau
2026	J	`jnl`	On the parameterized complexity of computing good edge-labelings. J. Comput. Syst. Sci. Davi de Andrade, Júlio Araújo, Laure Morelle, Ignasi Sau, Ana Silva
2026	J	`jnl`	Vertex identification to a forest. Discret. Math. Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2025	C	`conf`	A Parameterized Perspective on Uniquely Restricted Matchings. LAGOS Juhi Chaudhary, Ignasi Sau, Meirav Zehavi
2025	J	`jnl`	A Parameterized Perspective on Uniquely Restricted Matchings. CoRR Juhi Chaudhary, Ignasi Sau, Meirav Zehavi
2025	J	`jnl`	Compound Logics for Modification Problems. ACM Trans. Comput. Log. Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2025	A*	`conf`	Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable. ICALP Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025	J	`jnl`	Computing Distances on Graph Associahedra is Fixed-parameter Tractable. CoRR Luís Felipe I. Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon
2025	J	`jnl`	Computing parameters that generalize interval graphs using restricted modular partitions. CoRR Flavia Bonomo-Braberman, Eric Brandwein, Ignasi Sau
2025	B	`conf`	Enumeration Kernels for Vertex Cover and Feedback Vertex Set. IPEC Marin Bougeret, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos, Ignasi Sau
2025	J	`jnl`	Enumeration kernels for Vertex Cover and Feedback Vertex Set. CoRR Marin Bougeret, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos, Ignasi Sau
2025	C	`conf`	Finding subdigraphs in digraphs of bounded directed treewidth. LAGOS Raul Lopes, Ignasi Sau
2025	J	`jnl`	Finding subdigraphs in digraphs of bounded directed treewidth. CoRR Raul Lopes, Ignasi Sau
2025	A	`conf`	Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion. ESA Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2025	J	`jnl`	Graph modification of bounded size to minor-closed classes as fast as vertex deletion. CoRR Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2025	J	`jnl`	Kernelization dichotomies for hitting minors under structural parameterizations. CoRR Marin Bougeret, Eric Brandwein, Ignasi Sau
2025	J	`jnl`	New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ACM Trans. Algorithms Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau
2025	A*	`conf`	Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. SODA Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2025	A*	`conf`	Revisiting Directed Disjoint Paths on Tournaments (And Relatives). ICALP Guilherme de C. M. Gomes, Raul Lopes, Ignasi Sau
2025	J	`jnl`	Revisiting Directed Disjoint Paths on tournaments (and relatives). CoRR Guilherme C. M. Gomes, Raul Lopes, Ignasi Sau
2024	J	`jnl`	A more accurate view of the Flat Wall Theorem. J. Graph Theory Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024	J	`jnl`	Constant congestion linkages in polynomially strong digraphs in polynomial time. CoRR Raul Lopes, Ignasi Sau
2024	J	`jnl`	FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2024	J	`jnl`	Faster parameterized algorithms for modification problems to minor-closed classes. TheoretiCS Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024	A*	`conf`	Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. ICALP Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2024	J	`jnl`	Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. CoRR Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2024	C	`conf`	On the Complexity of the Median and Closest Permutation Problems. WABI Luís Cunha, Ignasi Sau, Uéverton S. Souza
2024	J	`jnl`	On the parameterized complexity of computing good edge-labelings. CoRR Davi de Andrade, Júlio Araújo, Laure Morelle, Ignasi Sau, Ana Silva
2024	J	`jnl`	On the parameterized complexity of the median and closest problems under some permutation metrics. Algorithms Mol. Biol. Luís Cunha, Ignasi Sau, Uéverton S. Souza
2024	J	`jnl`	Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2024	J	`jnl`	Redicolouring digraphs: Directed treewidth and cycle-degeneracy. Discret. Appl. Math. Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
2024	J	`jnl`	Vertex identification to a forest. CoRR Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2023	A*	`conf`	Compound Logics for Modification Problems. ICALP Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2023	B	`conf`	Dynamic Programming on Bipartite Tree Decompositions. IPEC Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2023	J	`jnl`	Dynamic programming on bipartite tree decompositions. CoRR Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos
2023	A*	`conf`	Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2023	J	`jnl`	Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2023	A	`conf`	New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ESA Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau
2023	J	`jnl`	New Menger-like dualities in digraphs and applications to half-integral linkages. CoRR Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau
2023	J	`jnl`	On the Complexity of the Median and Closest Permutation Problems. CoRR Luís Cunha, Ignasi Sau, Uéverton S. Souza
2023	J	`jnl`	Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Algorithmica Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
2023	J	`jnl`	Redicolouring digraphs: directed treewidth and cycle-degeneracy. CoRR Nicolas Nisse, Lucas Picasarri-Arrieta, Ignasi Sau
2023	J	`jnl`	Reducing the vertex cover number via edge contractions. J. Comput. Syst. Sci. Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2023	J	`jnl`	Target set selection with maximum activation time. Discret. Appl. Math. Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
2022	J	`jnl`	A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps. Theor. Comput. Sci. Raul Lopes, Ignasi Sau
2022	J	`jnl`	Adapting the Directed Grid Theorem into an FPT Algorithm. SIAM J. Discret. Math. Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
2022	J	`jnl`	Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. SIAM J. Discret. Math. Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2022	J	`jnl`	Faster parameterized algorithms for modification problems to minor-closed classes. CoRR Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2022	J	`jnl`	Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Algorithmica Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
2022	B	`conf`	Reducing the Vertex Cover Number via Edge Contractions. MFCS Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2022	J	`jnl`	Reducing the Vertex Cover Number via Edge Contractions. CoRR Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
2021	B	`conf`	A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. IPEC Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
2021	J	`jnl`	A more accurate view of the Flat Wall Theorem. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	A unifying model for locally constrained spanning tree problems. J. Comb. Optim. Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva
2021	J	`jnl`	Coloring Problems on Bipartite Graphs of Small Diameter. Electron. J. Comb. Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva
2021	J	`jnl`	Compound Logics for Modification Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2021	J	`jnl`	Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. Algorithmica Guilherme de C. M. Gomes, Ignasi Sau
2021	J	`jnl`	Hitting forbidden induced subgraphs on bounded treewidth graphs. Inf. Comput. Ignasi Sau, Uéverton dos Santos Souza
2021	J	`jnl`	Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2021	J	`jnl`	Hitting minors on bounded treewidth graphs. III. Lower bounds. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2021	J	`jnl`	Introducing lop-kernels: a framework for kernelization lower bounds. CoRR Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
2021	J	`jnl`	On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. Algorithmica Rémy Belmonte, Ignasi Sau
2021	J	`jnl`	Parameterized complexity of computing maximum minimal blocking and hitting sets. CoRR Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
2021	J	`jnl`	Reducing graph transversals via edge contractions. J. Comput. Syst. Sci. Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
2021	C	`conf`	Target set selection with maximum activation time. LAGOS Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
2021	J	`jnl`	k-apices of minor-closed graph classes. I. Bounding the obstructions. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2020	B	`conf`	A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. MFCS Raul Lopes, Ignasi Sau
2020	J	`jnl`	A Unifying Model for Locally Constrained Spanning Tree Problems. CoRR Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva
2020	A*	`conf`	A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. SODA Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Adapting the Directed Grid Theorem into an FPT Algorithm. CoRR Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
2020	A*	`conf`	An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. ICALP Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2020	A*	`conf`	Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. ICALP Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2020	J	`jnl`	Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. CoRR Marin Bougeret, Bart M. P. Jansen, Ignasi Sau
2020	J	`jnl`	Coloring Problems on Bipartite Graphs of Small Diameter. CoRR Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva
2020	J	`jnl`	Dual Parameterization of Weighted Coloring. Algorithmica Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva
2020	B	`conf`	Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. MFCS Ignasi Sau, Uéverton dos Santos Souza
2020	J	`jnl`	Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. SIAM J. Discret. Math. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Hitting forbidden induced subgraphs on bounded treewidth graphs. CoRR Ignasi Sau, Uéverton S. Souza
2020	J	`jnl`	Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Theor. Comput. Sci. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2020	J	`jnl`	Maximum cuts in edge-colored graphs. Discret. Appl. Math. Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
2020	J	`jnl`	On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Algorithmica Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
2020	B	`conf`	On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. WG Rémy Belmonte, Ignasi Sau
2020	J	`jnl`	On the complexity of finding large odd induced subgraphs and odd colorings. CoRR Rémy Belmonte, Ignasi Sau
2020	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2020	B	`conf`	Reducing Graph Transversals via Edge Contractions. MFCS Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
2020	J	`jnl`	Reducing graph transversals via edge contractions. CoRR Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
2020	J	`jnl`	Target set selection with maximum activation time. CoRR Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
2020	J	`jnl`	k-apices of minor-closed graph classes. II. Parameterized algorithms. CoRR Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2019	J	`jnl`	A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps. CoRR Raul Lopes, Ignasi Sau
2019	C	`conf`	Adapting The Directed Grid Theorem into an FPT Algorithm. LAGOS Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
2019	J	`jnl`	Approximating maximum uniquely restricted matchings in bipartite graphs. Discret. Appl. Math. Julien Baste, Dieter Rautenbach, Ignasi Sau
2019	J	`jnl`	Counting Gallai 3-colorings of complete graphs. Discret. Math. Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau
2019	J	`jnl`	Explicit Linear Kernels for Packing Problems. Algorithmica Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2019	B	`conf`	Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. IPEC Guilherme de C. M. Gomes, Ignasi Sau
2019	J	`jnl`	Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. CoRR Guilherme de C. M. Gomes, Ignasi Sau
2019	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers WG Ignasi Sau, Dimitrios M. Thilikos
2019	J	`jnl`	Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2019	J	`jnl`	How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Algorithmica Marin Bougeret, Ignasi Sau
2019	J	`jnl`	Upper bounds on the uniquely restricted chromatic index. J. Graph Theory Julien Baste, Dieter Rautenbach, Ignasi Sau
2019	J	`jnl`	Weighted proper orientations of trees and graphs of bounded treewidth. Theor. Comput. Sci. Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva
2018	B	`conf`	A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. IPEC Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	A Linear Kernel for Planar Total Dominating Set. Discret. Math. Theor. Comput. Sci. Valentin Garnero, Ignasi Sau
2018	J	`jnl`	A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
2018	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	An O(log OPT)-Approximation for Covering and Packing Minor Models of θ Algorithmica Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2018	J	`jnl`	Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2018	B	`conf`	Dual Parameterization of Weighted Coloring. IPEC Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva
2018	J	`jnl`	Dual parameterization of Weighted Coloring. CoRR Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva
2018	J	`jnl`	Improved FPT algorithms for weighted independent set in bull-free graphs. Discret. Math. Henri Perret du Cray, Ignasi Sau
2018	J	`jnl`	Maximum cuts in edge-colored graphs. CoRR Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens Sucupira
2018	J	`jnl`	On the (parameterized) complexity of recognizing well-covered ( Theor. Comput. Sci. Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2018	B	`conf`	On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. LATIN Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
2018	J	`jnl`	On the number of labeled graphs of bounded treewidth. Eur. J. Comb. Julien Baste, Marc Noy, Ignasi Sau
2018	J	`jnl`	Ruling out FPT algorithms for Weighted Coloring on forests. Theor. Comput. Sci. Júlio Araújo, Julien Baste, Ignasi Sau
2018	—	`book`	Some Contributions to Parameterized Complexity. (Quelques Contributions en Complexité Paramétrée). Ignasi Sau
2018	J	`jnl`	Weighted proper orientations of trees and graphs of bounded treewidth. CoRR Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva
2017	J	`jnl`	A linear kernel for planar red-blue dominating set. Discret. Appl. Math. Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2017	J	`jnl`	A tight Erdős-Pósa function for wheel minors. CoRR Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau
2017	J	`jnl`	Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2017	C	`conf`	Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
2017	J	`jnl`	Hitting minors on bounded treewidth graphs. I. General upper bounds. CoRR Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2017	B	`conf`	How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. IPEC Marin Bougeret, Ignasi Sau
2017	J	`jnl`	Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. Discret. Math. Theor. Comput. Sci. Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira
2017	J	`jnl`	Maximum Cuts in Edge-colored Graphs. Electron. Notes Discret. Math. Rubens Sucupira, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2017	J	`jnl`	Minors in graphs of large ϴ Eur. J. Comb. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	On the (parameterized) complexity of recognizing well-covered (r, l)-graphs. CoRR Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2017	B	`conf`	On the Number of Labeled Graphs of Bounded Treewidth. WG Julien Baste, Marc Noy, Ignasi Sau
2017	J	`jnl`	On the complexity of computing the k-restricted edge-connectivity of a graph. Theor. Comput. Sci. Luis Pedro Montejano, Ignasi Sau
2017	J	`jnl`	On the complexity of finding internally vertex-disjoint long directed paths. CoRR Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
2017	J	`jnl`	On the parameterized complexity of the Edge Monitoring problem. Inf. Process. Lett. Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau
2017	B	`conf`	Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. IPEC Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory Comput. Syst. Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
2017	B	`conf`	Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. IPEC Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos
2017	J	`jnl`	Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2017	J	`jnl`	Ruling out FPT algorithms for Weighted Coloring on forests. CoRR Júlio Araújo, Julien Baste, Ignasi Sau
2017	J	`jnl`	Ruling out FPT algorithms for Weighted Coloring on forests. Electron. Notes Discret. Math. Júlio Araújo, Julien Baste, Ignasi Sau
2017	B	`conf`	Uniquely Restricted Matchings and Edge Colorings. WG Julien Baste, Dieter Rautenbach, Ignasi Sau
2016	J	`jnl`	An edge variant of the Erdős-Pósa property. Discret. Math. Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2016	C	`conf`	Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
2016	J	`jnl`	Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca
2016	J	`jnl`	Explicit linear kernels for packing problems. CoRR Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2016	J	`jnl`	How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? CoRR Marin Bougeret, Ignasi Sau
2016	J	`jnl`	Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2016	C	`conf`	On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. COCOA Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza
2016	B	`conf`	Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016	J	`jnl`	Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016	J	`jnl`	The number of labeled graphs of bounded treewidth. CoRR Julien Baste, Marc Noy, Ignasi Sau
2016	J	`jnl`	Uniquely restricted matchings and edge colorings. CoRR Julien Baste, Dieter Rautenbach, Ignasi Sau
2015	Misc	`conf`	A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2015	J	`jnl`	An FPT 2-Approximation for Tree-Cut Decomposition. CoRR Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	An FPT 2-Approximation for Tree-cut Decomposition. WAOA Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	An O(log OPT)-approximation for covering and packing minor models of $θ CoRR Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Explicit Linear Kernels via Dynamic Programming. SIAM J. Discret. Math. Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs. CoRR Luérbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira
2015	J	`jnl`	Minors in graphs of large $θ CoRR Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2015	B	`conf`	On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. WG Luis Pedro Montejano, Ignasi Sau
2015	J	`jnl`	On the complexity of computing the k-restricted edge-connectivity of a graph. CoRR Luis Pedro Montejano, Ignasi Sau
2015	B	`conf`	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2015	J	`jnl`	Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion. CoRR Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau
2015	J	`jnl`	The role of planarity in connectivity problems parameterized by treewidth. Theor. Comput. Sci. Julien Baste, Ignasi Sau
2014	J	`jnl`	A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2014	J	`jnl`	A linear kernel for planar red-blue dominating set. CoRR Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
2014	J	`jnl`	Dynamic programming for graphs on surfaces. ACM Trans. Algorithms Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2014	A	`conf`	Explicit Linear Kernels via Dynamic Programming. STACS Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2014	J	`jnl`	Hitting and Harvesting Pumpkins. SIAM J. Discret. Math. Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2014	B	`conf`	Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs. IPEC Henri Perret du Cray, Ignasi Sau
2014	J	`jnl`	Improved FPT algorithms for weighted independent set in bull-free graphs. CoRR Henri Perret du Cray, Ignasi Sau
2014	J	`jnl`	Parameterized Domination in Circle Graphs. Theory Comput. Syst. Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2014	B	`conf`	The Role of Planarity in Connectivity Problems Parameterized by Treewidth. IPEC Julien Baste, Ignasi Sau
2013	C	`conf`	A linear kernel for planar red-blue dominating set. CTW Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	An edge variant of the Erdős-Pósa property. CoRR Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	Asymptotic enumeration of non-crossing partitions on surfaces. Discret. Math. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2013	J	`jnl`	Explicit linear kernels via dynamic programming. CoRR Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2013	—	`conf`	Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2013	J	`jnl`	On approximating the Discret. Appl. Math. David Peleg, Ignasi Sau, Mordechai Shalom
2013	J	`jnl`	The role of planarity in connectivity problems parameterized by treewidth. CoRR Julien Baste, Ignasi Sau
2012	J	`jnl`	A linear kernel for planar total dominating set CoRR Valentin Garnero, Ignasi Sau
2012	Misc	`conf`	Dynamic Programming for H-minor-free Graphs. COCOON Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2012	J	`jnl`	Fast Minor Testing in Planar Graphs. Algorithmica Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2012	J	`jnl`	GMPLS label space minimization through hypergraph layouts. Theor. Comput. Sci. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado
2012	J	`jnl`	Linear kernels and single-exponential algorithms via protrusion decompositions CoRR Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2012	J	`jnl`	On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2012	J	`jnl`	Parameterized Domination in Circle Graphs CoRR Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	B	`conf`	Parameterized Domination in Circle Graphs. WG Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	J	`jnl`	Parameterized complexity of finding small degree-constrained subgraphs. J. Discrete Algorithms Omid Amini, Ignasi Sau, Saket Saurabh
2012	J	`jnl`	Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2012	J	`jnl`	Simpler multicoloring of triangle-free hexagonal graphs. Discret. Math. Ignasi Sau, Petra Sparl, Janez Zerovnik
2011	J	`jnl`	Asymptotic Enumeration of Non-crossing Partitions on Surfaces CoRR Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2011	J	`jnl`	Dynamic Programming for Graphs on Surfaces CoRR Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2011	J	`jnl`	Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. SIAM J. Discret. Math. Xavier Muñoz, Zhentao Li, Ignasi Sau
2011	J	`jnl`	Faster parameterized algorithms for minor containment. Theor. Comput. Sci. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2011	J	`jnl`	Hitting and Harvesting Pumpkins CoRR Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	A	`conf`	Hitting and Harvesting Pumpkins. ESA Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé
2011	B	`conf`	On Approximating the SOFSEM David Peleg, Ignasi Sau, Mordechai Shalom
2011	J	`jnl`	On self-duality of branchwidth in graphs of bounded genus. Discret. Appl. Math. Ignasi Sau, Dimitrios M. Thilikos
2011	J	`jnl`	The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. George B. Mertzios, Ignasi Sau, Shmuel Zaks
2011	J	`jnl`	Traffic grooming in bidirectional WDM ring networks. Networks Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau
2010	J	`jnl`	Circuits in Graphs through a prescribed Set of Ordered vertices. J. Interconnect. Networks David Coudert, Frédéric Giroire, Ignasi Sau
2010	J	`jnl`	Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discret. Math. Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau
2010	—	`conf`	Dynamic Programming for Graphs on Surfaces. ICALP (1) Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
2010	—	`conf`	Fast Minor Testing in Planar Graphs. ESA (1) Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	—	`conf`	Faster Parameterized Algorithms for Minor Containment. SWAT Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	—	`ch.`	Permutation Routing and ( Graphs and Algorithms in Communication Networks Ignasi Sau, Janez Zerovnik
2010	—	`conf`	Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2010	J	`jnl`	Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. J. Discrete Algorithms Ignasi Sau, Dimitrios M. Thilikos
2010	J	`jnl`	The Recognition of Tolerance and Bounded Tolerance Graphs CoRR George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010	A	`conf`	The Recognition of Tolerance and Bounded Tolerance Graphs. STACS George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010	B	`conf`	Traffic Grooming in Star Networks via Matching Techniques. SIROCCO Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2010	—	`ch.`	Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2009	J	`jnl`	( J. Interconnect. Networks Florian Huc, Ignasi Sau, Janez Zerovnik
2009	B	`conf`	A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG George B. Mertzios, Ignasi Sau, Shmuel Zaks
2009	J	`jnl`	A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discret. Math. George B. Mertzios, Ignasi Sau, Shmuel Zaks
2009	B	`conf`	Designing Hypergraph Layouts to GMPLS Routing Strategies. SIROCCO Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado
2009	C	`conf`	Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. IWOCA David Coudert, Frédéric Giroire, Ignasi Sau
2009	B	`conf`	Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. WG Zhentao Li, Ignasi Sau
2009	J	`jnl`	Hardness and approximation of traffic grooming. Theor. Comput. Sci. Omid Amini, Stéphane Pérennes, Ignasi Sau
2009	B	`conf`	MPLS Label Stacking on the Line Network. Networking Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado
2009	C	`conf`	On Self-Duality of Branchwidth in Graphs of Bounded Genus. CTW Ignasi Sau, Dimitrios M. Thilikos
2009	J	`jnl`	Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs. Electron. Notes Discret. Math. Ignasi Sau, Dimitrios M. Thilikos
2008	J	`jnl`	An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discret. Math. Theor. Comput. Sci. Janez Zerovnik, Ignasi Sau
2008	B	`conf`	Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
2008	—	`conf`	Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC Omid Amini, Ignasi Sau, Saket Saurabh
2008	B	`conf`	Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. WG Xavier Muñoz, Ignasi Sau
2007	B	`conf`	Hardness and Approximation of Traffic Grooming. ISAAC Omid Amini, Stéphane Pérennes, Ignasi Sau