The following pages link to Frédéric Meunier (Q405072):
Displaying 50 items.
- Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
- Hedetniemi's conjecture for Kneser hypergraphs (Q530765) (← links)
- The chromatic number of almost stable Kneser hypergraphs (Q543913) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Sperner labellings: A combinatorial approach (Q855840) (← links)
- Shared mobility systems (Q904286) (← links)
- Completely symmetric configurations for \(\sigma \)-games on grid graphs (Q976843) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- Shared mobility systems: an updated survey (Q1730532) (← links)
- Computing solutions of the multiclass network equilibrium problem with affine cost functions (Q1730728) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- LAD models, trees, and an analog of the fundamental theorem of arithmetic (Q1949097) (← links)
- Different versions of the nerve theorem and colourful simplices (Q2010622) (← links)
- \(O_n\) is an \(n\)-MCFL (Q2121469) (← links)
- Book review of: L. Lovász, Graphs and geometry (Q2143334) (← links)
- Envy-free division of multi-layered cakes (Q2152142) (← links)
- Design and operation for an electric taxi fleet (Q2260896) (← links)
- Greedy colorings for the binary paintshop problem (Q2266932) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- Minimizing the waiting time for a one-way shuttle service (Q2305017) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Carathéodory, Helly and the others in the max-plus world (Q2380785) (← links)
- Fair splitting of colored paths (Q2401427) (← links)
- Optimal linear estimator of origin-destination flows with redundant data (Q2430629) (← links)
- Simplotopal maps and necklace splitting (Q2439120) (← links)
- Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
- Envy-free two-player \(m\)-cake and three-player two-cake divisions (Q2450739) (← links)
- Combinatorial Stokes formulae (Q2462340) (← links)
- A combinatorial proof of a theorem of Freund (Q2474499) (← links)
- The uniqueness property for networks with several origin-destination pairs (Q2514826) (← links)
- A business dinner problem (Q2829345) (← links)
- A Further Generalization of the Colourful Carathéodory Theorem (Q2848999) (← links)
- A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem (Q2937771) (← links)
- (Q2959871) (← links)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- Discrete Splittings of the Necklace (Q3168988) (← links)
- The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications (Q4575830) (← links)
- Achieving Rental Harmony with a Secretive Roommate (Q4613457) (← links)
- A Combinatorial Approach to Colourful Simplicial Depth (Q4979841) (← links)
- Tverberg theorems over discrete sets of points (Q4998740) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications (Q5234532) (← links)
- (Q5240128) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Polytopal complexes: maps, chain complexes and… necklaces (Q5301004) (← links)
- A topological lower bound for the circular chromatic number of Schrijver graphs (Q5311915) (← links)
- Computing and proving with pivots (Q5397705) (← links)
- Colorings of complements of line graphs (Q6056781) (← links)
