Mathilde Vernet

Université Du Havre · UFR Sciences et Techniques · 25 rue Philippe Lebon · BP 1123 · 76063 Le Havre Cedex · mathilde.vernet@univ-lehavre.fr

I am a PhD student in computer science under the supervision of Éric Sanlaville and Yoann Pigné at LITIS Lab (RI2C team). I started on september 2017 at Normandie Université, Le Havre, France. My PhD thesis focuses on optimization in temporal networks. I consider graphs in which vertices, arcs, labels might be time dependent. The main goal is to design efficient algorithms, both theoretically and practically, to solve optimization problems on such graphs.

Keywords: dynamic graph, algorithm, optimization


Upcoming events

Journées Graphes et Algorithmes 2019

Composantes connexes persistantes dans les graphes dynamiques

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.

Visit JGA 2019 page here.

November 2019, Brussels, Belgium

Main Scientific Communications

EURO Conference 2019

Persistent Connected Components on Temporal Networks

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.

June 2019, Dublin, Ireland

ROADEF Conference 2019

Un algorithme de plus courts chemins pour le problème de flot de coût minimum dans un graphe dynamique

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.

February 2019, Le Havre, France

Cologne Twente Workshop 2018

Successive Shortest Path Algorithm for Flows in Dynamic Graphs

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.

June 2018, Paris, France

ROADEF Conference 2018

Algorithmique dans les graphes dynamiques : le cas des flots

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.

February 2018, Lorient, France

Teaching

Java Programming

Université Le Havre Normandie

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

Spring 2019

Computer skills

Université Le Havre Normandie

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

Fall 2018

Education

PhD Thesis in Computer Science

Normandie Université, Le Havre, France
Ongoing

Master of Science in Operations Research, Combinatorics and Optimization

Université Grenoble Alpes, Grenoble, France
2017

Bachelor's degree in Computer Science and Applied Mathematics

Université Grenoble Alpes, Grenoble, France
2015