3 citations · 5 across the 7 of their papers we have counts for
7 papers
Problems, proofs, and disproofs on the inversion number
Guillaume Aubian, Frédéric Havet, Florian Hörsch +4
The {\it inversion} of a set of vertices in a digraph consists in reversing the direction of all arcs of . The {\it inversion number} of an oriented grap…
Various bounds on the minimum number of arcs in a -dicritical digraph
Pierre Aboulker, Quentin Vermande
The dichromatic number of a digraph is the least integer such that can be partitioned into acyclic digraphs. A digraph is -dicritical if $\vecχ(G) = k…
Maximizing Nash Social Welfare in 2-Value Instances: Delineating Tractability
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer +6
We study the problem of allocating a set of indivisible goods among a set of agents with \emph{2-value additive valuations}. In this setting, each good is valued either or $p/q…
Automated Discovery of New -Function Relations
Hadrien Barral, Rémi Géraud-Stewart, Arthur Léonard +3
-functions typically encode interesting information about mathematical objects. This paper reports 29 identities between such functions that hitherto never appeared in the liter…
Maximizing Nash Social Welfare in 2-Value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer +6
We consider the problem of maximizing the Nash social welfare when allocating a set of indivisible goods to a set of agents. We study instances, in whic…
Nash Social Welfare for 2-value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn +2
This paper is merged with arXiv:2107.08965v2. We refer the reader to the full and updated version. We study the problem of allocating a set of indivisible goods among agents with 2…
Physarum-Inspired Multi-Commodity Flow Dynamics
Vincenzo Bonifaci, Enrico Facca, Frederic Folz +6
In wet-lab experiments, the slime mold Physarum polycephalum has demonstrated its ability to solve shortest path problems and to design efficient networks. For the shortest path pr…