5 papers
Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth
Florent Foucaud, Atrayee Majumder, Tobias Mömke +1
In the PATH COVER problem, one asks to cover the vertices of a graph using the smallest possible number of (not necessarily disjoint) paths. While the variant where the paths need…
Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates
Mathew C. Francis, Atrayee Majumder, Rogers Mathew
A graph on vertices is a \emph{threshold graph} if there exist real numbers and such that the zero-one solutions of the linear inequality $\sum \…
Local Boxicity and Maximum Degree
Atrayee Majumder, Rogers Mathew
The \emph{local boxicity} of a graph , denoted by , is the minimum positive integer such that can be obtained using the intersection of (, where ,…
Dimension of CPT posets
Atrayee Majumder, Rogers Mathew, Deepak Rajendraprasad
A collection of linear orders on , say , is said to \emph{realize} a partially ordered set (or poset) if, for any two distinct $x,y \in…
Understanding of Genetic Code Degeneracy and New Way of Classifying of Protein Family: A Mathematical Approach
Jayanta Kumar Das, Atrayee Majumder, Pabitra Pal Choudhury
The genetic code is the set of rules by which information encoded in genetic material (DNA or RNA sequences) is translated into proteins (amino acid sequences) by living cells. The…