Frédéric Meunier

Orcid: 0000-0002-5331-2863

According to our database1, Frédéric Meunier authored at least 68 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Linear Lexicographic Optimization and Preferential Bidding System.
Transp. Sci., 2024

Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once.
Oper. Res. Lett., 2024

Two-Stage Adaptable Robust Optimization for Glass Production.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

Balanced Assignments of Periodic Tasks.
Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

2023
Tropical Complementarity Problems and Nash Equilibria.
SIAM J. Discret. Math., September, 2023

Quasi-kernels in split graphs.
CoRR, 2023

2022
<i>O</i><sub><i>n</i></sub> is an <i>n</i>-MCFL.
J. Comput. Syst. Sci., 2022

Preface: Optimization and Discrete Geometry.
Discret. Optim., 2022

Algorithmic Aspects of Small Quasi-Kernels.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021
Topological Bounds for Graph Representations over Any Field.
SIAM J. Discret. Math., 2021

Colorings of complements of line graphs.
J. Graph Theory, 2021

Algorithmic aspects of quasi-kernels.
CoRR, 2021

Envy-free Division of Multi-layered Cakes.
Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020
Minimizing the waiting time for a one-way shuttle service.
J. Sched., 2020

Different versions of the nerve theorem and colourful simplices.
J. Comb. Theory A, 2020

Perfect graphs with polynomially computable kernels.
Discret. Appl. Math., 2020

O<sub>n</sub> is an n-MCFL.
CoRR, 2020

2019
Achieving Rental Harmony with a Secretive Roommate.
Am. Math. Mon., 2019

Multilabeled Versions of Sperner's and Fan's Lemmas and Applications.
SIAM J. Appl. Algebra Geom., 2019

Computing solutions of the multiclass network equilibrium problem with affine cost functions.
Ann. Oper. Res., 2019

2018
The multiple vehicle balancing problem.
Networks, 2018

Colorful linear programming, Nash equilibrium, and pivots.
Discret. Appl. Math., 2018

Preface: Linear optimization.
Discret. Appl. Math., 2018

Envy-free divisions of a partially burnt cake.
CoRR, 2018

Integer and Mixed Integer Tverberg Numbers.
CoRR, 2018

Shared mobility systems: an updated survey.
Ann. Oper. Res., 2018

A Stochastic Multi-item Lot-sizing Problem with Bounded Number of Setups.
Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

2017
Strengthening topological colorful results for graphs.
Eur. J. Comb., 2017

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg.
CoRR, 2017

Fair Splitting of Colored Paths.
Electron. J. Comb., 2017

The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Hedetniemi's conjecture for Kneser hypergraphs.
J. Comb. Theory A, 2016

2015
Design and operation for an electric taxi fleet.
OR Spectr., 2015

Shared mobility systems.
4OR, 2015

2014
A Combinatorial Approach to Colourful Simplicial Depth.
SIAM J. Discret. Math., 2014

The uniqueness property for networks with several origin-destination pairs.
Eur. J. Oper. Res., 2014

Simplotopal maps and necklace splitting.
Discret. Math., 2014

Stochastic Shortest Paths and Risk Measures.
CoRR, 2014

Colorful Subhypergraphs in Kneser Hypergraphs.
Electron. J. Comb., 2014

Online Train Shunting.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013
Computing and proving with pivots.
RAIRO Oper. Res., 2013

Envy-free two-player <i>m</i>m-cake and three-player two-cake divisions.
Oper. Res. Lett., 2013

Bike sharing systems: Solving the static rebalancing problem.
Discret. Optim., 2013

LAD models, trees, and an analog of the fundamental theorem of arithmetic.
Discret. Appl. Math., 2013

A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012
Uniqueness of equilibrium on rings
CoRR, 2012

Computing solutions of the paintshop-necklace problem.
Comput. Oper. Res., 2012

2011
Balancing the stations of a self service "bike hire" system.
RAIRO Oper. Res., 2011

The chromatic number of almost stable Kneser hypergraphs.
J. Comb. Theory A, 2011

A further generalization of the colourful Carathéodory theorem
CoRR, 2011

Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree.
4OR, 2011

EASYTEXT : un système opérationnel de génération de textes (EASYTEXT: an operational system for text generation).
Proceedings of the Actes de la 18e conférence sur le Traitement Automatique des Langues Naturelles. Démonstrations, 2011

EasyText: an Operational NLG System.
Proceedings of the ENLG 2011, 2011

2010
Equilibrium Results for Dynamic Congestion Games.
Transp. Sci., 2010

Greedy colorings for the binary paintshop problem.
J. Discrete Algorithms, 2010

Carathéodory, Helly and the Others in the Max-Plus World.
Discret. Comput. Geom., 2010

Optimal linear estimator of origin-destination flows with redundant data.
Ann. Oper. Res., 2010

A bird's eye view on your e-mails: Kwaga mail annotator.
Proceedings of the Recherche d'Information Assistée par Ordinateur, 2010

2009
Paintshop, odd cycles and necklace splitting.
Discret. Appl. Math., 2009

Directed paths on a tree: coloring, multicut and kernel
CoRR, 2009

2008
Discrete Splittings of the Necklace.
Math. Oper. Res., 2008

A combinatorial proof of a theorem of Freund.
J. Comb. Theory A, 2008

Polytopal complexes: maps, chain complexes and... necklaces.
Electron. Notes Discret. Math., 2008

Combinatorial Stokes formulae.
Eur. J. Comb., 2008

Dynamic assignment: there is an equilibrium !
CoRR, 2008

2006
Sperner labellings: A combinatorial approach.
J. Comb. Theory A, 2006

2005
A topological lower bound for the circular chromatic number of Schrijver graphs.
J. Graph Theory, 2005

1998
System Demonstration Flaubert: An User Friendly System For Multilingual Text Generation.
Proceedings of the Ninth International Workshop on Natural Language Generation, 1998


  Loading...