Syed Mohammad Meesum

According to our database, Syed Mohammad Meesum authored at least 17 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Rectangle Tiling Binary Arrays.

Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch

Proceedings of the Approximation, 2024

2022

Approximate separable multichoice optimization over monotone systems.

Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn

Discret. Optim., 2022

2020

Dense Steiner problems: Approximation algorithms and inapproximability.

Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich

CoRR, 2020

PTAS for Steiner Tree on Map Graphs.

Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression.

Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi

SIAM J. Discret. Math., 2019

Hypergraphic Degree Sequences are Hard.

Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn

Bull. EATCS, 2019

Constant-Factor FPT Approximation for Capacitated k-Median.

Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity.

Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi

SIAM J. Discret. Math., 2018

Optimization over Degree Sequences.

Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn

SIAM J. Discret. Math., 2018

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions.

Syed Mohammad Meesum, Saket Saurabh

Algorithmica, 2018

Unknot Recognition Through Quantifier Elimination.

Syed Mohammad Meesum, T. V. H. Prathamesh

Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, 2018

An Efficiently Recognisable Subset of Hypergraphic Sequences.

Syed Mohammad Meesum

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Parameterized complexity of Strip Packing and Minimum Volume Packing.

Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh

Theor. Comput. Sci., 2017

Cyclic Hypergraph Degree Sequences.

Syed Mohammad Meesum

CoRR, 2017

Approximate Shifted Combinatorial Optimization.

Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn

CoRR, 2017

2016

Reducing rank of the adjacency matrix by graph modification.

Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh

Theor. Comput. Sci., 2016

Rank Reduction of Directed Graphs by Vertex and Edge Deletions.

Syed Mohammad Meesum, Saket Saurabh

Proceedings of the LATIN 2016: Theoretical Informatics, 2016