3 papers
cs.DS2025
On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
Rinku Kumar, Bodhisatwa Mazumdar, Subhrangsu Mandal
Temporal graphs are introduced to model systems where the relationships among the entities of the system evolve over time. In this paper, we consider the temporal graphs where the…
cs.DS2020
Maximum 0-1 Timed Matching on Temporal Graphs
Subhrangsu Mandal, Arobinda Gupta
Temporal graphs are graphs where the topology and/or other properties of the graph change with time. They have been used to model applications with temporal information in various…
cs.DC2020
Live Exploration with Mobile Robots in a Dynamic Ring, Revisited
Subhrangsu Mandal, Anisur Rahaman Molla, William K. Moses
The graph exploration problem requires a group of mobile robots, initially placed arbitrarily on the nodes of a graph, to work collaboratively to explore the graph such that each n…