default search action
Frédéric Meunier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Sebastien Deschamps, Frédéric Meunier:
Maximal workload, minimal workload, maximal workload difference: Optimizing all criteria at once. Oper. Res. Lett. 54: 107110 (2024) - [j44]Nour El Houda Tellache
, Frédéric Meunier
Linear Lexicographic Optimization and Preferential Bidding System. Transp. Sci. 58(3): 597-613 (2024) - [c12]Héloïse Gachet, Frédéric Meunier:
Balanced Assignments of Periodic Tasks. ATMOS 2024: 5:1-5:12 - [c11]Anton Medvedev, Safia Kedad-Sidhoum, Frédéric Meunier:
Two-Stage Adaptable Robust Optimization for Glass Production. ICORES 2024: 229-235 - [i21]Héloïse Gachet, Frédéric Meunier:
Balanced assignments of periodic tasks. CoRR abs/2407.05485 (2024) - 2023
- [j43]Xavier Allamigeon, Stéphane Gaubert
Tropical Complementarity Problems and Nash Equilibria. SIAM J. Discret. Math. 37(3): 1645-1665 (2023) - [i20]Sebastien Deschamps, Frédéric Meunier:
Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once. CoRR abs/2305.11036 (2023) - [i19]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Quasi-kernels in split graphs. CoRR abs/2312.15519 (2023) - 2022
- [j42]Antoine Deza, Frédéric Meunier, Tal Raviv:
Preface: Optimization and Discrete Geometry. Discret. Optim. 44(Part): 100658 (2022) - [j41]Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
On is an n-MCFL. J. Comput. Syst. Sci. 127: 41-52 (2022) - [c10]Hélène Langlois
Algorithmic Aspects of Small Quasi-Kernels. WG 2022: 370-382 - 2021
- [j40]Hamid Reza Daneshpajouh
Colorings of complements of line graphs. J. Graph Theory 98(2): 216-233 (2021) - [j39]Meysam Alishahi, Frédéric Meunier:
Topological Bounds for Graph Representations over Any Field. SIAM J. Discret. Math. 35(1): 91-104 (2021) - [c9]Ayumi Igarashi, Frédéric Meunier:
Envy-free Division of Multi-layered Cakes. WINE 2021: 504-521 - [i18]Ayumi Igarashi, Frédéric Meunier:
Envy-free division of multi-layered cakes. CoRR abs/2106.02262 (2021) - [i17]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic aspects of quasi-kernels. CoRR abs/2107.03793 (2021) - 2020
- [j38]Adèle Pass-Lanneau, Ayumi Igarashi, Frédéric Meunier:
Perfect graphs with polynomially computable kernels. Discret. Appl. Math. 272: 69-74 (2020) - [j37]Frédéric Meunier, Luis Montejano:
Different versions of the nerve theorem and colourful simplices. J. Comb. Theory A 169 (2020) - [j36]Laurent Daudet, Frédéric Meunier:
Minimizing the waiting time for a one-way shuttle service. J. Sched. 23(1): 95-115 (2020) - [i16]Hamid Reza Daneshpajouh, Frédéric Meunier, Guilhem Mizrahi:
Colorings of complements of line graphs. CoRR abs/2003.08255 (2020) - [i15]Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati:
On is an n-MCFL. CoRR abs/2012.12100 (2020)
2010 – 2019
- 2019
- [j35]Frédéric Meunier, Thomas Pradeau:
Computing solutions of the multiclass network equilibrium problem with affine cost functions. Ann. Oper. Res. 274(1-2): 447-469 (2019) - [j34]Frédéric Meunier, Francis Edward Su:
Multilabeled Versions of Sperner's and Fan's Lemmas and Applications. SIAM J. Appl. Algebra Geom. 3(3): 391-411 (2019) - [j33]Florian Frick, Kelsey Houston-Edwards, Frédéric Meunier:
Achieving Rental Harmony with a Secretive Roommate. Am. Math. Mon. 126(1): 18-32 (2019) - 2018
- [j32]Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
Shared mobility systems: an updated survey. Ann. Oper. Res. 271(1): 105-126 (2018) - [j31]Antoine Deza, Frédéric Meunier:
Preface: Linear optimization. Discret. Appl. Math. 240: 1-2 (2018) - [j30]Frédéric Meunier, Pauline Sarrabezolles:
Colorful linear programming, Nash equilibrium, and pivots. Discret. Appl. Math. 240: 78-91 (2018) - [j29]Marco Casazza
The multiple vehicle balancing problem. Networks 72(3): 337-357 (2018) - [c8]Etienne de Saint Germai, Vincent Leclère, Frédéric Meunier:
A Stochastic Multi-item Lot-sizing Problem with Bounded Number of Setups. ICORES 2018: 106-114 - [i14]Frédéric Meunier, Francis Edward Su:
Multilabeled versions of Sperner's and Fan's lemmas and applications. CoRR abs/1801.02044 (2018) - [i13]Adèle Pass-Lanneau, Ayumi Igarashi, Frédéric Meunier:
Perfect graphs with polynomially computable kernels. CoRR abs/1801.02253 (2018) - [i12]Jesús A. De Loera, Thomas A. Hogan, Frédéric Meunier, Nabil H. Mustafa:
Integer and Mixed Integer Tverberg Numbers. CoRR abs/1803.01816 (2018) - [i11]Frédéric Meunier, Shira Zerbib:
Envy-free divisions of a partially burnt cake. CoRR abs/1804.00449 (2018) - 2017
- [j28]Meysam Alishahi, Frédéric Meunier:
Fair Splitting of Colored Paths. Electron. J. Comb. 24(3): 3 (2017) - [j27]Meysam Alishahi
Strengthening topological colorful results for graphs. Eur. J. Comb. 64: 27-44 (2017) - [c7]Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, Yannik Stein:
The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications. SODA 2017: 1342-1351 - [i10]Jesús A. De Loera, Xavier Goaoc, Frédéric Meunier, Nabil H. Mustafa:
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. CoRR abs/1706.05975 (2017) - 2016
- [j26]Hossein Hajiabolhassan
Hedetniemi's conjecture for Kneser hypergraphs. J. Comb. Theory A 143: 42-55 (2016) - [i9]Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, Yannik Stein:
The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications. CoRR abs/1608.01921 (2016) - 2015
- [j25]Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
Shared mobility systems. 4OR 13(4): 341-360 (2015) - [j24]Bernat Gacias, Frédéric Meunier:
Design and operation for an electric taxi fleet. OR Spectr. 37(1): 171-194 (2015) - 2014
- [j23]Frédéric Meunier:
Colorful Subhypergraphs in Kneser Hypergraphs. Electron. J. Comb. 21(1): 1 (2014) - [j22]Frédéric Meunier:
Simplotopal maps and necklace splitting. Discret. Math. 323: 14-26 (2014) - [j21]Frédéric Meunier, Thomas Pradeau:
The uniqueness property for networks with several origin-destination pairs. Eur. J. Oper. Res. 237(1): 245-256 (2014) - [j20]Antoine Deza, Frédéric Meunier, Pauline Sarrabezolles:
A Combinatorial Approach to Colourful Simplicial Depth. SIAM J. Discret. Math. 28(1): 306-322 (2014) - [c6]Vianney Boeuf, Frédéric Meunier:
Online Train Shunting. ATMOS 2014: 34-45 - [i8]Axel Parmentier, Frédéric Meunier:
Stochastic Shortest Paths and Risk Measures. CoRR abs/1408.0272 (2014) - [i7]Frédéric Meunier, Pauline Sarrabezolles:
Colorful linear programming, Nash equilibrium, and pivots. CoRR abs/1409.3436 (2014) - [i6]Frédéric Meunier, Thomas Pradeau:
Computing solutions of the multiclass network equilibrium problem with affine cost functions. CoRR abs/1412.6496 (2014) - 2013
- [j19]Nadia Brauner
LAD models, trees, and an analog of the fundamental theorem of arithmetic. Discret. Appl. Math. 161(7-8): 909-920 (2013) - [j18]Daniel Chemla, Frédéric Meunier, Roberto Wolfler Calvo
Bike sharing systems: Solving the static rebalancing problem. Discret. Optim. 10(2): 120-146 (2013) - [j17]Nicolas Lebert, Frédéric Meunier, Quentin Carbonneaux:
Envy-free two-player mm-cake and three-player two-cake divisions. Oper. Res. Lett. 41(6): 607-610 (2013) - [j16]Frédéric Meunier:
Computing and proving with pivots. RAIRO Oper. Res. 47(4): 331-360 (2013) - [c5]Frédéric Meunier, Thomas Pradeau:
A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem. WINE 2013: 363-376 - 2012
- [j15]Frédéric Meunier, Bertrand Neveu:
Computing solutions of the paintshop-necklace problem. Comput. Oper. Res. 39(11): 2666-2678 (2012) - [i5]Frédéric Meunier, Thomas Pradeau:
Uniqueness of equilibrium on rings. CoRR abs/1206.5120 (2012) - [i4]Antoine Deza, Frédéric Meunier, Pauline Sarrabezolles:
A combinatorial approach to colourful simplicial depth. CoRR abs/1212.4720 (2012) - 2011
- [j14]Olivier Durand de Gevigney, Frédéric Meunier, Christian Popa, Julien Reygner
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree. 4OR 9(2): 175-188 (2011) - [j13]Frédéric Meunier:
The chromatic number of almost stable Kneser hypergraphs. J. Comb. Theory A 118(6): 1820-1828 (2011) - [j12]Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Fabien Laroche
Balancing the stations of a self service "bike hire" system. RAIRO Oper. Res. 45(1): 37-61 (2011) - [c4]Laurence Danlos, Frédéric Meunier, Vanessa Combet:
EasyText: an Operational NLG System. ENLG 2011: 139-144 - [c3]Frédéric Meunier, Laurence Danlos, Vanessa Combet:
EASYTEXT : un système opérationnel de génération de textes (EASYTEXT: an operational system for text generation). TALN (Demonstrations) 2011: 17 - [i3]Frédéric Meunier, Antoine Deza:
A further generalization of the colourful Carathéodory theorem. CoRR abs/1107.3380 (2011) - 2010
- [j11]Frédéric Meunier:
Optimal linear estimator of origin-destination flows with redundant data. Ann. Oper. Res. 181(1): 709-722 (2010) - [j10]Stéphane Gaubert, Frédéric Meunier:
Carathéodory, Helly and the Others in the Max-Plus World. Discret. Comput. Geom. 43(3): 648-662 (2010) - [j9]Hadis Amini, Frédéric Meunier, Héloïse Michel, Atefeh Mohajeri:
Greedy colorings for the binary paintshop problem. J. Discrete Algorithms 8(1): 8-14 (2010) - [j8]Frédéric Meunier, Nicolas Wagner:
Equilibrium Results for Dynamic Congestion Games. Transp. Sci. 44(4): 524-536 (2010) - [c2]Frédéric Meunier, Gaëlle Recourcé, Sylvain Surcin:
A bird's eye view on your e-mails: Kwaga mail annotator. RIAO 2010: 206-207
2000 – 2009
- 2009
- [j7]Frédéric Meunier, András Sebö:
Paintshop, odd cycles and necklace splitting. Discret. Appl. Math. 157(4): 780-793 (2009) - [i2]Olivier Durand de Gevigney, Frédéric Meunier, Christian Popa, Julien Reygner, Ayrin Romero:
Directed paths on a tree: coloring, multicut and kernel. CoRR abs/0902.1182 (2009) - 2008
- [j6]Frédéric Meunier:
Combinatorial Stokes formulae. Eur. J. Comb. 29(1): 286-297 (2008) - [j5]Frédéric Meunier:
Polytopal complexes: maps, chain complexes and... necklaces. Electron. Notes Discret. Math. 31: 183-188 (2008) - [j4]Frédéric Meunier:
A combinatorial proof of a theorem of Freund. J. Comb. Theory A 115(2): 317-325 (2008) - [j3]Frédéric Meunier:
Discrete Splittings of the Necklace. Math. Oper. Res. 33(3): 678-688 (2008) - [i1]Frédéric Meunier, Nicolas Wagner:
Dynamic assignment: there is an equilibrium ! CoRR abs/0810.2486 (2008) - 2006
- [j2]Frédéric Meunier:
Sperner labellings: A combinatorial approach. J. Comb. Theory A 113(7): 1462-1475 (2006) - 2005
- [j1]Frédéric Meunier:
A topological lower bound for the circular chromatic number of Schrijver graphs. J. Graph Theory 49(4): 257-261 (2005)
1990 – 1999
- 1998
- [c1]Frédéric Meunier, Laurence Danlos:
System Demonstration Flaubert: An User Friendly System For Multilingual Text Generation. INLG 1998
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: