Ignasi Sau Valls -- Homepage

Ignasi Sau Valls
Directeur de Recherche at CNRS
AlGCo team: Algorithms for Graphs and Combinatorics
LIRMM, Université de Montpellier, Montpellier, France

2000-2005: Degree in Mathematics from UPC (Barcelona).
2000-2006: Degree in Telecom. Engineering from UPC (Barcelona).
2006-2009: PhD in joint supervision at
- Departament de Matemātiques of UPC (Barcelona, Catalonia).
- Projet Mascotte (Sophia Antipolis, France).
2009-2010: Postdoc at the Technion (Haifa, Israel).
2010-2024: Chargé de Recherche CNRS at LIRMM (Montpellier, France).
2016-2017: Visiting Professor for one year at Department of Mathematics of UFC within ParGO team (Fortaleza, Brazil).
2018: "Habilitation à Diriger des Recherches" (HDR) from Université de Montpellier.
Since October 2024: Directeur de Recherche CNRS (DR2) at LIRMM (Montpellier, France).

News
and
recent
highlights

PI of the ANR JCJC project ELIT (ANR-20-CE48-0008-01), funded 169k€ from 10/2021 until 10/2026.
Editor of the journals DMTCS and Information and Computation.
PC member of MFCS 2019, WG 2019, IPEC 2021, WG 2022, ICGT 2022, AlgoTel 2023, IPEC 2024, AlgoTel 2024.
Co-chair and main organizer of WG 2019, June 19-21,Vall de Núria, Catalonia.
Chair and main organizer of ICGT 2022, July 4-8, Montpellier, France.
Main organizer of JCALM 2023, December 13-14, Montpellier, France.
Invited course (6h) at the summer School on Graph Theory (SGT), Murol, France, June 2022.
Invited talk at CALDAM 2023, Gandhinagar, India, February 2023.
Invited course (15h) at the 36th Escuela de Ciencias Informáticas (ECI), Buenos Aires, Argentina, July 2023.
Invited course (4h) at the II Fortaleza Workshop em Combinatķria (ForWorC), Fortaleza, Brazil, November 2023.

Some
selected
journal
publications

I. Sau, G. Stamoulis, and D. M. Thilikos. k-apices of minor-closed graph classes. I. Bounding the obstructions. Journal of Combinatorial Theory, Series B, 2023.
J. Baste, I. Sau, and D. M. Thilikos. Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. SIAM Journal on Computing, 2023.
M. Bougeret, B. M. P. Jansen, and I. Sau. Bridge-depth characterizes which minor-closed structural parameterizations of Vertex Cover admit a polynomial kernel. SIAM Journal on Discrete Mathematics, 2022.
V. A. Campos, R. Lopes, A. K. Maia, and I. Sau. Adapting the Directed Grid Theorem into an FPT algorithm. SIAM Journal on Discrete Mathematics, 2022.
E. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith, I. Sau, and S. Sikdar. Linear kernels and single-exponential algorithms via protrusion decompositions. ACM Transactions on Algorithms, 2016.
J. Rué, I. Sau, and D. M. Thilikos. Dynamic programming for graphs on surfaces. ACM Transactions on Algorithms, 2014.
G. B. Mertzios, I. Sau, and S. Zaks. The recognition of tolerance and bounded tolerance graphs. SIAM Journal on Computing, 2011.

Affiliation	LIRMM, Université de Montpellier, CNRS
E-mail	(if you don't want your message to get lost, better avoid my e-mail @lirmm.fr)
Postal address	LIRMM - UMR 5506 - CC 477, 161 rue Ada, 34095 Montpellier Cedex 5, France
Office	E.3.20 (how to get there?)

Research interests

Graph Theory and Parameterized Complexity

Personal interests

Sports, Catalan politics, traveling, F.C. Barcelona

This webpage was last updated on September 9, 2024