| 2026 | ESA | A More Versatile Model for Enumerative Kernelization: A Case Study for Vertex Cover. | Marin Bougeret, Guilherme C. M. Gomes, Ignasi Sau |
| 2026 | LICS | Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes. | Ignasi Sau, Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny |
| 2026 | STACS | Kernelization Dichotomies for Hitting Minors Under Structural Parameterizations. | Marin Bougeret, Eric Brandwein, Ignasi Sau |
| 2025 | ESA | Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion. | Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos |
| 2025 | ICALP | Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable. | Lus Felipe I. Cunha, Ignasi Sau, Uverton S. Souza, Mario Valencia-Pabon |
| 2025 | ICALP | Revisiting Directed Disjoint Paths on Tournaments (And Relatives). | Guilherme de C. M. Gomes, Raul Lopes, Ignasi Sau |
| 2025 | LAGOS | Finding subdigraphs in digraphs of bounded directed treewidth. | Raul Lopes, Ignasi Sau |
| 2025 | LAGOS | A Parameterized Perspective on Uniquely Restricted Matchings. | Juhi Chaudhary, Ignasi Sau, Meirav Zehavi |
| 2025 | SODA | Parameterizing the quantification of CMSO: model checking on minor-closed graph classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2024 | ICALP | Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. | Marin Bougeret, Bart M. P. Jansen, Ignasi Sau |
| 2024 | WABI | On the Complexity of the Median and Closest Permutation Problems. | Lus Cunha, Ignasi Sau, Uverton S. Souza |
| 2023 | ESA | New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. | Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau |
| 2023 | ICALP | Compound Logics for Modification Problems. | Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | ICALP | Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. | Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2022 | MFCS | Reducing the Vertex Cover Number via Edge Contractions. | Paloma T. Lima, Vincius Fernandes dos Santos, Ignasi Sau, Uverton S. Souza, Prafullkumar Tale |
| 2021 | LAGOS | Target set selection with maximum activation time. | Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau |
| 2020 | ICALP | Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. | Marin Bougeret, Bart M. P. Jansen, Ignasi Sau |
| 2020 | ICALP | An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | MFCS | A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. | Raul Lopes, Ignasi Sau |
| 2020 | MFCS | Reducing Graph Transversals via Edge Contractions. | Paloma T. Lima, Vincius Fernandes dos Santos, Ignasi Sau, Uverton S. Souza |
| 2020 | MFCS | Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. | Ignasi Sau, Uverton dos Santos Souza |
| 2020 | SODA | 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 |
| 2020 | WG | On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. | Rmy Belmonte, Ignasi Sau |
| 2018 | LATIN | On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. | Jlio Arajo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva |
| 2017 | IWOCA | Complexity Dichotomies for the Minimum ℱ -Overlay Problem. | Nathann Cohen, Frdric Havet, Dorian Mazauric, Ignasi Sau, Rmi Watrigant |
| 2017 | WG | On the Number of Labeled Graphs of Bounded Treewidth. | Julien Baste, Marc Noy, Ignasi Sau |
| 2017 | WG | Uniquely Restricted Matchings and Edge Colorings. | Julien Baste, Dieter Rautenbach, Ignasi Sau |
| 2016 | AAIM | Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. | Julien Baste, Christophe Paul, Ignasi Sau, Cline Scornavacca |
| 2016 | COCOA | On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs. | Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Lurbio Faria, Sulamita Klein, Ignasi Sau, Uverton dos Santos Souza |
| 2016 | WG | Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. | Didem Gzpek, Sibel zkan, Christophe Paul, Ignasi Sau, Mordechai Shalom |
| 2015 | CSR | A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. | Nathann Cohen, Daniel Gonalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller |
| 2015 | WAOA | 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 |
| 2015 | WAOA | An FPT 2-Approximation for Tree-cut Decomposition. | Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos |
| 2015 | WG | On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. | Luis Pedro Montejano, Ignasi Sau |
| 2014 | STACS | Explicit Linear Kernels via Dynamic Programming. | Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos |
| 2013 | ICALP | Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. | Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar |
| 2012 | COCOON | Dynamic Programming for H-minor-free Graphs. | Juanjo Ru, Ignasi Sau, Dimitrios M. Thilikos |
| 2012 | WG | Parameterized Domination in Circle Graphs. | Nicolas Bousquet, Daniel Gonalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stphan Thomass |
| 2011 | ESA | Hitting and Harvesting Pumpkins. | Gwenal Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stphan Thomass |
| 2011 | SOFSEM | On Approximating the | David Peleg, Ignasi Sau, Mordechai Shalom |
| 2010 | ESA | Fast Minor Testing in Planar Graphs. | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
| 2010 | ICALP | Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. | George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
| 2010 | ICALP | Dynamic Programming for Graphs on Surfaces. | Juanjo Ru, Ignasi Sau, Dimitrios M. Thilikos |
| 2010 | STACS | The Recognition of Tolerance and Bounded Tolerance Graphs. | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
| 2010 | SIROCCO | Traffic Grooming in Star Networks via Matching Techniques. | Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
| 2009 | IWOCA | Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. | David Coudert, Frdric Giroire, Ignasi Sau |
| 2009 | Networking | MPLS Label Stacking on the Line Network. | Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stphane Prennes, Herv Rivano, Ignasi Sau, Fernando Solano Donado |
| 2009 | SIROCCO | Designing Hypergraph Layouts to GMPLS Routing Strategies. | Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stphane Prennes, Ignasi Sau, Fernando Solano Donado |
| 2009 | WG | Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. | Zhentao Li, Ignasi Sau |
| 2009 | WG | A New Intersection Model and Improved Algorithms for Tolerance Graphs. | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
| 2008 | WAOA | Degree-Constrained Subgraph Problems: Hardness and Approximation Results. | Omid Amini, David Peleg, Stphane Prennes, Ignasi Sau, Saket Saurabh |
| 2008 | WG | Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. | Xavier Muoz, Ignasi Sau |
| 2007 | ISAAC | Hardness and Approximation of Traffic Grooming. | Omid Amini, Stphane Prennes, Ignasi Sau |