Md. Tanzeem Rahat

Orcid: 0009-0008-6474-9877

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

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

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

2025
Space-Efficient and Output-Sensitive Algorithms for the Longest Common Bitonic Subsequence.
CoRR, November, 2025

ChainGraph-DL: Data-Driven Causal Inference for Graph Structure Learning.
Proceedings of the 12th International Conference on Next Generation Computing, 2025

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences.
Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025


  Loading...