Ignasi Sau - Talks

LIRMM

Université de Montpellier

CNRS

Ignasi Sau - Some communications

2023

Introduction to logic in graphs and algorithmic meta-theorems [Slides (.pdf)]
Talk in 20èmes Journées JCALM, Montpellier, France, December 2023 (in English).
Algorithmic aspects of the theory of Graph Minors [Slides (.pdf)]
Invited course (4h) at the II Fortaleza Workshop em Combinatória (ForWorC), Fortaleza, Brazil, November 2023 (in Portuguese).
Compound logics for modification problems [Slides (.pdf)]
Talk at the II Fortaleza Workshop em Combinatória (ForWorC), Fortaleza, Brazil, November 2023 (in English).
Algorithmic aspects of minor-closed graph classes [Slides (.pdf)]
Invited course (15h) at the 36th Escuela de Ciencias Informáticas (ECI), Buenos Aires, Argentina, July 2023 (in Spanish).
Compound logics for modification problems [Slides (.pdf)]
Talk at the FPT Fest 2023 in the honour of Mike Fellows, Bergen, Norway, June 2023 (in English).
Graph modification problems with forbidden minors [Slides (.pdf)]
Invited talk at the 9th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), Gandhinagar, India, February 2023 (in English).

2022

Compound logics for modification problems [Slides (.pdf)]
Talk at the LoGAlg workshop, Montpellier, France, November 2022 (in English).
Graph modification problems with forbidden minors [Slides (.pdf)]
Seminário ParGO, Universidade Federal do Ceará, Fortaleza, Brazil, November 2022 (in Portuguese).
Algorithmic aspects of minor-closed graph classes [Slides (.pdf)]
Invited mini-course (6h) at the summer School on Graph Theory (SGT), Murol, France, June 2022 (in English).

2021

Introducing lop-kernels: the case of Maximum Minimal Vertex Cover [Slides (.pdf)]
Séminaire virtuel de théorie des graphes et combinatoire en Rhône-Alpes et Auvergne (GRAA), online, September 2021 (in English).
On the complexity of finding large odd induced subgraphs and odd colorings [Slides (.pdf)]
LIMDA Joint Seminar (online), UPC, Barcelona, Catalunya, April 2021 (in English).
Kernelization of Maximum Minimal Vertex Cover [Slides (.pdf)] [Video (youtube)]
Parameterized Complexity Seminar (online), IMSc, Chennai, India, March 2021 (in English).
Introduction to treewidth [Slides (.pdf)]
Rencontres virtuelles en théorie des graphes (JCRAALMA), France, March 2021 (in English).
Kernelization of Maximum Minimal Vertex Cover [Slides (.pdf)]
Séminaire AlGCo (online), Montpellier, France, March 2021 (in English).

2020

Reducing graph transversals via edge contractions [Slides (.pdf)] [Video (youtube)]
Seminários online de Grafos, Algoritmos e Combinatória, October 2020 (in Portuguese).
Reducing graph transversals via edge contractions [Slides (.pdf)]
Séminaire AlGCo, Montpellier, France, October 2020 (in French).
On the complexity of finding large odd induced subgraphs and odd colorings [Slides (.pdf)] [Video (youtube)]
Invited online presentation at the virtUMA meeting (Reunión Anual de la Unión Matemática Argentina), September 2020 (in Spanish).
Reducing graph transversals via edge contractions [Slides (.pdf)] [Video (youtube)]
Presentation of a paper in the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS), held online, August 2020 (in English).
On the complexity of finding large odd induced subgraphs and odd colorings [Slides (.pdf)]
Presentation of a paper in the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), held online, June 2020 (in English).
On the complexity of finding large odd induced subgraphs and odd colorings [Slides (.pdf)]
Séminaire AlGCo, Montpellier, France, June 2020 (in English).
FPT algorithms for hitting forbidden minors [Slides (.pdf)]
Invited talk at the 20th Haifa Workshop on Graph Theory, Combinatorics and Algorithms (held online), June 2020 (in English).
Introdução sobre complexidade parametrizada [Slides (.pdf)]
Seminário na UFC, Fortaleza, Brazil, February 2020 (in Portuguese).

2019

Introdução sobre complexidade parametrizada [Slides (.pdf)]
Seminário na UFC, Fortaleza, Brazil, November 2019 (in Portuguese).
Efficient algorithms parameterized by treewidth [Slides (.pdf)]
Seminário de Combinatória e Algorithmos do PESC, UFRJ, Rio de Janeiro, Brazil, December 2019 (in Portuguese).
Introdução sobre complexidade parametrizada [Slides (.pdf)]
Seminário de Combinatória do IME, UFF, Niterói, Brazil, November 2019 (in Portuguese).
Hitting minors on bounded treewidth graphs [Slides (.pdf)]
Talk at the 1st French Norwegian Workshop on Algorithms and Combinatorics (FraNorAC), Montpellier, France, September 2019 (in English).
Hitting minors on bounded treewidth graphs [Slides (.pdf)]
Talk at the 1st Joint Meeting Brazil-France in Mathematics, IMPA, Rio de Janeiro, Brazil, July 2019 (in English).
Efficient algorithms parameterized by treewidth [Slides (.pdf)]
Invited talk at the X Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Belo Horizonte, Brazil, June 2019 (in English).
Algorithmes paramétrés efficaces [Slides (.pdf)]
Présentation publique dans le CIEL (réunion inter-équipes du LIRMM), Montpellier, France, May 2019 (in French).
Hitting minors on bounded treewidth graphs [Slides (.pdf)]
Talk in I Fortaleza Workshop em Combinatória (ForWorC), Fortaleza, Brazil, February 2019 (in Portuguese).
Hitting minors on bounded treewidth graphs [Slides (.pdf)]
Talk in Dagstuhl seminar 19041, Dagstuhl, Germany, January 2019 (in English).

2018

Efficient algorithms on graphs of bounded treewidth [Slides (.pdf)]
Invited talk at 20ièmes Journées Graphes et Algorithmes (JGA), Grenoble, France, November 2018 (in French).
Hitting (topological) minors on bounded treewidth graphs [Slides (.pdf)]
Talk at Graph Theory (GT2018) meeting, Nyborg, Denmark, September 2018 (in English).
Dual parameterization of Weighted Coloring [Slides (.pdf)]
Presentation of a paper in the 13th International Symposium on Parameterized and Exact Computation (IPEC), Helsinki, Finland, August 2018 (in English).
Some contributions to parameterized complexity [Slides (.pdf)]
HDR defense, Montpellier, France, June 2018 (in English).
Fast algorithms parameterized by treewidth [Slides (.pdf)]
Talk in ANR ESIGMA meeting, Paris, France, June 2018 (in English).
Introdução à complexidade parametrizada [Slides (.pdf)] [Video (youtube)]
Seminário de Teoria, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil, February 2018 (in Portuguese).
Finding subdivisions of spindles on digraphs [Slides (.pdf)]
Palestra na Escola de Verão em Computação, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil, February 2018 (in Portuguese).

2017

Finding subdivisions of spindles on digraphs [Slides (.pdf)]
Séminaire AlGCo, Montpellier, France, October 2017 (in French).
Ruling out FPT algorithms for Weighted Coloring on forests [Slides (.pdf)]
Presentation of a paper in the IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS), Marseille, France, September 2017 (in English).
Finding subdivisions of spindles on digraphs [Slides (.pdf)]
Seminário ParGO, Universidade Federal do Ceará, Fortaleza, Brazil, June 2017 (in Portuguese).

2016

The number of graphs of bounded treewidth [Slides (.pdf)]
Seminário ParGO, Universidade Federal do Ceará, Fortaleza, Brazil, September 2016 (in Portuguese).
The number of graphs of bounded treewidth [Slides (.pdf)]
Séminaire COATI, Sophia Antipolis, France, May 2016 (in French).
Noyaux (presque) linéaires dans les graphes d'expansion bornée et "nowhere dense"
Talk in Journées JCALM, Montpellier, France, March 2016 (in French).

2015

On the complexity of computing the k-restricted edge-connectivity of a graph [Slides (.pdf)]
Presentation of a paper in the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Munich, Germany, June 2015 (in English).
On the complexity of computing the k-restricted edge-connectivity of a graph [Slides (.pdf)]
Séminaire AlGCo, Montpellier, France, June 2015 (in English).
The List Allocation problem and some of its applications in parameterized algorithms [Slides (.pdf)]
Seminar of Graph Theory, Combinatorics and Applications of UPC, Barcelona, Catalunya, May 2015 (in Catalan).
FPT algorithm for a generalized cut problem and some applications [Slides (.pdf)]
Seminário ParGO, Universidade Federal do Ceará, Fortaleza, Brazil, February 2015 (in English).
FPT algorithm for a generalized cut problem and some applications [Slides (.pdf)]
Talk in Rencontres Internationales sur les méthodes de décomposition de graphes, CIRM, Luminy, Marseille, January 2015 (in English).
FPT algorithm for a generalized cut problem and some applications [Slides (.pdf)]
Séminaire AlGCo, Montpellier, France, January 2015 (in English).

2014

Linear kernels and single-exponential algorithms via protrusion decompositions [Slides (.pdf)]
Talk in Seminário de Grafos e Algoritmos, UFRJ, Rio de Janeiro, Brazil, November 2014 (in English).
On the Erdös-Pósa property for minors of graphs [Slides (.pdf)]
Talk in Barcelona Mathematical Days, Institut d'Estudis Catalans, Barcelona, Catalunya, November 2014 (in English).
Linear kernels and single-exponential algorithms via protrusion decompositions [Slides (.pdf)]
Seminar in Université Libre de Bruxelles (ULB), Brussels, Belgium, October 2014 (in English).
Programmation dynamique dans les graphes peu denses [Slides (.pdf)]
Talk in the Journée Scientifique du LIRMM, Montarnaud, France, June 2014 (in French).

2013

Bidimensionality Theory [Slides (.pdf)]
Talk in Journées JCALM, Barcelona, Catalunya, October 2013 (in English).
Optimal Erdös-Pósa Property for Pumpkins [Slides (.pdf)]
Talk in the Joint Mathematical Conference of Catalan, Slovenian, Austrian, Slovak and Czech Mathematical Societies (CSASC), Koper, Slovenia, June 2013 (in English).
Linear Kernels and Single-exponential Algorithms via Protrusion Decompositions [Slides (.pdf)]
Seminar of Graph Theory, Combinatorics and Applications of UPC, Barcelona, Catalunya, February 2013 (in English).
Linear Kernels on Graphs Excluding Topological Minors [Slides (.pdf)]
Talk in the ANR AGAPE meeting, Université d'Orléans, France, January 2013 (in English).
Optimal Erdös-Pósa Property for Pumpkins [Slides (.pdf)]
Talk in Congreso de la RSME, Santiago de Compostela, Spain, January 2013 (in Spanish).

2012

Parameterized Domination in Circle Graphs [Slides (.pdf)]
Seminar in the Algorithms Research Group, University of Bergen, Norway, October 2012 (in English).
Dynamic Programming in Sparse Graphs [Slides (.pdf)]
Seminar in Université Libre de Bruxelles (ULB), Brussels, Belgium, March 2012 (in English).

2011

Parameterized Domination in Circle Graphs [Slides (.pdf)] [Video (youtube)]
Talk in the 5th workshop on Graph Classes, Optimization, and Width Parameters (GROW), Daejeon, South Korea, October 2011 (in English).
Algorismes (no massa) superpolinomials en grafs [Slides (.pdf)]
Talk in 2a Jornada SCM de Joves Investigadors en Matemàtiques, Institut d'Estudis Catalans, Barcelona, Catalunya, October 2011 (in Catalan).
Hitting and Harvesting Pumpkins [Slides (.pdf)]
Presentation of a paper in the 19th Annual European Symposium on Algorithms (ESA), Saarbrucken, Germany, September 2011 (in English).
Traffic Grooming in Bidirectional WDM Ring Networks [Slides (.pdf)]
Talk in the celebration of Jean-Claude Bermond's EADS 2010 prize, Montpellier, France, March 2011 (in French).
Dynamic Programming in Sparse Graphs [Slides (.pdf)]
Seminar of Graph Theory, Combinatorics and Applications of UPC, Barcelona, Catalunya, March 2011 (in English).
Single Exponential Parameterized Algorithms: Good and Bad News [Slides (.pdf)]
Lecture in Journées AGAPE, Montpellier, France, February 2011 (in English).
On Approximating the d-Girth of a Graph [Slides (.pdf)]
Presentation of a paper in the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Novy Smokovec, Slovakia, January 2011 (in English).

2010

Dynamic Programming for Graphs on Surfaces [Slides (.pdf)]
Seminar in the Department of Mathematics of NKU (MPLA), Athens, Greece, November 2010 (in English).
Dynamic Programming for Graphs on Surfaces [Slides (.pdf)]
In the 2nd Workshop on Graph Decompositions, CIRM, Marseille, France, October 2010 (in English).
Dynamic Programming for Graphs on Surfaces [Slides (.pdf)]
In the Research Seminar in Discrete and Computational Geometry, Ben Gurion University of the Negev, Be'er Sheva, Israel, June 2010 (in English).
Edge-partitioning Regular Graphs, with Applications to Traffic Grooming [Slides (.pdf)]
Combinatorics Seminar in the Mathematics Department of Technion, Haifa, Israel, March 2010 (in English).

2009

Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks [Slides (.pdf)]
Seminar of Graph Theory, Combinatorics and Applications of UPC, Barcelona, Catalunya, October 2009 (in English).
Optimization in Graphs under Degree Constraints. Application to Telecommunication Networks [Slides (.pdf)]
Ph.D defense, Sophia Antipolis, France, October 2009 (in English).
Edge-partitioning regular graphs [Slides (.pdf)]
Seminar in MASCOTTE project, Sophia-Antipolis, France, July 2009 (in French).
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph [Slides (.pdf)]
Presentation of a paper in the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Montpellier, France, June 2009 (in English).
On Self-duality of Branchwidth in Graphs of Bounded Genus [Slides (.pdf)]
Presentation of a paper in the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), Paris, France, June 2009 (in English).
Designing Hypergraph Layouts to GMPLS Routing Strategies [Slides (.pdf)]
Presentation of a paper in the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Piran, Slovenia, May 2009 (in English).
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs [Slides (.pdf)]
Presentation of a paper in DIMAP workshop on Algorithmic Graph Theory (AGT), University of Warwick, U.K., March 2009 (in English).
Résumé de thèse [Slides (.pdf)]
Presentation of my Ph.D proposal in Mascotte project meeting, Le Boréon, France, March 2009 (in French).

2008

Degree-Constrained Subgraph Problems: Hardness and Approximation [Slides (.pdf)]
Seminar in the Department of Mathematics of IMFM, Ljubljana, Slovenia, December 2008 (in English).
Degree-Constrained Subgraph Problems: Hardness and Approximation [Slides (.pdf)] [Video (.mov)]
Seminar in the Department of Mathematics of NKU (MPLA), Athens, Greece, November 2008 (in English).
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs [Abstract (.pdf)] [Slides (.pdf)]
Talk in 10èmes Journées Graphes et Algorithmes (JGA), Sophia Antipolis, France, November 2008 (in French).
Defense DEA [Slides (.pdf)]
Defense of DEA (Diploma d'Estudis Avançats) at Universitat Politecnica de Catalunya, Barcelona, September 2008 (in Catalan).
Degree-Constrained Subgraph Problems: Hardness and Approximation [Slides (.pdf)]
Presentation of a paper in the 6th Workshop on Approximation and Online Algorithms (ALGO/WAOA), Universität Karlsruhe, Germany, September 2008 (in English).
Ph.D proposal [Slides (.pdf)]
Presentation of my Ph.D proposal at Univeristat Politecnica de Catalunya, videoconference Nice-Barcelona, September 2008 (in Catalan).
Traffic Grooming in Unidirectional WDM Rings with Bounded-Degree Request Graph [Slides (.pdf)]
Presentation of a paper in the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Durham University, U.K., July 2008 (in English).
Maximum Degree-Bounded Connected Subgraph: Hardness and Approximation [Slides (.pdf)]
Seminar in the Computer Science Department of Technion, Haifa, Israel, June 2008 (in English).
Finding Small Subgraphs of Given Minimum Degree [Slides (.pdf)]
Talk in COST 293 Discussion Workshop, Bertinoro, Italy, May 2008 (in English).
Maximum Degree-Bounded Connected Subgraph: Hardness and Approximation [Slides (.pdf)]
Seminar in MASCOTTE project, Sophia-Antipolis, France, April 2008 (in French).

2007

Trouver le plus petit sous-graphe avec degré minimum donné [Slides (.pdf)]
Talk in 9èmes Journées Graphes et Algorithmes, Paris, France, November 2007 (in French).
Hardness and Approximation of Traffic Grooming [Slides (.pdf)]
Talk in COST 293 Discussion Workshop, Roma, Italy, October 2007 (in English).
Finding Small Subgraphs under Degree Constraints [Slides (.pdf)]
Seminar in the Computer Science Department of Technion, Haifa, Israel, June 2007 (in English).
Hardness of Approximating the Traffic Grooming Problem [Slides (.pdf)]
Presentation of a paper in AlgoTel'07, Ile d'Oleron, France, May 2007 (in French).
Optimal Permutation Routing on Mesh Networks [Slides (.pdf)]
Presentation of a paper in International Network Optimization Conference (INOC), Spa, Belgium, April 2007 (in English).
On the Dense k-Subgraph Problem
Talk in MASCOTTE project, Sophia-Antipolis, France, April 2007 (in English).
Packet Routing Problems on Plane Grids [Slides (.pdf)]
In AEOLUS Workshop on Scheduling, Nice, France, March 2007 (in English).
An Optimal Permutation Routing Algorithm for Hexagonal Mesh Networks [Slides (.pdf)]
In COST 293 GRAAL and COST 295 DYNAMO Discussion Workshop, Maribor, Slovenia, February 2007 (in English).

2006

Traffic Grooming in Bidirectional WDM Ring Networks [Slides (.ppt)]
Presentation of a paper in 8th ICTON Conference, Nottingham, U.K., June 2006 (in English).
On the Complexity of Classical Graph Theoretical Problems
Seminar in the PhD course on Computational Complexity of UPC, Barcelona, Catalunya, June 2006 (in Spanish).
Traffic Grooming in Optical Networks [Slides (.pdf)]
Seminar of Graph Theory, Combinatorics and Applications of UPC, Barcelona, Catalunya, June 2006 (in Catalan).

Last updated: March 25, 2021

back to Home