Md. Manzurul Hasan

collaborators

Showing cs.DSShow all

3 papers · 1 filter

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 $Σ$ . Given a pattern P of length m and a text T of length n, the classical task is to decide whether…

cs.DS2025

The Longest Common Bitonic Subsequence: Match-Sensitive Algorithms and Conditional Hardness

Md. Tanzeem Rahat, Md. Manzurul Hasan, Sadia Sharmin

The longest common bitonic subsequence problem asks for a longest common subsequence of two ordered sequences whose values strictly increase and then strictly decrease; either phas…

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 $δ$ , a common almost increasing sequence $s_{1} \dots s_{k}$ is a c…