65 citations · 259 across the 46 of their papers we have counts for
57 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…
Circuit and Graver Walks and Linear and Integer Programming
Shmuel Onn
We show that a circuit walk from a given feasible point of a given linear program to an optimal point can be computed in polynomial time using only linear algebra operations and th…
Degree Sequence Optimization and Extremal Degree Enumerators
Shmuel Onn
The degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum of given functions evaluated at the subgraph degrees. Here we study this pro…
On Supmodular Matrices
Shmuel Onn
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a…
Kissing polytopes
Antoine Deza, Shmuel Onn, Sebastian Pokutta +1
We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal d…
Degree Sequence Optimization in Bounded Treewidth
Shmuel Onn
We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-h…