1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Approximate Shifted Combinatorial Optimization
Martin Koutecky, Asaf Levin, Syed M. Meesum +1
Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several fea…
Optimization over Degree Sequences
Antoine Deza, Asaf Levin, Syed M. Meesum +1
We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can b…
Rank Vertex Cover as a Natural Problem for Algebraic Compression
Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh +1
The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem has been a longstanding, notorious open problem in Parameterized Complexity. Five y…
Cyclic Hypergraph Degree Sequences
Syed Mohammad Meesum
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restrict…