Mathilde Vernet

Nothing to annouce yet...

Journées Graphes et Algorithmes 2020

On the complexity of the dynamic Steiner problem. Presentation on the complexity of the dynamic Steiner problem during the annual meeting of French working groups on graphs and algorithms. This work was made with Stefan Balev, Yoann Pigné and Éric Sanlaville.

Visit JGA 2020 page here.

See abstract of this presentation (in french) here and the presentation slides here.

AlgoTel Conference 2020

Non-dominated Persistent Connected Components Detection in Dynamic Graphs. Presentation of persistent connected components and a polynomial algorithm to detect the non-dominated ones in a dynamic graph and experimental results during AlgoTel 2020. This work was made with Yoann Pigné and Éric Sanlaville.

Visit AlgoTel 2020 page here.

See abstract of this presentation (in french) here.

ROADEF Conference 2020

Non-dominated Persistent Connected Components Detection in Dynamic Graphs. Presentation of persistent connected components and a polynomial algorithm to detect the non-dominated ones in a dynamic graph and experimental results during the annual meeting of the French Operations Research and Decision Support Society. This work was made with Yoann Pigné and Éric Sanlaville.

Visit ROADEF 2020 page here.

Journées Graphes et Algorithmes 2019

Persistent connected components in dyamic graphs. Presentation of persistent connected components and an algorithm to compute them during the annual meeting of French working groups on graphs and algorithms. This work was made with Yoann Pigné and Éric Sanlaville.

Visit JGA 2019 page here.

See abstract of this presentation (in french) here and the presentation slides here.

EURO Conference 2019

Presentation of persistent connected components, an extension of connected components in temporal networks, and an algorithm to retrieve them. This presentation was part of stream Algorithms on Graphs during the annual EURO conference. This work was made with Yoann Pigné and Éric Sanlaville.

Visit EURO 2019 page here.

See abstract of this presentation here.

ROADEF Conference 2019

Shortest paths algorithm for the minimum cost flow problem on dynamic graphs. Presentation of an SSP-inspired algorithm for minimum cost flow problem on dynamic graphs and experimental results during the annual meeting of the French Operations Research and Decision Support Society. This work was made with Maciej Drozdowski, Yoann Pigné and Éric Sanlaville.

Visit ROADEF 2019 page here.

See abstract of this presentation (in french) here.

Cologne Twente Workshop 2018

Presentation of an SSP-inspired algorithm for minimum cost flow problem on dynamic graphs during CTW18. This work was made with Maciej Drozdowski, Yoann Pigné and Éric Sanlaville.

Visit CTW18 page here.

See abstract of this presentation here.

ROADEF Conference 2018

Algorithms on dynamic graphs: focus on flow problems. Presentation of maximum flow problem on dynamic graphs during the annual meeting of the French Operations Research and Decision Support Society. This work was made with Yoann Pigné and Éric Sanlaville.

Visit ROADEF 2018 page here.

See abstract of this presentation (in french) here.

LIP6, Complex Networks

Models and algorithms for dynamic graphs. Presentation of my PhD thesis work with a focus on connectivity problems in a seminar for the Complex Networks team of the LIP6 Lab.

See the presentation slides here.

Labri, AlgoDist and G&O

Presentation of connectivity problems in dynamic graphs in a seminar for the research groups Distributed Algorithms and Graphs and Optimisation in Combinatoire et Algorithmique team of the Labri Lab.

Connectivity in graphs is a well known issue, relevant to many applications. In the classical static context, it might seem simple even though some related problems are NP-complete. But in dynamic graphs, sometimes, even the simplest questions are far from trivial. What is the equivalent of a connected component in a dynamic graph ? How to identify those components ? In addition to connectivity itself, we can look at related problems. How to extend the definition of the Steiner problem in dynamic graphs ? This talk, based on my PhD thesis with Eric Sanlaville and Yoann Pigné, will consider those questions.

Institute of Computing Science, Poznan University of Technology

Presentation of dynamic graphs with a focus on flow problems in a lab seminar for the Institute of Computing Science, Poznan University of Technology.

Algorithmics

Practical sessions for 2nd year bachelor students. Correction and complexity of algorithms, data structures. 24 hours.

Java Programming

Practical sessions for 2nd year bachelor students. Polymorphism, exceptions, collections, lambda. 48 hours.

Graph Theory

Theoretical lessons for 1st year master students in computer science and applied mathematics. Graph theory and graph algorithm. 20 hours.

Graph Theory

Practical sessions for 1st year master students in computer science and applied mathematics. Graph algorithm, graph Java library. 20 hours.

Computer skills

Practical sessions for 1st year bachelor students. Archive files, emails, word processing. 16 hours.

Java Programming

Practical sessions for 2nd year bachelor students. Polymorphism, exceptions, collections, lambda. 48 hours.

Graph Theory

Theoretical lessons and practical sessions for 1st year master students. Graph algorithm, graph Java library. 4 hours of theoretical lessons and 9 hours of practical lessons.

Java Programming

Practical sessions for 2nd year bachelor students. Polymorphism, exceptions, collections, lambda. 48 hours.

Computer skills

Practical sessions for 1st year bachelor students. Archive files, emails, word processing. 16 hours.