21 citations · 64 across the 25 of their papers we have counts for
36 papers
Quadratic Degree Sequence Optimization and the Critical Roots of a Graph
Frédéric Meunier, Shmuel Onn
The degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum over all vertices of a given function evaluated at the subgraph degree of th…
Box complexes: at the crossroad of graph theory and topology
Hamid Reza Daneshpajouh, Frédéric Meunier
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bou…
Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once
Sébastien Dechamps, Frédéric Meunier
In a simple model of assigning workers to tasks, every solution that minimizes the load difference between the most loaded worker and the least loaded one actually minimizes the ma…
Finite adaptability in two-stage robust optimization: asymptotic optimality and tractability
Safia Kedad-Sidhoum, Anton Medvedev, Frédéric Meunier
Two-stage robust optimization is a fundamental paradigm for modeling and solving optimization problems with uncertain parameters. A now classical method within this paradigm is fin…
Algorithmic aspects of quasi-kernels
Hélène Langlois, Frédéric Meunier, Romeo Rizzi +1
In a digraph, a quasi-kernel is a subset of vertices that is independent and such that every vertex can reach some vertex in that set via a directed path of length at most two. Whe…
Envy-free division of multi-layered cakes
Ayumi Igarashi, Frédéric Meunier
We study the problem of dividing a multi-layered cake under non-overlapping constraints. This problem, recently proposed by Hosseini et al. (IJCAI, 2020), captures several natural…