Md Tanzeem Rahat

According to our database, Md Tanzeem Rahat authored at least 4 papers between 2025 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

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

Lamya Alif, Raian Tasnim Saoda, Sumaiya Afrin, Md Rawha Siddiqi Riad, Md Tanzeem Rahat, Md Manzurul Hasan

CoRR, February, 2026

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

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

CoRR, January, 2026

2025

Space-Efficient and Output-Sensitive Algorithms for the Longest Common Bitonic Subsequence.

Md Tanzeem Rahat, Md. Manzurul Hasan

CoRR, November, 2025

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

Md Tanzeem Rahat, Md. Manzurul Hasan, Debajyoti Mondal

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025