Frédéric Meunier
CERMICS, École nationale des ponts et chaussées

Preprints
Articles in journals
Conferences with proceedings
Conferences with extended abstracts
Unpublished reports
Popularization

Preprints

Box complexes: at the crossroad of graph theory and topology, with Hamid Reza Daneshpajouh.

Finite adaptability in two-stage robust optimization: asymptotic optimality and tractability, with Safia Kedad-Sidhoum and Anton Medvedev.

Articles in journals

Envy-free division of multi-layered cakes, with Ayumi Igarashi, Mathematics of Operations Research, accepted for publication. (A preliminary version of this paper was presented at WINE 2021.)

Quasi-kernels in split graphs, with Hélène Langlois, Stéphane Vialette, Romeo Rizzi, and Yacong Zhou, Discrete Applied Mathematics, 361, 236-243, 2025.

Linear lexicographic optimization and preferential bidding system, with Axel Parmentier and Nour ElHouda Tellache, Transportation Science, 58, 597-613, 2024.

Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once, with Sébastien Deschamps, Operations Research Letters, 54, 107110, 2024.

Tropical Nash equilibria and complementarity problems, with Xavier Allamigeon and Stéphane Gaubert, SIAM Journal on Discrete Mathematics, 37, 1645-1665, 2023.

L. Lovász: "Graphs and Geometry", Jahresbericht der Deutschen Mathematiker-Vereinigung, 124, 109-117, 2022.

On is an n-MCFL, with Kilian Gebhardt and Sylvain Salvati, Journal of Computer and System Sciences, 127, 41-52, 2022.

Column generation for mining cut definition with geometallurgical interactions, with Gonzalo Nelis and Nelson Morales, Natural Resources Research, 31, 131-148, 2022.

Colorings of complements of line graphs, with Hamid Reza Daneshpajouh and Guilhem Mizrahi, Journal of Graph Theory, 98, 216-233, 2021.

Topological bounds for graph representations over any field, with Meysam Alishahi, SIAM Journal on Discrete Mathematics, 35, 91-104, 2021.

Tverberg theorems over discrete sets of points, with Jesús De Loera, Tommy Hogan, and Nabil Mustafa, AMS Special Session on Polytopes and Discrete Geometry, Contemporary Mathematics, 764, 57-70, 2021. (A preliminary version of this paper was presented at EuroCG 2018.)

Minimizing the waiting time for a one-way shuttle service, with Laurent Daudet, Journal of Scheduling, 23, 95-115, 2020.

Aircraft routing and crew pairing: updated algorithms at Air France, with Axel Parmentier, Omega: The International Journal of Management Science, 93, 2020.

Perfect graphs with polynomially computable kernels, with Ayumi Igarashi and Adèle Pass-Lanneau, Discrete Applied Mathematics, 272, 69-74, 2020. (A preliminary version of this paper was presented at CTW 2017.)

Different versions of the nerve theorem and rainbow simplices, with Luis Montejano, Journal of Combinatorial Theory, Series A, 169, 105125, 2020.

Envy-free cake division without assuming the players prefer nonempty pieces, with Shira Zerbib, Israel Journal of Mathematics, 234, 907-925, 2019.

Multilabeled versions of Sperner's and Fan's lemmas and applications, with Francis Su, SIAM Journal on Applied Algebra and Geometry, 3, 391-411, 2019.

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, with Jesús De Loera, Xavier Goaoc, and Nabil Mustafa, Bulletin of the AMS, 56, 415-511, 2019.

Computing solutions of the multiclass network equilibrium problem with affine cost functions, with Thomas Pradeau, Annals of Operations Research, 274, 447-469, 2019. (The second part of this paper was the content of my WINE 2013 conference paper with Thomas Pradeau.)

Achieving rental harmony with a secretive roommate, with Florian Frick and Kelsey Houston-Edwards, The American Mathematical Monthly, 126, 18-32, 2019.

Shared mobility systems: An updated survey, with Gilbert Laporte and Roberto Wolfler Calvo, Annals of Operations Research, 271, 105-126, 2018. (This is an updated version of this paper.)

The multiple vehicle balancing problem, with Marco Casazza, Alberto Ceselli, Daniel Chemla, and Roberto Wolfler Calvo, Networks, 72, 337-357, 2018.

Colorful linear programming, Nash equilibrium, and pivots, with Pauline Sarrabezolles, Discrete Applied Mathematics, 240, 78-91, 2018.

Fair splitting of colored paths, with Meysam Alishahi, The Electronic Journal of Combinatorics, 24(3), 2017.

Strengthening topological colorful results for graphs, with Meysam Alishahi and Hossein Hajiabolhassan, European Journal of Combinatorics, 64, 27-44, 2017.

Hedetniemi's conjecture for Kneser hypergraphs, with Hossein Hajiabolhassan, Journal of Combinatorial Theory, Series A, 143, 42-55, 2016.

A business dinner problem, with Alejandra Estanislao, Journal of Combinatorial Mathematics and Combinatorial Computing, 97, 173-188, 2016. In the version given here, Theorem 3 and Proposition 7 have been corrected; see acknowledgments.

Shared mobility systems, with Gilbert Laporte and Roberto Wolfler Calvo, 4OR, 13, 341-360, 2015.

Design and operation for an electric taxi fleet, with Bernat Gacias, Operations Research Spectrum, 37, 171-194, 2015.

The uniqueness property for networks with several origin-destination pairs, with Thomas Pradeau, European Journal of Operational Research, 237, 245-256, 2014.

A combinatorial approach to colourful simplicial depth, with Antoine Deza and Pauline Sarrabezolles, SIAM Journal on Discrete Mathematics, 28, 306-322, 2014.

Simplotopal maps and necklace splitting, Discrete Mathematics, 323, 14-26, 2014.

Colorful subhypergraphs in Kneser hypergraphs, The Electronic Journal of Combinatorics, 21(1), 2014.

Envy-free two-player m-cake and three-player two-cake divisions, with Nicolas Lebert and Quentin Carbonneaux, Operations Research Letters, 41, 607-610, 2013.

Computing and proving with pivots, RAIRO Operations Research, 47, 331-360, 2013.

LAD models, trees, and an analog of the fundamental theorem of arithmetic, with Nadia Brauner, Sylvain Gravier, and Louis-Philippe Kronek, Discrete Applied Mathematics, 161, 909-920, 2013. I realized several years after this paper has been published that our "analog of the fundamental theorem of arithmetic" is actually a well-known property of Lyndon words.

Bike-sharing system: solving the static rebalancing problem, with Daniel Chemla and Roberto Wolfler Calvo, Discrete Optimization, 10, 120-146, 2013. (Companion site)
Most cited article in Discrete Optimization since 2009 (source: Scopus).

A further generalization of the colourful Carathéodory theorem, with Antoine Deza, Discrete Geometry and Optimization, Fields Institute Communications Series, 69, 179-190, 2013. In this version, the second corollary of Section 3.2 has been removed: it was incorrect.

Computing solution of the Paintshop-Necklace problem, with Bertrand Neveu, Computers and Operations Research, 39, 2666-2677, 2012. (Instances)

Balancing the stations of a self-service bike hiring system, with Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Julien Laroche, and Ludovic Robinet, RAIRO Operations Research, 45, 37-61, 2011.

The chromatic number of almost stable Kneser hypergraphs, Journal of Combinatorial Theory, Series A, 118, 1820-1828, 2011.

Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree, with Olivier Durand de Gevigney, Julien Reygner, Christian Poppa, Ayrin Romero-Campos, 4OR, 9, 175-188, 2011.

Optimal linear estimator of origin-destination flows with redundant data, Annals of Operations Research, 181, 709-722, 2010.

Equilibrium results for dynamic congestion game, with Nicolas Wagner, Transportation Science, 44, 524-536, 2010. The version given here has been slightly modified, in order to correct several typos which remained in the published version and to add missing conditions in Lemma 1 and Theorem 2.

Completely symmetric configurations for sigma-games on grid graphs, with Mathieu Florence, Journal of Algebraic Combinatorics, 31, 533-545, 2010.

Carathéodory, Helly, and the others in the max-plus world, with Stéphane Gaubert, Discrete and Computational Geometry, 43, 648-662, 2010.

Greedy colouring of the binary paintshop problem, with Hadis Amini, Héloïse Michel, and Atefeh Mohajeri, Journal of Discrete Algorithms, 8, 8-14, 2010.

Paint shop, odd cycles and necklace splitting, with Andras Sebő, Discrete Applied Mathematics, 157, 780-793, 2009.

Discrete Splittings of the Necklace, Mathematics of Operations Research, 33, 678-688, 2008.

A combinatorial proof of a theorem of Freund, Journal of Combinatorial Theory, Series A, 115, 317-325, 2008.

Combinatorial Stokes formulae, European Journal of Combinatorics, 29, 286-297, 2008.

Sperner labellings: a combinatorial approach, Journal of Combinatorial Theory, Series A, 113, 1462-1475, 2006.

A Topological Lower Bound for the Circular Chromatic Number of Schrijver Graphs, Journal of Graph Theory, 49, 257-261, 2005.

Large Momentum Bounds from Flow Equations, with Christoph Kopper, Annales Henri Poincaré, 3, 435-449, 2002.

Refereed conferences with proceedings

Balanced assignments of periodic tasks, with Héloïse Gachet, ATMOS 2024.

Two-stage adaptable robust optimization for glass production, with Anton Medvedev and Safia Kedad-Sidhoum, ICORES 2024.

Algorithmic aspects of quasi-kernels, with Hélène Langlois, Romeo Rizzi, and Stéphane Vialette, WG 2022.

Envy-free division of multi-layered cakes, with Ayumi Igarashi, WINE 2021.

Optimizing the ramp design in an open pit mine, with Islem Kaabachi and Nelson Morales, APCOM 2021.

A stochastic multi-item lot-sizing problem with bounded number of setups, with Étienne de Saint-Germain and Vincent Leclère, ICORES 2018.

The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications, with Wolfgang Mulzer, Pauline Sarrabezolles, and Yannik Stein, SODA 2017.

Online Train Shunting, with Vianney Bœuf, Best Paper Award, ATMOS 2014.

A Lemke-like algorithm for the Multiclass Network Equilibrium Problem, with Thomas Pradeau, WINE 2013.

Optimal Network Estimation of Origin-Destination Flow from Link Data, with Fabien Leurent, TRB 2009.

Analysis of an algorithm catching elephants on the internet, with Yousra Chabchoub, Christine Fricker, and Danielle Tibi, Fifth Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities 2008.

The Analysis of a Near-optimal Cardinality Estimation Algorithm, with Philippe Flajolet, Eric Fusy, and Olivier Gandouet, AofA 2007.

Refereed conferences with extended abstracts

Integer and Mixed Integer Tverberg Numbers, with Jesús De Loera, Tommy Hogan, and Nabil Mustafa, EuroCG 2018.

Computing kernels in graphs with a clique-cutset, with Ayumi Igarashi and Adèle Pass-Lanneau, CTW 2017.

Generalized Colorful Linear Programming and Further Applications, with Wolfgang Mulzer, Pauline Sarrabezolles, and Yannik Stein, EuroCG 2016.

Simulation of Mutualized Urban Logistics Systems with Real-Time Management, with Rafik Makhloufi, Diego Cattaruzza, Nabil Absi, and Dominique Feillet, ISTS 2014.

A combinatorial approach to colourful simplicial depth, with Antoine Deza and Pauline Sarrabezolles, EUROCOMB 2013.

Locating charging points for an electric fleet, with Bernat Gacias, MOSIM 2012.

The static Multiple Vehicles rebalancing problem, with Daniel Chemla and Roberto Wolfler Calvo, ODYSSEUS 2012.

Polytopal complexes: maps, chain complexes and... necklaces, TGGT 2008.

Unpublished technical reports

Sensitivity of equilibrium in atomic congestion games with player-specific cost functions, with Thomas Pradeau.

Stochastic shortest paths and risk measures, with Axel Parmentier.

Self-service bike sharing systems: simulation, repositioning, pricing, with Daniel Chemla, Thomas Pradeau, Roberto Wolfler Calvo, and Houssame Yahiaoui. The website with the simulator, mentioned in this paper, is not maintained anymore.

Bounding the price of anarchy for games with player-specific cost functions, with Thomas Pradeau and Rachana Gupta.

A Zq-Fan theorem, presented at the "Topological combinatorics" workshop in Stockholm, Sweden, May 2006.

Popularization

Le problème du collier (in French), Images des Mathématiques, août 2016.

Véhicules partagés, des défis pour la RO (in French), Bulletin de la ROADEF, été 2014.

Parcours et coupes (in French), with Andras Sebő, chapter in a collective work on graphs (Publisher: Hermès), 2007.

Un algorithme qui compte en tirant au sort (in French), with Philippe Flajolet, short note presenting the HyperLogLog algorithm, 2007.

L'Énergie des Mers, Hors-Série Science & Vie, mars 2001.