default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDebasish Pattanayak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j10]Ajay D. Kshemkalyani, Manish Kumar
, Anisur Rahaman Molla, Debasish Pattanayak, Gokarna Sharma:
Faster leader election via mobile agents and its applications. Theor. Comput. Sci. 1059: 115578 (2026)- 2025
- [j9]Paola Flocchini, Debasish Pattanayak, Francesco Piselli, Nicola Santoro, Yukiko Yamauchi:
Asynchronous Separation of Unconscious Colored Robots. Int. J. Netw. Comput. 15(2): 199-219 (2025) - [j8]Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma:
Dispersion of mobile robots on directed anonymous graphs. J. Parallel Distributed Comput. 204: 105139 (2025) - [c23]Giuseppe Antonio Di Luna, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Francesco Piselli, Nicola Santoro:
Exploring Dangerous Graphs with Byzantine Companions. ICDCS 2025: 352-361 - [c22]Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli, Nicola Santoro:
Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation. SIROCCO 2025: 297-314 - [c21]Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Debasish Pattanayak, Gokarna Sharma:
Dispersion is (Almost) Optimal under (A)synchrony. SPAA 2025: 367-381 - [c20]Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Nicola Santoro:
Brief Announcement: Universal Dancing by Luminous Robots Under Sequential Schedulers. DISC 2025: 56:1-56:7 - [c19]Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma:
Brief Announcement: Optimal Dispersion Under Asynchrony. DISC 2025: 63:1-63:7 - [i15]Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma:
Optimal Dispersion Under Asynchrony. CoRR abs/2507.01298 (2025) - [i14]Caterina Feletti, Paola Flocchini, Debasish Pattanayak, Giuseppe Prencipe, Nicola Santoro:
Universal Dancing by Luminous Robots under Sequential Schedulers. CoRR abs/2508.15484 (2025) - 2024
- [j7]Debasish Pattanayak, Andrzej Pelc:
Graph exploration by a deterministic memoryless automaton with pebbles. Discret. Appl. Math. 356: 149-160 (2024) - [j6]Debasish Pattanayak, Andrzej Pelc:
Deterministic treasure hunt and rendezvous in arbitrary connected graphs. Inf. Process. Lett. 185: 106455 (2024) - [c18]Paola Flocchini, Debasish Pattanayak, Francesco Piselli, Nicola Santoro, Yukiko Yamauchi:
Asynchronous Separation of Unconscious Colored Robots. CANDARW 2024: 183-189 - [c17]Debasish Pattanayak, Subhash Bhagat, Sruti Gan Chaudhuri, Anisur Rahaman Molla:
Maximal Independent Set via Mobile Agents. ICDCN 2024: 74-83 - [c16]Debasish Pattanayak, Gokarna Sharma:
Time-Color Tradeoff on Uniform Circle Formation by Asynchronous Robots. IPDPS 2024: 987-997 - [c15]Paola Flocchini, Debasish Pattanayak, Nicola Santoro, Masafumi Yamashita:
The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots. IWOCA 2024: 472-484 - [c14]Caterina Feletti, Debasish Pattanayak, Gokarna Sharma:
Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous Robots. DISC 2024: 46:1-46:7 - [i13]Caterina Feletti, Debasish Pattanayak, Gokarna Sharma:
Optimal Uniform Circle Formation by Asynchronous Luminous Robots. CoRR abs/2405.06617 (2024) - [i12]Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli, Nicola Santoro:
Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation. CoRR abs/2412.10733 (2024) - 2023
- [j5]Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak, Partha Sarathi Mandal:
Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots. Theor. Comput. Sci. 978: 114187 (2023) - [c13]Subhajit Pramanick, Sai Vamshi Samala, Debasish Pattanayak, Partha Sarathi Mandal:
Filling MIS Vertices of a Graph by Myopic Luminous Robots. ICDCIT 2023: 3-19 - [c12]Debasish Pattanayak, Gokarna Sharma, Partha Sarathi Mandal:
Dispersion of Mobile Robots in Spite of Faults. SSS 2023: 414-429 - [i11]Debasish Pattanayak, Andrzej Pelc:
Deterministic Treasure Hunt and Rendezvous in Arbitrary Connected Graphs. CoRR abs/2310.01136 (2023) - [i10]Debasish Pattanayak, Andrzej Pelc:
Computing Functions by Teams of Deterministic Finite Automata. CoRR abs/2310.01151 (2023) - 2022
- [j4]Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid:
Area Convergence of Monoculus Robots With Additional Capabilities. Comput. J. 65(5): 1306-1319 (2022) - [j3]Dibakar Saha, Debasish Pattanayak, Partha Sarathi Mandal:
Surveillance of Uneven Surface With Self-Organizing Unmanned Aerial Vehicles. IEEE Trans. Mob. Comput. 21(4): 1449-1462 (2022) - [c11]Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma:
Dispersion of Mobile Robots on Directed Anonymous Graphs. SIROCCO 2022: 191-211 - [i9]Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas, Debasish Pattanayak:
On maximal 3-edge-connected subgraphs of undirected graphs. CoRR abs/2211.06521 (2022) - 2021
- [j2]Debasish Pattanayak, John Augustine, Partha Sarathi Mandal:
Randomized gathering of asynchronous mobile robots. Theor. Comput. Sci. 858: 64-80 (2021) - [c10]Kartikey Kant, Debasish Pattanayak, Partha Sarathi Mandal:
Fort Formation by an Automaton. COMSNETS 2021: 540-547 - [c9]Debasish Pattanayak, Dibakar Saha, Debarati Mitra, Partha Sarathi Mandal:
A Reconstructive Model for Identifying the Global Spread in a Pandemic. ICDCIT 2021: 188-202 - [c8]Debasish Pattanayak, Gokarna Sharma, Partha Sarathi Mandal:
Dispersion of Mobile Robots Tolerating Faults. ICDCN (Adjunct Volume) 2021: 133-138 - [i8]Sai Vamshi Samala, Subhajit Pramanick, Debasish Pattanayak, Partha Sarathi Mandal:
Filling MIS Vertices by Myopic Luminous Robots. CoRR abs/2107.04885 (2021) - 2020
- [c7]Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal, Stefan Schmid:
Conic Formation in Presence of Faulty Robots. ALGOSENSORS 2020: 170-185 - [c6]Dibakar Saha, Debasish Pattanayak, Partha Sarathi Mandal:
Surveillance of Uneven Surface with Unmanned Aerial Vehicles. ICDCN 2020: 17:1-17:10 - [c5]Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal:
Collaborative Evacuation of Mobile Robots. ICDCN 2020: 64:1 - [i7]Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal, Stefan Schmid:
Distributed Pattern Formation With Faulty Robots. CoRR abs/2003.01914 (2020) - [i6]Kartikey Kant, Debasish Pattanayak, Partha Sarathi Mandal:
Fort Formation by an Automaton. CoRR abs/2011.15074 (2020)
2010 – 2019
- 2019
- [j1]Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal:
Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. J. Parallel Distributed Comput. 123: 145-155 (2019) - [c4]Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal:
Chauffeuring a Crashed Robot from a Disk. ALGOSENSORS 2019: 177-191 - [i5]Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal:
Chauffeuring a Crashed Robot from a Disk. CoRR abs/1906.03024 (2019) - [i4]Debasish Pattanayak, John Augustine, Partha Sarathi Mandal:
Randomized Gathering of Asynchronous Mobile Robots. CoRR abs/1909.10004 (2019) - 2018
- [c3]Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal, Stefan Schmid:
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication. ICDCN 2018: 20:1-20:4 - 2017
- [c2]Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal:
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. ICDCN 2017: 7 - [c1]Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid:
Convergence of Even Simpler Robots without Position Information. NETYS 2017: 69-85 - [i3]Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal, Stefan Schmid:
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk. CoRR abs/1708.03792 (2017) - 2016
- [i2]Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal:
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. CoRR abs/1608.02432 (2016) - [i1]Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid:
Convergence of Even Simpler Robots without Location Information. CoRR abs/1608.06002 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-03 23:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
