Syed Mohammad Meesum

26 papers A 3B 2Misc 2Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Formal Proof of Dilworth's Theorem.
Arch. Formal Proofs
Vivek Soorya Maadoori, Syed Mohammad Meesum, Shiv Pillai, T. V. H. Prathamesh, Aditya Swami
2024 A conf
Rectangle Tiling Binary Arrays.
APPROX/RANDOM
Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch
2022 J jnl
Approximate separable multichoice optimization over monotone systems.
Discret. Optim.
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2020 J jnl
Dense Steiner problems: Approximation algorithms and inapproximability.
CoRR
Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich
2020 B conf
PTAS for Steiner Tree on Map Graphs.
LATIN
Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal
2020 J jnl
Rectangle Tiling Binary Arrays.
CoRR
Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch
2019 A conf
Constant-Factor FPT Approximation for Capacitated k-Median.
ESA
Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
2019 J jnl
Hypergraphic Degree Sequences are Hard.
CoRR
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2019 J jnl
Hypergraphic Degree Sequences are Hard.
Bull. EATCS
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2019 J jnl
PTAS for Steiner Tree on Map Graphs.
CoRR
Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal
2019 J jnl
Rank Vertex Cover as a Natural Problem for Algebraic Compression.
SIAM J. Discret. Math.
Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018 Misc conf
An Efficiently Recognisable Subset of Hypergraphic Sequences.
COCOON
Syed Mohammad Meesum
2018 J jnl
Constant factor FPT approximation for capacitated k-median.
CoRR
Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
2018 J jnl
Matrix Rigidity from the Viewpoint of Parameterized Complexity.
SIAM J. Discret. Math.
Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2018 J jnl
Optimization over Degree Sequences.
SIAM J. Discret. Math.
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2018 J jnl
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions.
Algorithmica
Syed Mohammad Meesum, Saket Saurabh
2018 — conf
Unknot Recognition Through Quantifier Elimination.
SC-Square@FLOC
Syed Mohammad Meesum, T. V. H. Prathamesh
2017 J jnl
Approximate Shifted Combinatorial Optimization.
CoRR
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2017 J jnl
Cyclic Hypergraph Degree Sequences.
CoRR
Syed Mohammad Meesum
2017 A conf
Matrix Rigidity from the Viewpoint of Parameterized Complexity.
STACS
Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2017 J jnl
Optimization over Degree Sequences.
CoRR
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2017 J jnl
Parameterized complexity of Strip Packing and Minimum Volume Packing.
Theor. Comput. Sci.
Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh
2017 J jnl
Rank Vertex Cover as a Natural Problem for Algebraic Compression.
CoRR
Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016 B conf
Rank Reduction of Directed Graphs by Vertex and Edge Deletions.
LATIN
Syed Mohammad Meesum, Saket Saurabh
2016 J jnl
Reducing rank of the adjacency matrix by graph modification.
Theor. Comput. Sci.
Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh
2015 Misc conf
Reducing Rank of the Adjacency Matrix by Graph Modification.
COCOON
Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh