Articles with public access mandates - Shantanu DasLearn more
Not available anywhere: 1
Rendezvous of mobile agents when tokens fail anytime
S Das, M Mihalák, R Šrámek, E Vicari, P Widmayer
International Conference On Principles Of Distributed Systems, 463-480, 2008
Mandates: Swiss National Science Foundation
Available somewhere: 15
Autonomous mobile robots with lights
S Das, P Flocchini, G Prencipe, N Santoro, M Yamashita
Theoretical Computer Science 609, 171-184, 2016
Mandates: Natural Sciences and Engineering Research Council of Canada
Collaborative delivery with energy-constrained mobile robots
A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ...
Theoretical Computer Science, 2017
Mandates: Swiss National Science Foundation
Mobile agents rendezvous in spite of a malicious agent
S Das, FL Luccio, E Markou
International Symposium on Algorithms and Experiments for Sensor Systems …, 2015
Mandates: Government of Italy
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction
G D’Angelo, M D’Emidio, S Das, A Navarra, G Prencipe
IEEE Access 8, 207619-207634, 2020
Mandates: Government of Italy
Leader election and compaction for asynchronous silent programmable matter
G D'Angelo, M D'Emidio, S Das, A Navarra, G Prencipe
Proceedings of the 19th International Conference on Autonomous Agents and …, 2020
Mandates: European Commission, Government of Italy
Restricted cuts for bisections in solid grids: A proof via polygons
AE Feldmann, S Das, P Widmayer
International Workshop on Graph-Theoretic Concepts in Computer Science, 143-154, 2011
Mandates: Swiss National Science Foundation
Computing all best swaps for minimum-stretch tree spanners
S Das, B Gfeller, P Widmayer
ETH technical report 640, 2009
Mandates: Swiss National Science Foundation
Computing best swaps in optimal tree spanners
S Das, B Gfeller, P Widmayer
International Symposium on Algorithms and Computation, 716-727, 2008
Mandates: Swiss National Science Foundation
Forming sequences of patterns with luminous robots
S Das, P Flocchini, G Prencipe, N Santoro
IEEE Access 8, 90577-90597, 2020
Mandates: Natural Sciences and Engineering Research Council of Canada
Simple cuts are fast and good: Optimum right-angled cuts in solid grids
AE Feldmann, S Das, P Widmayer
International Conference on Combinatorial Optimization and Applications, 11-20, 2010
Mandates: Swiss National Science Foundation
Near-gathering of energy-constrained mobile agents
A Bärtschi, E Bampas, J Chalopin, S Das, C Karousatou, M Mihalák
Theoretical Computer Science 849, 35-46, 2021
Mandates: US Department of Energy, Swiss National Science Foundation, Agence Nationale …
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents
J Chalopin, S Das, Y Disser, A Labourel, M Mihalák
International Colloquium on Structural Information and Communication …, 2019
Mandates: Agence Nationale de la Recherche
Corner cuts are close to optimal: From solid grids to polygons and back
AE Feldmann, S Das, P Widmayer
Discrete Applied Mathematics 161 (7-8), 970-998, 2013
Mandates: Swiss National Science Foundation
Deterministic Leader Election for Stationary Programmable Matter with Common Direction
J Chalopin, S Das, M Kokkou
International Colloquium on Structural Information and Communication …, 2024
Mandates: Agence Nationale de la Recherche
Energy Constrained Depth First Search
S Das, D Dereniowski, P Uznański
Algorithmica 86 (12), 3759-3782, 2024
Mandates: Agence Nationale de la Recherche, National Science Centre, Poland
Publication and funding information is determined automatically by a computer program