System Demonstration Flaubert: An User Friendly System For Multilingual Text Generation. - Frédéric Meunier; Laurence Danlos (INLG, 1998)

A topological lower bound for the circular chromatic number of Schrijver graphs. - Frédéric Meunier (J. Graph Theory, 2005)

Sperner labellings: A combinatorial approach. - Frédéric Meunier (J. Comb. Theory A, 2006)

Dynamic assignment: there is an equilibrium ! - Frédéric Meunier; Nicolas Wagner 004 (CoRR, 2008)

Combinatorial Stokes formulae. - Frédéric Meunier (Eur. J. Comb., 2008)

Polytopal complexes: maps, chain complexes and... necklaces. - Frédéric Meunier (Electron. Notes Discret. Math., 2008)

A combinatorial proof of a theorem of Freund. - Frédéric Meunier (J. Comb. Theory A, 2008)

Discrete Splittings of the Necklace. - Frédéric Meunier (Math. Oper. Res., 2008)

Directed paths on a tree: coloring, multicut and kernel - Olivier Durand de Gevigney; Frédéric Meunier; Christian Popa; Julien Reygner; Ayrin Romero (CoRR, 2009)

Paintshop, odd cycles and necklace splitting. - Frédéric Meunier; András Sebö (Discret. Appl. Math., 2009)

A bird's eye view on your e-mails: Kwaga mail annotator. - Frédéric Meunier; Gaëlle Recourcé; Sylvain Surcin (RIAO, 2010)

Optimal linear estimator of origin-destination flows with redundant data. - Frédéric Meunier (Ann. Oper. Res., 2010)

Carathéodory, Helly and the Others in the Max-Plus World. - Stéphane Gaubert; Frédéric Meunier (Discret. Comput. Geom., 2010)

Greedy colorings for the binary paintshop problem. - Hadis Amini; Frédéric Meunier; Héloïse Michel; Atefeh Mohajeri (J. Discrete Algorithms, 2010)

Equilibrium Results for Dynamic Congestion Games. - Frédéric Meunier; Nicolas Wagner 004 (Transp. Sci., 2010)

EasyText: an Operational NLG System. - Laurence Danlos; Frédéric Meunier; Vanessa Combet (ENLG, 2011)

EASYTEXT : un système opérationnel de génération de textes (EASYTEXT: an operational system for text generation). - Frédéric Meunier; Laurence Danlos; Vanessa Combet (TALN (Demonstrations), 2011)

Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree. - Olivier Durand de Gevigney; Frédéric Meunier; Christian Popa; Julien Reygner; Ayrin Romero (4OR, 2011)

A further generalization of the colourful Carathéodory theorem - Frédéric Meunier; Antoine Deza (CoRR, 2011)

The chromatic number of almost stable Kneser hypergraphs. - Frédéric Meunier (J. Comb. Theory A, 2011)

Balancing the stations of a self service "bike hire" system. - Mike Benchimol; Pascal Benchimol; Benoît Chappert; Arnaud de la Taille; Fabien Laroche; Frédéric Meunier; Ludovic Robinet (RAIRO Oper. Res., 2011)

Computing solutions of the paintshop-necklace problem. - Frédéric Meunier; Bertrand Neveu (Comput. Oper. Res., 2012)

Uniqueness of equilibrium on rings - Frédéric Meunier; Thomas Pradeau (CoRR, 2012)

A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem. - Frédéric Meunier; Thomas Pradeau (WINE, 2013)

LAD models, trees, and an analog of the fundamental theorem of arithmetic. - Nadia Brauner; Sylvain Gravier; Louis-Philippe Kronek; Frédéric Meunier (Discret. Appl. Math., 2013)

Bike sharing systems: Solving the static rebalancing problem. - Daniel Chemla; Frédéric Meunier; Roberto Wolfler Calvo (Discret. Optim., 2013)

Envy-free two-player mm-cake and three-player two-cake divisions. - Nicolas Lebert; Frédéric Meunier; Quentin Carbonneaux (Oper. Res. Lett., 2013)

Computing and proving with pivots. - Frédéric Meunier (RAIRO Oper. Res., 2013)

Online Train Shunting. - Vianney Boeuf; Frédéric Meunier (ATMOS, 2014)

Colorful Subhypergraphs in Kneser Hypergraphs. - Frédéric Meunier (Electron. J. Comb., 2014)

Stochastic Shortest Paths and Risk Measures. - Axel Parmentier; Frédéric Meunier (CoRR, 2014)

Simplotopal maps and necklace splitting. - Frédéric Meunier (Discret. Math., 2014)

The uniqueness property for networks with several origin-destination pairs. - Frédéric Meunier; Thomas Pradeau (Eur. J. Oper. Res., 2014)

A Combinatorial Approach to Colourful Simplicial Depth. - Antoine Deza; Frédéric Meunier; Pauline Sarrabezolles (SIAM J. Discret. Math., 2014)

Shared mobility systems. - Gilbert Laporte; Frédéric Meunier; Roberto Wolfler Calvo (4OR, 2015)

Design and operation for an electric taxi fleet. - Bernat Gacias; Frédéric Meunier (OR Spectr., 2015)

Hedetniemi's conjecture for Kneser hypergraphs. - Hossein Hajiabolhassan; Frédéric Meunier (J. Comb. Theory A, 2016)

The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications. - Frédéric Meunier; Wolfgang Mulzer; Pauline Sarrabezolles; Yannik Stein (SODA, 2017)

Fair Splitting of Colored Paths. - Meysam Alishahi; Frédéric Meunier (Electron. J. Comb., 2017)

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. - Jesús A. De Loera; Xavier Goaoc; Frédéric Meunier; Nabil H. Mustafa (CoRR, 2017)

Strengthening topological colorful results for graphs. - Meysam Alishahi; Hossein Hajiabolhassan; Frédéric Meunier (Eur. J. Comb., 2017)

A Stochastic Multi-item Lot-sizing Problem with Bounded Number of Setups. - Etienne de Saint Germai; Vincent Leclère; Frédéric Meunier (ICORES, 2018)

Shared mobility systems: an updated survey. - Gilbert Laporte; Frédéric Meunier; Roberto Wolfler Calvo (Ann. Oper. Res., 2018)

Integer and Mixed Integer Tverberg Numbers. - Jesús A. De Loera; Thomas A. Hogan; Frédéric Meunier; Nabil H. Mustafa (CoRR, 2018)

Envy-free divisions of a partially burnt cake. - Frédéric Meunier; Shira Zerbib (CoRR, 2018)

Preface: Linear optimization. - Antoine Deza; Frédéric Meunier (Discret. Appl. Math., 2018)

Colorful linear programming, Nash equilibrium, and pivots. - Frédéric Meunier; Pauline Sarrabezolles (Discret. Appl. Math., 2018)

The multiple vehicle balancing problem. - Marco Casazza; Alberto Ceselli; Daniel Chemla; Frédéric Meunier; Roberto Wolfler Calvo (Networks, 2018)

Computing solutions of the multiclass network equilibrium problem with affine cost functions. - Frédéric Meunier; Thomas Pradeau (Ann. Oper. Res., 2019)

Multilabeled Versions of Sperner's and Fan's Lemmas and Applications. - Frédéric Meunier; Francis Edward Su (SIAM J. Appl. Algebra Geom., 2019)

Achieving Rental Harmony with a Secretive Roommate. - Florian Frick; Kelsey Houston-Edwards; Frédéric Meunier (Am. Math. Mon., 2019)

On is an n-MCFL. - Kilian Gebhardt; Frédéric Meunier; Sylvain Salvati (CoRR, 2020)

Perfect graphs with polynomially computable kernels. - Adèle Pass-Lanneau; Ayumi Igarashi 001; Frédéric Meunier (Discret. Appl. Math., 2020)

Different versions of the nerve theorem and colourful simplices. - Frédéric Meunier; Luis Montejano 001 (J. Comb. Theory A, 2020)

Minimizing the waiting time for a one-way shuttle service. - Laurent Daudet; Frédéric Meunier (J. Sched., 2020)

Envy-free Division of Multi-layered Cakes. - Ayumi Igarashi 001; Frédéric Meunier (WINE, 2021)

Algorithmic aspects of quasi-kernels. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette (CoRR, 2021)

Colorings of complements of line graphs. - Hamid Reza Daneshpajouh; Frédéric Meunier; Guilhem Mizrahi (J. Graph Theory, 2021)

Topological Bounds for Graph Representations over Any Field. - Meysam Alishahi; Frédéric Meunier (SIAM J. Discret. Math., 2021)

Algorithmic Aspects of Small Quasi-Kernels. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette (WG, 2022)

Preface: Optimization and Discrete Geometry. - Antoine Deza; Frédéric Meunier; Tal Raviv (Discret. Optim., 2022)

On is an n-MCFL. - Kilian Gebhardt; Frédéric Meunier; Sylvain Salvati (J. Comput. Syst. Sci., 2022)

Quasi-kernels in split graphs. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette (CoRR, 2023)

Tropical Complementarity Problems and Nash Equilibria. - Xavier Allamigeon; Stéphane Gaubert; Frédéric Meunier (SIAM J. Discret. Math., 2023)

Balanced Assignments of Periodic Tasks. - Héloïse Gachet; Frédéric Meunier (ATMOS, 2024)

Two-Stage Adaptable Robust Optimization for Glass Production. - Anton Medvedev; Safia Kedad-Sidhoum; Frédéric Meunier (ICORES, 2024)

Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once. - Sebastien Deschamps; Frédéric Meunier (Oper. Res. Lett., 2024)

Linear Lexicographic Optimization and Preferential Bidding System. - Nour El Houda Tellache; Frédéric Meunier; Axel Parmentier (Transp. Sci., 2024)

Quasi-kernels in split graphs. - Hélène Langlois; Frédéric Meunier; Romeo Rizzi; Stéphane Vialette; Yacong Zhou (Discret. Appl. Math., 2025)

Box complexes: At the crossroad of graph theory and topology. - Hamid Reza Daneshpajouh; Frédéric Meunier (Discret. Math., 2025)

Revisiting classical results on kernels in digraphs. - Hélène Langlois; Frédéric Meunier (CoRR, 2025)

Fair and efficient allocation of indivisible items under category constraints. - Ayumi Igarashi 001; Frédéric Meunier (CoRR, 2025)

Aircraft routing: periodicity and complexity. - Frédéric Meunier; Axel Parmentier; Nour El Houda Tellache (CoRR, 2025)