Frédéric Meunier

Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023

Tropical Complementarity Problems and Nash Equilibria.

[BibT_eX]

[DOI]

Xavier Allamigeon

Stéphane Gaubert

SIAM J. Discret. Math., September, 2023

Quasi-kernels in split graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once.

[BibT_eX]

[DOI]

Sébastien Dechamps

CoRR, 2023

2022

On is an n-MCFL.

[BibT_eX]

[DOI]

Kilian Gebhardt

Sylvain Salvati

J. Comput. Syst. Sci., 2022

Preface: Optimization and Discrete Geometry.

[BibT_eX]

[DOI]

Tal Raviv

Discret. Optim., 2022

Algorithmic Aspects of Small Quasi-Kernels.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021

Topological Bounds for Graph Representations over Any Field.

[BibT_eX]

[DOI]

Meysam Alishahi

SIAM J. Discret. Math., 2021

Colorings of complements of line graphs.

[BibT_eX]

[DOI]

Hamid Reza Daneshpajouh

Guilhem Mizrahi

J. Graph Theory, 2021

Algorithmic aspects of quasi-kernels.

[BibT_eX]

[DOI]

CoRR, 2021

Envy-free Division of Multi-layered Cakes.

[BibT_eX]

[DOI]

Ayumi Igarashi

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2020

Minimizing the waiting time for a one-way shuttle service.

[BibT_eX]

[DOI]

Laurent Daudet

J. Sched., 2020

Different versions of the nerve theorem and colourful simplices.

[BibT_eX]

[DOI]

Luis Montejano

J. Comb. Theory, Ser. A, 2020

Perfect graphs with polynomially computable kernels.

[BibT_eX]

[DOI]

Adèle Pass-Lanneau

Ayumi Igarashi

Discret. Appl. Math., 2020

On is an n-MCFL.

[BibT_eX]

[DOI]

Kilian Gebhardt

Sylvain Salvati

CoRR, 2020

2019

Achieving Rental Harmony with a Secretive Roommate.

[BibT_eX]

[DOI]

Florian Frick

Kelsey Houston-Edwards

Am. Math. Mon., 2019

Multilabeled Versions of Sperner's and Fan's Lemmas and Applications.

[BibT_eX]

[DOI]

Francis Edward Su

SIAM J. Appl. Algebra Geom., 2019

Computing solutions of the multiclass network equilibrium problem with affine cost functions.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

2018

The multiple vehicle balancing problem.

[BibT_eX]

[DOI]

Networks, 2018

Colorful linear programming, Nash equilibrium, and pivots.

[BibT_eX]

[DOI]

Pauline Sarrabezolles

Discret. Appl. Math., 2018

Preface: Linear optimization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Envy-free divisions of a partially burnt cake.

[BibT_eX]

[DOI]

Shira Zerbib

CoRR, 2018

Integer and Mixed Integer Tverberg Numbers.

[BibT_eX]

[DOI]

CoRR, 2018

Shared mobility systems: an updated survey.

[BibT_eX]

[DOI]

Gilbert Laporte

Ann. Oper. Res., 2018

A Stochastic Multi-item Lot-sizing Problem with Bounded Number of Setups.

[BibT_eX]

[DOI]

Etienne de Saint Germai

Vincent Leclère

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

2017

Strengthening topological colorful results for graphs.

[BibT_eX]

[DOI]

Meysam Alishahi

Hossein Hajiabolhassan

Eur. J. Comb., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Fair Splitting of Colored Paths.

[BibT_eX]

[DOI]

Meysam Alishahi

Electron. J. Comb., 2017

The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Pauline Sarrabezolles

Yannik Stein

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Hedetniemi's conjecture for Kneser hypergraphs.

[BibT_eX]

[DOI]

Hossein Hajiabolhassan

J. Comb. Theory, Ser. A, 2016

2015

Design and operation for an electric taxi fleet.

[BibT_eX]

[DOI]

Bernat Gacias

OR Spectr., 2015

Shared mobility systems.

[BibT_eX]

[DOI]

Gilbert Laporte

4OR, 2015

2014

A Combinatorial Approach to Colourful Simplicial Depth.

[BibT_eX]

[DOI]

Pauline Sarrabezolles

SIAM J. Discret. Math., 2014

The uniqueness property for networks with several origin-destination pairs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Simplotopal maps and necklace splitting.

[BibT_eX]

[DOI]

Discret. Math., 2014

Stochastic Shortest Paths and Risk Measures.

[BibT_eX]

[DOI]

Axel Parmentier

CoRR, 2014

Colorful Subhypergraphs in Kneser Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Online Train Shunting.

[BibT_eX]

[DOI]

Vianney Boeuf

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013

Computing and proving with pivots.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2013

Envy-free two-player mm-cake and three-player two-cake divisions.

[BibT_eX]

[DOI]

Nicolas Lebert

Quentin Carbonneaux

Oper. Res. Lett., 2013

Bike sharing systems: Solving the static rebalancing problem.

[BibT_eX]

[DOI]

Daniel Chemla

Discret. Optim., 2013

LAD models, trees, and an analog of the fundamental theorem of arithmetic.

[BibT_eX]

[DOI]

Nadia Brauner

Sylvain Gravier

Louis-Philippe Kronek

Discret. Appl. Math., 2013

A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

Uniqueness of equilibrium on rings

[BibT_eX]

[DOI]

CoRR, 2012

Computing solutions of the paintshop-necklace problem.

[BibT_eX]

[DOI]

Bertrand Neveu

Comput. Oper. Res., 2012

2011

Balancing the stations of a self service "bike hire" system.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2011

The chromatic number of almost stable Kneser hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2011

A further generalization of the colourful Carathéodory theorem

[BibT_eX]

[DOI]

Olivier Durand de Gevigney

CoRR, 2011

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

[BibT_eX]

[DOI]

4OR, 2011

EASYTEXT : un système opérationnel de génération de textes (EASYTEXT: an operational system for text generation).

[BibT_eX]

[DOI]

Laurence Danlos

Vanessa Combet

Proceedings of the Actes de la 18e conférence sur le Traitement Automatique des Langues Naturelles. Démonstrations, 2011

EasyText: an Operational NLG System.

[BibT_eX]

[DOI]

Laurence Danlos

Vanessa Combet

Proceedings of the ENLG 2011, 2011

2010

Equilibrium Results for Dynamic Congestion Games.

[BibT_eX]

[DOI]

Nicolas Wagner

Transp. Sci., 2010

Greedy colorings for the binary paintshop problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Carathéodory, Helly and the Others in the Max-Plus World.

[BibT_eX]

[DOI]

Stéphane Gaubert

Discret. Comput. Geom., 2010

Optimal linear estimator of origin-destination flows with redundant data.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2010

A bird's eye view on your e-mails: Kwaga mail annotator.

[BibT_eX]

[DOI]

Gaëlle Recourcé

Sylvain Surcin

Proceedings of the Recherche d'Information Assistée par Ordinateur, 2010

2009

Paintshop, odd cycles and necklace splitting.

[BibT_eX]

[DOI]

Olivier Durand de Gevigney

András Sebö

Discret. Appl. Math., 2009

Directed paths on a tree: coloring, multicut and kernel

[BibT_eX]

[DOI]

CoRR, 2009

2008

Discrete Splittings of the Necklace.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

A combinatorial proof of a theorem of Freund.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2008

Polytopal complexes: maps, chain complexes and... necklaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Combinatorial Stokes formulae.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Dynamic assignment: there is an equilibrium !

[BibT_eX]

[DOI]

Nicolas Wagner

CoRR, 2008

2006

Sperner labellings: A combinatorial approach.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2006

2005

A topological lower bound for the circular chromatic number of Schrijver graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

1998

System Demonstration Flaubert: An User Friendly System For Multilingual Text Generation.

[BibT_eX]

[DOI]