M1 — ENS de Lyon, Computer Science

Perig
Montfort

Graduate student in computer science, interested in combinatorics, graph theory and randomness. Looking for a research internship or PhD position.

Graph Theory Combinatorics Randomness Computational Complexity Discrete Mathematics
📍 Lyon & Lille, France 🏛 ENS de Lyon

Who I am

I am a first-year master's student (M1) in the Computer Science department at ENS de Lyon, one of France's grandes écoles. My academic path led me through a classe préparatoire A highly selective two-year French post-secondary programme preparing students for competitive entrance exams to top schools (grandes écoles), with an intensive focus on mathematics and science. in the MP2I/MPI track, before joining ENS de Lyon for my undergraduate studies.

My research interests sit at the intersection of discrete mathematics, theoretical computer science and probability. I am particularly drawn to questions about graphs, combinatorial games, and the role of randomness in algorithms and structures.

Graph Theory

Structural properties, games on graphs, and algorithmic aspects of network problems.

Combinatorics

Extremal combinatorics, combinatorial games, and connections to complexity theory.

Randomness

Probabilistic methods, random structures, and randomised algorithms.

Publications

FUN 2026 (accepted) · 2026

On the Complexity of the Maker-Breaker Happy Vertex Game

Mathieu Hilaire, Perig Montfort, Nacim Oijid

Academic background

2025 – present

M1 — Master in Computer Science

ENS de Lyon, Lyon, France

First year of the master's programme in the Computer Science department. Focus on theoretical computer science, algorithms and discrete mathematics.

Computational Complexity Computer Algebra Data Bases and Data Mining Performance Evaluation Parallel and Distributed Algorithms and Programs Optimization Semantics and Verification Quantum Computer Science Topology and Differential Analysis Integrated Project

2024 – 2025

L3 — Bachelor in Computer Science

ENS de Lyon, Lyon, France

Undergraduate year in the Computer Science department at ENS de Lyon.

Algorithms Logic Foundations of Computer Science Probability in Computer Science Programming Theory Programming Integration, Measure Theory and Probability Algebra Category Theory Concentration of Measure Complex Analysis

2022 – 2024

Intensive Preparatory Programme (MP2I / MPI*) A highly selective two-year French post-secondary programme preparing students for competitive entrance exams to top schools (grandes écoles), especially in engineering and advanced academic fields.

Lycée Faidherbe, Lille, France

Two-year intensive programme in mathematics, computer science, and physics. Followed the MP2I track in the first year, then MPI* in the second year, an advanced section with a strong emphasis on theoretical computer science and mathematics.

Research & teaching

Research Internship — Probabilistic Combinatorics

Umeå University, Umeå, Sweden

Summer 2026

Three-month research internship supervised by Victor Falgas-Ravry. Studying connectivity and the emergence of the giant component in random subcube intersection graphs, focusing on phase transitions and structural properties.

Research Internship — Combinatorics & Graph Theory

LaBRI, Université de Bordeaux, Bordeaux, France

Summer 2025

Six-week research internship supervised by Mathieu Hilaire and Nacim Oijid. Studied combinatorial games on graphs, focusing on the Happy Vertex Game in the Maker-Breaker framework. This work led to a publication accepted at FUN 2026.

Mathematics Oral Examiner (Colleur) Weekly oral examinations in French preparatory classes (classes préparatoires), typically conducted in small groups of two to three students. Students solve problems on the board and explain their reasoning in real time under the guidance of an examiner.

Lycée La Martinière Monplaisir, Lyon, France

2024 – 2025

Conducted weekly oral examinations in mathematics for first-year MP2I students, focusing on problem solving, mathematical rigor, and clear oral presentation.

Projects

Hors-Sac — ENS de Lyon student journal

When puzzles resist computers: the mystery of P vs NP

A scientific popularisation article exploring computational complexity through the lens of combinatorial puzzles. Published in Hors-Sac, a student journal at ENS de Lyon featuring articles on a wide range of topics, written by students for students (in French).

Read →

GitHub — roundabout-mining-france

Roundabouts in Metropolitan France — A Geospatial Data Mining Study

A complete geospatial data mining pipeline on France's 62,000 roundabouts: OSM extraction, geometric reconstruction, Apriori pattern mining, and K-Means clustering to identify territorial profiles. Includes two interactive maps — an exploratory map of all roundabouts and a cluster map showing the four identified profiles across metropolitan France.

Get in touch

I am looking for research internship or PhD opportunities in theoretical computer science. Feel free to reach out!

Email perig.montfort [at] ens-lyon.fr
Institution ENS de Lyon, Computer Science Department
Location Lyon & Lille, France
GitHub @PMntf
LinkedIn Perig Montfort