Md. Manzurul Hasan

collaborators

4 papers

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.SD2025

OBHS: An Optimized Block Huffman Scheme for Real-Time Audio Compression

Muntahi Safwan Mahfi, Md. Manzurul Hasan, Gahangir Hossain

In this paper, we introduce OBHS (Optimized Block Huffman Scheme), a novel lossless audio compression algorithm tailored for real-time streaming applications. OBHS leverages block-…

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…