Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSyed Mohammad Meesum
Person information
- affiliation: Homi Bhabha National Institute, Institute of Mathematical Sciences, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Martin Koutecký
, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44(Part): 100629 (2022)- 2020
- [c7]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. LATIN 2020: 3-14 - [i9]Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich:
Dense Steiner problems: Approximation algorithms and inapproximability. CoRR abs/2004.14102 (2020) - [i8]Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch:
Rectangle Tiling Binary Arrays. CoRR abs/2007.14142 (2020)
2010 – 2019
- 2019
- [j7]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. Bull. EATCS 127 (2019) - [j6]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): 1277-1296 (2019) - [c6]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant-Factor FPT Approximation for Capacitated k-Median. ESA 2019: 1:1-1:14 - [i7]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. CoRR abs/1901.02272 (2019) - [i6]Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal:
PTAS for Steiner Tree on Map Graphs. CoRR abs/1912.00717 (2019) - 2018
- [j5]Syed Mohammad Meesum, Saket Saurabh:
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Algorithmica 80(10): 2757-2776 (2018) - [j4]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): 966-985 (2018) - [j3]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. SIAM J. Discret. Math. 32(3): 2067-2079 (2018) - [c5]Syed Mohammad Meesum:
An Efficiently Recognisable Subset of Hypergraphic Sequences. COCOON 2018: 391-402 - [c4]Syed Mohammad Meesum, T. V. H. Prathamesh:
Unknot Recognition Through Quantifier Elimination. SC-Square@FLOC 2018: 77 - [i5]Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk:
Constant factor FPT approximation for capacitated k-median. CoRR abs/1809.05791 (2018) - 2017
- [j2]Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh:
Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. 661: 56-64 (2017) - [c3]Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS 2017: 32:1-32:14 - [i4]Syed Mohammad Meesum:
Cyclic Hypergraph Degree Sequences. CoRR abs/1705.00186 (2017) - [i3]Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR abs/1705.02822 (2017) - [i2]Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate Shifted Combinatorial Optimization. CoRR abs/1706.02075 (2017) - [i1]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. CoRR abs/1706.03951 (2017) - 2016
- [j1]Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh:
Reducing rank of the adjacency matrix by graph modification. Theor. Comput. Sci. 654: 70-79 (2016) - [c2]Syed Mohammad Meesum, Saket Saurabh:
Rank Reduction of Directed Graphs by Vertex and Edge Deletions. LATIN 2016: 619-633 - 2015
- [c1]Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh:
Reducing Rank of the Adjacency Matrix by Graph Modification. COCOON 2015: 361-373
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 03:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
