INSTITUTIONAL DIGITAL REPOSITORY

Browsing by Author "Mondal, K."

Browsing by Author "Mondal, K."

Sort by: Order: Results:

  • Area convergence of monoculus robots with additional capabilities 
    Pattanayak, D.; Mondal, K.; Mandal, P.S.; Schmid, S. (2022-07-20)
    This paper considers the area convergence problem, which requires a group of robots to gather in a small area not defined a priori. While it is known that robots can gather at a point if they can precisely measure distances, ...
  • Burning grids and intervals 
    Gupta, A. T.; Lokhande, S. A.; Mondal, K. (2021-12-03)
    Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of the graph. The spread of social influence, ...
  • Byzantine dispersion on graphs 
    Molla, A. R.; Mondal, K.; Moses Jr, W. K. (2021-11-27)
    This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given n robots, up to f of which are Byzantine, initially placed ...
  • Demand-aware network design with minimal congestion and route lengths 
    Avin, C.; Mondal, K.; Schmid, S. (2022-07-15)
    Emerging communication technologies allow to reconfigure the physical network topology at runtime, enabling demand-aware networks (DANs): networks whose topology is optimized toward the workload they serve. However, today, ...
  • Dynamically optimal Self-Adjusting Single-Source tree networks 
    Avin, C.; Mondal, K.; Schmid, S. (2021-07-04)
    This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an online manner. The goal is to strike a ...
  • Efficient dispersion on an anonymous ring in the presence of weak byzantine robots 
    Molla, A. R.; Mondal, K.; Moses, W. K. (2021-07-04)
    The problem of dispersion of mobile robots on a graph asks that n robots initially placed arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final configuration where exactly each node has ...
  • Optimal dispersion on an anonymous ring in the presence of weak byzantine robots 
    Molla, A. R.; Mondal, K.; Moses Jr, W. K. (2021-10-27)
    The problem of dispersion of mobile robots on a graph asks that n robots initially placed arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final configuration where each node has at ...
  • Pebble guided near optimal treasure hunt in anonymous graphs 
    Gorain, B.; Mondal, K.; Nayak, H.; Pandit, S. (2022-09-03)
    We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are labeled arbitrarily as 0, 1, …, deg(v) - 1. A mobile agent, starting ...
  • Pebble guided optimal treasure hunt in anonymous graphs 
    Gorain, B.; Mondal, K.; Nayak, H.; Pandit, S. (2022-07-17)
    We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are labeled arbitrarily as 0, 1,...,deg(v) − 1. A mobile agent, starting ...