Md. Tanzeem Rahat

collaborators

5 papers

cs.DS2026

Competitive Analysis of Online Facility Assignment Algorithms on Discrete Grid Graphs: Performance Bounds and Remediation Strategies

Lamya Alif, Raian Tasnim Saoda, Sumaiya Afrin +3

We study the \emph{Online Facility Assignment} (OFA) problem on a discrete $r \times c$ grid graph under the standard model of Ahmed, Rahman, and Kobourov: a fixed set of facilities…

cs.DS2026

Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)

Md. Rawha Siddiqi Riad, Md. Tanzeem Rahat, Md. Manzurul Hasan

We study a greedy online facility assignment process on a regular $n$ -gon, where unit-capacity facilities occupy the vertices and customers arrive sequentially at uniformly random…

cs.DS2026

Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection

MD Nazmul Alam Shanto, Md. Tanzeem Rahat, Md. Manzurul Hasan

We study permutation (jumbled/Abelian) pattern matching over a general alphabet $I^£$ . Given a pattern P of length m and a text T of length n, the classical task is to decide whethe…

cs.DS2026

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach

Md. Tanzeem Rahat, Md. Manzurul Hasan

Given two sequences $A [1.. n]$ and $B [1.. m]$ over a totally ordered alphabet, the \emph{Longest Common Bitonic Subsequence} (LCBS) problem asks for a longest common subsequence that…

cs.DS2025

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences

Md Tanzeem Rahat, Md. Manzurul Hasan, Debajyoti Mondal

Let $A$ and $B$ be two number sequences of length $n$ and $m$ , respectively, where $m \leq n$ . Given a positive number $I^´$ , a common almost increasing sequence $s_{1} \dots s_{k}$ is a…