Syed Mohammad Meesum

Publication Activity (10 Years)

Years Active: 2015-2022
Publications (10 Years): 24

Top Topics

Parameterized Complexity

Adjacency Matrix

Top Venues

SIAM J. Discret. Math.

Publications

Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44 (Part) (2022)
Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich
Dense Steiner problems: Approximation algorithms and inapproximability. CoRR (2020)
Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch
Rectangle Tiling Binary Arrays. CoRR (2020)
Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal
PTAS for Steiner Tree on Map Graphs. LATIN (2020)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Hypergraphic Degree Sequences are Hard. CoRR (2019)
Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
Constant-Factor FPT Approximation for Capacitated k-Median. ESA (2019)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Hypergraphic Degree Sequences are Hard. Bull. EATCS 127 (2019)
Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. 33 (3) (2019)
Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal
PTAS for Steiner Tree on Map Graphs. CoRR (2019)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Optimization over Degree Sequences. SIAM J. Discret. Math. 32 (3) (2018)
Syed Mohammad Meesum
An Efficiently Recognisable Subset of Hypergraphic Sequences. COCOON (2018)
Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. 32 (2) (2018)
Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
Constant factor FPT approximation for capacitated k-median. CoRR (2018)
Syed Mohammad Meesum, Saket Saurabh
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Algorithmica 80 (10) (2018)
Syed Mohammad Meesum, T. V. H. Prathamesh
Unknot Recognition Through Quantifier Elimination. SC-Square@FLOC (2018)
Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS (2017)
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate Shifted Combinatorial Optimization. CoRR (2017)
Syed Mohammad Meesum
Cyclic Hypergraph Degree Sequences. CoRR (2017)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Optimization over Degree Sequences. CoRR (2017)
Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh
Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. 661 (2017)
Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR (2017)
Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh
Reducing rank of the adjacency matrix by graph modification. Theor. Comput. Sci. 654 (2016)
Syed Mohammad Meesum, Saket Saurabh
Rank Reduction of Directed Graphs by Vertex and Edge Deletions. LATIN (2016)
Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh
Reducing Rank of the Adjacency Matrix by Graph Modification. COCOON (2015)