Frédéric Meunier

From MaRDI portal
Revision as of 03:03, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:405072

Available identifiers

zbMath Open meunier.fredericWikidataQ102301886 ScholiaQ102301886MaRDI QIDQ405072

List of research outcomes





PublicationDate of PublicationType
Quasi-kernels in split graphs2025-01-06Paper
Colorings of complements of line graphs2023-10-04Paper
Tropical Complementarity Problems and Nash Equilibria2023-08-11Paper
On the continuity assumption of "Finite Adaptability in Multistage Linear Optimization by Bertsimas and Caramanis2023-05-09Paper
Algorithmic aspects of small quasi-kernels2023-05-05Paper
Envy-free division of multi-layered cakes2022-07-06Paper
Book review of: L. Lovász, Graphs and geometry2022-05-31Paper
\(O_n\) is an \(n\)-MCFL2022-04-04Paper
Linear lexicographic optimization and preferential bidding system2022-01-21Paper
Tverberg theorems over discrete sets of points2021-07-09Paper
Topological Bounds for Graph Representations over Any Field2021-02-15Paper
Minimizing the waiting time for a one-way shuttle service2020-03-10Paper
Perfect graphs with polynomially computable kernels2019-12-30Paper
Envy-free cake division without assuming the players prefer nonempty pieces2019-12-17Paper
Different versions of the nerve theorem and colourful simplices2019-11-27Paper
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg2019-10-30Paper
https://portal.mardi4nfdi.de/entity/Q52401282019-10-24Paper
Multilabeled Versions of Sperner's and Fan's Lemmas and Applications2019-09-27Paper
Shared mobility systems: an updated survey2019-03-06Paper
Computing solutions of the multiclass network equilibrium problem with affine cost functions2019-03-06Paper
Achieving Rental Harmony with a Secretive Roommate2019-02-01Paper
The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications2018-07-16Paper
Colorful linear programming, Nash equilibrium, and pivots2018-04-04Paper
Fair splitting of colored paths2017-09-08Paper
Strengthening topological colorful results for graphs2017-06-23Paper
Aircraft routing and crew pairing: updated algorithms at Air France2017-06-21Paper
https://portal.mardi4nfdi.de/entity/Q29598712017-02-10Paper
A business dinner problem2016-10-27Paper
Hedetniemi's conjecture for Kneser hypergraphs2016-08-01Paper
Shared mobility systems2016-01-13Paper
Design and operation for an electric taxi fleet2015-03-12Paper
The uniqueness property for networks with several origin-destination pairs2015-02-04Paper
A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem2015-01-12Paper
Colorful subhypergraphs in Kneser hypergraphs2014-09-04Paper
A Combinatorial Approach to Colourful Simplicial Depth2014-06-19Paper
A Combinatorial Approach to Colourful Simplicial Depth2014-06-11Paper
Envy-free two-player \(m\)-cake and three-player two-cake divisions2014-05-15Paper
Bike sharing systems: solving the static rebalancing problem2014-04-15Paper
Simplotopal maps and necklace splitting2014-03-07Paper
Computing and proving with pivots2014-02-24Paper
A Further Generalization of the Colourful Carathéodory Theorem2013-09-13Paper
Polytopal complexes: maps, chain complexes and… necklaces2013-06-28Paper
LAD models, trees, and an analog of the fundamental theorem of arithmetic2013-04-25Paper
Computing solutions of the paintshop-necklace problem2012-11-15Paper
Balancing the stations of a self service “bike hire” system2011-07-14Paper
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree2011-06-30Paper
The chromatic number of almost stable Kneser hypergraphs2011-06-17Paper
Discrete Splittings of the Necklace2011-04-27Paper
Optimal linear estimator of origin-destination flows with redundant data2011-04-08Paper
Completely symmetric configurations for \(\sigma \)-games on grid graphs2010-06-16Paper
Carathéodory, Helly and the others in the max-plus world2010-04-12Paper
Greedy colorings for the binary paintshop problem2010-02-26Paper
Paintshop, odd cycles and necklace splitting2009-06-30Paper
A combinatorial proof of a theorem of Freund2008-03-06Paper
Combinatorial Stokes formulae2007-11-30Paper
Sperner labellings: A combinatorial approach2006-12-07Paper
A topological lower bound for the circular chromatic number of Schrijver graphs2005-08-29Paper
Box complexes: at the crossroad of graph theory and topologyN/APaper
Quasi-kernels in split graphsN/APaper

Research outcomes over time

This page was built for person: Frédéric Meunier