Syed Mohammad Meesum

Orcid: 0000-0002-1771-403X

Affiliations:

Homi Bhabha National Institute, Institute of Mathematical Sciences, Chennai, India

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

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2022

Approximate separable multichoice optimization over monotone systems.

[BibT_eX]

[DOI]

Discret. Optim., 2022

2020

Rectangle Tiling Binary Arrays.

[BibT_eX]

[DOI]

Pratik Ghosal

Syed Mohammad Meesum

Katarzyna Paluch

CoRR, 2020

Dense Steiner problems: Approximation algorithms and inapproximability.

[BibT_eX]

[DOI]

CoRR, 2020

PTAS for Steiner Tree on Map Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Hypergraphic Degree Sequences are Hard.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Constant-Factor FPT Approximation for Capacitated k-Median.

[BibT_eX]

[DOI]

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

2018

Matrix Rigidity from the Viewpoint of Parameterized Complexity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Optimization over Degree Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Rank Reduction of Oriented Graphs by Vertex and Edge Deletions.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

Saket Saurabh

Algorithmica, 2018

Unknot Recognition Through Quantifier Elimination.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

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

2017

Parameterized complexity of Strip Packing and Minimum Volume Packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Cyclic Hypergraph Degree Sequences.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

CoRR, 2017

Approximate Shifted Combinatorial Optimization.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Reducing rank of the adjacency matrix by graph modification.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

Pranabendu Misra

Saket Saurabh

Theor. Comput. Sci., 2016

Rank Reduction of Directed Graphs by Vertex and Edge Deletions.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

Saket Saurabh

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Syed Mohammad Meesum

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...