6 papers
OmniScientist: An Omni-Modal Omni-Discipline AI Scientist
Bobo Li, Hao Fei, Tianjie Ju +2
Recent advances in foundation models have enabled AI scientists to automate increasingly complete research workflows, from hypothesis generation and code execution to manuscript pr…
Exact-Distance Domination in Grid Graphs
Sandip Das, Sweta Das, Arpan Sadhukhan
Let be the square grid, and let . A set is an \emph{exact-distance -dominating set} if every vertex has a…
On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
Sandip Das, Sweta Das, Sk Samim Islam
The domination problem is a well-studied problem in graph theory. In this paper, we study two natural variants: the hop domination problem and the -step domination problem. Let…
Parameterized complexity of -Hop, -Step, and -Hop Roman Domination
Sandip Das, Sweta Das, Sk Samim Islam
The \textsc{Dominating Set} problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complex…
On the Number of Almost Empty Monochromatic Triangles
Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam +3
In this paper, we consider the problem of counting almost empty monochromatic triangles in colored planar point sets, that is, triangles whose vertices are all assigned the same co…
Exact Algorithms for Resource Reallocation Under Budgetary Constraints
Arun Kumar Das, Sandip Das, Sweta Das +2
Efficient resource (re-)allocation is a critical challenge in optimizing productivity and sustainability within multi-party supply networks. In this work, we introduce the \textsc{…