activity
20082025
most citedSome New Equiprojective Polyhedra

2 citations · 4 across the 8 of their papers we have counts for

collaborators

9 papers

math.CO2025

Local (Outer) Multiset Dimensions of Graphs

Rinovia Simanjuntak, M. Ali Hasan, Muhung Anggarawan

Let be a finite, connected, undirected, and simple graph and be a set of vertices in . A representation multiset of a vertex in with respect to is defined…

cs.AR2011★ 1 cited

Facile Algebraic Representation of a Novel Quaternary Logic

Ifat Jahangir, Anindya Das, Masud Hasan

In this work, a novel quaternary algebra has been proposed that can be used to implement an arbitrary quaternary logic function in more than one systematic ways. The proposed logic…

cs.AR2010

On the Design and Analysis of Quaternary Serial and Parallel Adders

Anindya Das, Ifat Jahangir, Masud Hasan

Optimization techniques for decreasing the time and area of adder circuits have been extensively studied for years mostly in binary logic system. In this paper, we provide the nece…

cs.CG2010★ 2 cited

Some New Equiprojective Polyhedra

Masud Hasan, Mohammad Monoar Hossain, Alejandro López-Ortiz +3

A convex polyhedron is -equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of are -gon for some fixed value of …

cs.DS2009★ 1 cited

An Algorithm for Computing Longest Common Cyclic Subsequence

Shihabur Rahman Chowdhury, Masud Hasan, Sumaiya Iqbal +1

The {\em longest common subsequence (LCS)} problem is a classic and well-studied problem in computer science. LCS is a central problem in stringology and finds broad applications i…

cs.DS2009

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in Time

Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan +1

Sorting a Permutation by Transpositions (SPbT) is an important problem in Bioinformtics. In this paper, we improve the running time of the best known approximation algorithm for SP…