8 citations · 10 across the 11 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
Algorithms for the Maximum Edge Open Packing Problem
Sriram Bhyravarapu, Gautam K. Das, Kamal Santra
Packing problems form a central theme in graph theory, owing to their relevance in modeling conflict-free resource allocation, network design, and communication constraints. Motiva…
math.CO2021
Roman Domination in Convex Bipartite Graphs
Sasmita Rout, Gautam K. Das
In the Roman domination problem, an undirected simple graph is given. The objective of Roman domination problem is to find a function such tha…