S. M. Meesum

Available identifiers

Publication	Date of Publication	Type
PTAS for Steiner tree on map graphs	2022-10-13	Paper
Approximate separable multichoice optimization over monotone systems	2022-06-09	Paper
Constant-Factor FPT Approximation for Capacitated k-Median	2022-05-11	Paper
Hypergraphic degree sequences are hard	2020-01-13	Paper
Rank vertex cover as a natural problem for algebraic compression	2019-08-29	Paper
An efficiently recognisable subset of hypergraphic sequences	2018-10-04	Paper
Optimization over degree sequences	2018-08-10	Paper
Rank reduction of oriented graphs by vertex and edge deletions	2018-07-26	Paper
Matrix Rigidity from the Viewpoint of Parameterized Complexity	2018-05-02	Paper
Matrix Rigidity from the Viewpoint of Parameterized Complexity	2018-04-19	Paper
Parameterized complexity of strip packing and minimum volume packing	2017-01-09	Paper
Reducing rank of the adjacency matrix by graph modification	2016-11-24	Paper
Rank reduction of directed graphs by vertex and edge deletions	2016-05-03	Paper
Reducing rank of the adjacency matrix by graph modification	2015-10-29	Paper

This page was built for person: S. M. Meesum