activity
20212026
most citedAsynchronous Indulgent Gathering of Opaque Robots

1 citations · 1 across the 8 of their papers we have counts for

collaborators

9 papers

cs.DC2026

Beyond the Boundary: Optimal Grid Dispersion by Spread, Reverse, and Collect

Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak +1

\emph{Dispersion} requires a set of mobile agents to occupy distinct nodes of a graph such that each node contains at most one agent. We study deterministic dispersion of …

cs.DC2026

Short Graph Sketches Suffice for Error-resilient Leader Verification in CONGEST

Pawel Garncarek, Tomasz Jurdziński, Dariusz Kowalski +1

Locally Checkable Proofs (LCPs) enable the verification of global graph properties using locally checkable certificates assigned by a prover. Recently, this framework was extended…

cond-mat.supr-con2026

Observation of intertwined charge density wave order and superconductivity in Janus monolayer

Subhajit Pramanick, Shubham Patel, Sudip Chakraborty +1

Low-dimensional transition-metal dichalcogenides (TMDCs) provide an ideal platform for studying the emergence of charge density wave (CDW) and superconductivity. The discovery of e…

cs.DC2026

Distributed Local Verification using Proofs with(out) Errors

Paweł Garncarek, Tomasz Jurdzinski, Dariusz Kowalski +1

We study local verification of graph properties in distributed networks under the framework of \emph{locally checkable proofs} (LCPs). In an LCP, a prover assigns proof labels to n…

cs.DC2025★ 1 cited

Asynchronous Indulgent Gathering of Opaque Robots

Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal +1

We consider the benchmarking problem of gathering in an -fault system consisting of robots, of which at most may fail at any execution. The {\em traditional} version…

cs.DC2025

Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots

Saswata Jana, Subhajit Pramanick, Adri Bhattacharya +1

In a connected graph with an autonomous robot swarm with limited visibility, it is natural to ask whether the robots can be deployed to certain vertices satisfying a given property…

cond-mat.supr-con2025

Pressure induced evolution of anisotropic superconductivity and Fermi surface nesting in a ternary boride

Subhajit Pramanick, Sudip Chakraborty, A. Taraphder

Using Migdal-Eliashberg theory implemented in Electron Phonon Wannier (EPW) code, we have investigated anisotropic superconductivity in a ternary boride . It is…

cs.DC2023

Uniform Partitioning of a Bounded Region using Opaque ASYNC Luminous Mobile Robots

Subhajit Pramanick, Saswata Jana, Adri Bhattacharya +1

We are given autonomous mobile robots inside a bounded region. The robots are opaque which means that three collinear robots are unable to see each other as one of the robots a…

cs.DC2021

Filling MIS Vertices by Myopic Luminous Robots

Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak +1

We present the problem of finding a maximal independent set (MIS) (named as \emph{MIS Filling problem}) of an arbitrary connected graph having vertices with luminous myopic mob…