Théophile Trunck

I'm a software engineer, working at Microsoft Paris.
My team owns the Media Catalog Ingestion platform for Microsoft's first party cross-screen Music and Video offering (Groove Music and Microsoft Movie & TV).

Before that I did my Ph.D in graph theory at ENS Lyon under Nicolas Trotignon supervision. I also did a Ph.D internship at the Warsaw university working with Marcin Kamiński. My research can be found below.

GitHub

GPG Key

Projects

ACM-Checker

A simple PHP/MySQL website for the Competitive Programming classe gave at ENS Lyon. It allow to submit solution and track students progress on external judges.

Snake

A simple snake programme in C using the SDL.

CodePuzzle

Compilation of solutions of programming puzzles from Topcoder, Project Euler, ACM ICPC... Mainly written in C++

Research

Papers

M. Kamiński, J-F. Raymond, T. Trunck, Well-quasi-ordering H-contraction-free graphs, Submitted
J. Błasiok, M. Kamiński, J-F. Raymond, T. Trunck, Induced minors and well-quasi-ordering, Eurocomb 2015
M. Kamiński, J-F. Raymond, T. Trunck, Multigraphs without large bonds are well-quasi-ordered by contraction, Submitted
A. Lagoutte, T. Trunck, Clique-Stable Separation in Perfect Graphs with no Balanced Skew-Partitions, Discrete Mathematics
P. Aboulker, M. Radovanović, N. Trotignon, T. Trunck, K. Vušković, Linear balanceable and subcubic balanceable graphs, Journal of Graph Theory
M. Chudnovsky, N. Trotignon, T. Trunck, K. Vušković, Coloring Berge graphs with no balanced skew partitions, Journal of Combinatorial Theory, Series B
M. Johnson, V. Patel, D. Paulusma and T. Trunck, Obtaining online ecological colourings by generalizing first-fit, Theory of Computing Systems

Ph.D Thesis

Trigraphes de Berge apprivoisés (). The defense took place in Lyon on September 17th, 2014. The slides can be found here ().

Talks

Coloration de graphes parfaits sans Balanced Skew Partition (),LIP (Lyon), April 22th 2014
Mineurs induits et bel ordre (), LIMOS (Clermont-Ferrand), March 20th 2014
Combinatorial applications of the Strong Perfect Graph Theorem , MIMUW (Warsaw), November 21th 2013
Graphes équilibrés sous-cubiques () JGA2013, LRI (Orsay), November 13th-15th 2013
Linear balanceable and subcubic balanceable graphs BGW2012, LaBRI (Bordeaux), November 21th-24th 2012
Coloration de graphes parfaits sans Balanced Skew Partition () JGA2012, LIMOS (Clermont Ferrand), November 14th-16th 2012
Introduction to Entropy, Brégman Theorem JCRAA2012, LIP (Lyon), June 28th-29th 2012