default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaushik Mondal 0001
Person information
- affiliation: Indian Institute of Technology Ropar, India
- affiliation (former): Indian Institute of Information Technology Vadodara, Gandhinagar, India
- affiliation (former): Ben-Gurion University of the Negev, Israel
Other persons with the same name
- Kaushik Mondal 0002 — Indian Institute of Information Technology, Allahabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Barun Gorain, Partha Sarathi Mandal
, Kaushik Mondal, Supantha Pandit:
Collaborative dispersion by silent robots. J. Parallel Distributed Comput. 188: 104852 (2024)- [j14]Ashish Saxena, Kaushik Mondal:
A further study on weak Byzantine gathering of mobile agents. Theor. Comput. Sci. 1022: 114892 (2024) - 2023
- [j13]Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh:
Edge exploration of anonymous graph by mobile agent with external help. Computing 105(2): 483-506 (2023) - [j12]Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit:
Burning and w-burning of geometric graphs. Discret. Appl. Math. 336: 83-98 (2023) - 2022
- [j11]Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid:
Area Convergence of Monoculus Robots With Additional Capabilities. Comput. J. 65(5): 1306-1319 (2022) - [j10]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922: 61-80 (2022) - [j9]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Design With Minimal Congestion and Route Lengths. IEEE/ACM Trans. Netw. 30(4): 1838-1848 (2022) - [j8]Chen Avin, Kaushik Mondal, Stefan Schmid:
Push-Down Trees: Optimal Self-Adjusting Complete Trees. IEEE/ACM Trans. Netw. 30(6): 2419-2432 (2022) - 2021
- [j7]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. Theor. Comput. Sci. 887: 111-121 (2021) - 2020
- [j6]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-aware network designs of bounded degree. Distributed Comput. 33(3-4): 311-325 (2020) - 2019
- [j5]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) - 2018
- [j4]Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha:
A robust deterministic approach to node localisation using NLOS signal. Int. J. Commun. Networks Distributed Syst. 20(3): 263-290 (2018) - 2017
- [j3]Kaushik Mondal, Partha Sarathi Mandal:
Range-Free Mobile Sensor Localization and a Novel Obstacle Detection Technique. Wirel. Pers. Commun. 92(2): 351-380 (2017) - 2016
- [j2]Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal:
Path planning algorithms for mobile anchors towards range-free localization. J. Parallel Distributed Comput. 97: 35-46 (2016) - 2015
- [j1]Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha:
Analysis of Multiple-Bound Signals Towards Localization: A Theoretical Approach. Wirel. Pers. Commun. 83(1): 49-67 (2015)
Conference and Workshop Papers
- 2024
- [c23]Barun Gorain, Tanvir Kaur, Kaushik Mondal:
Distance-2-Dispersion with Termination by a Strong Team. CALDAM 2024: 44-58 - [c22]Ashish Saxena, Kaushik Mondal:
A Further Study on Weak Byzantine Gathering of Mobile Agents. ICDCN 2024: 22-31 - [c21]Ashish Saxena, Barun Gorain, Subhrangsu Mandal, Kaushik Mondal:
Brief Announcement: Pebble Guided Rendezvous Despite Fault. SSS 2024: 121-125 - 2023
- [c20]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. IPDPS 2023: 47-57 - [c19]Tanvir Kaur, Kaushik Mondal:
Distance-2-Dispersion: Dispersion with Further Constraints. NETYS 2023: 157-173 - 2022
- [c18]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Dominating Sets in Interval Graphs. COCOON 2022: 508-520 - [c17]Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. SSS 2022: 254-269 - [c16]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Connected Dominating Sets in Unit Square and Disk Graphs. TAMC 2022: 346-358 - 2021
- [c15]Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal:
Burning Grids and Intervals. CALDAM 2021: 66-79 - [c14]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Byzantine Dispersion on Graphs. IPDPS 2021: 942-951 - [c13]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. SIROCCO 2021: 222-239 - [c12]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM 2021: 175-188 - 2020
- [c11]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. ALGOSENSORS 2020: 154-169 - [c10]Chen Avin, Kaushik Mondal, Stefan Schmid:
Dynamically Optimal Self-adjusting Single-Source Tree Networks. LATIN 2020: 143-154 - 2019
- [c9]Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh:
Edge Exploration of a Graph by Mobile Agent. COCOA 2019: 142-154 - [c8]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Design with Minimal Congestion and Route Lengths. INFOCOM 2019: 1351-1359 - 2017
- [c7]Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal:
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. ICDCN 2017: 7 - [c6]Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid:
Convergence of Even Simpler Robots without Position Information. NETYS 2017: 69-85 - [c5]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Designs of Bounded Degree. DISC 2017: 5:1-5:16 - 2015
- [c4]Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal:
Path Planning Algorithm for Mobile Anchor in Connected Sensor Networks. ICDCIT 2015: 193-198 - 2013
- [c3]Kaushik Mondal, Arjun Talwar, Partha Sarathi Mandal, Bhabani P. Sinha:
Localization Based on Two-Bound Reflected Signals in Wireless Sensor Networks. ICDCIT 2013: 334-346 - [c2]Kaushik Mondal, Partha Sarathi Mandal:
Range-Free Mobile Node Localization Using Static Anchor. WASA 2013: 269-284 - 2012
- [c1]Kaushik Mondal, Partha Sarathi Mandal, Bhabani P. Sinha:
Localization in Presence of Multipath Effect in Wireless Sensor Networks. WWIC 2012: 138-149
Informal and Other Publications
- 2024
- [i14]Tanvir Kaur, Ashish Saxena, Partha Sarathi Mandal, Kaushik Mondal:
Black Hole Search in Dynamic Graphs. CoRR abs/2405.18367 (2024) - [i13]Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit:
Optimal Dispersion of Silent Robots in a Ring. CoRR abs/2408.05491 (2024) - 2023
- [i12]Tanvir Kaur, Kaushik Mondal:
Distance-2-Dispersion: Dispersion with Further Constraints. CoRR abs/2301.04938 (2023) - [i11]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. CoRR abs/2305.01753 (2023) - 2022
- [i10]Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. CoRR abs/2202.05710 (2022) - 2021
- [i9]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Byzantine Dispersion on Graphs. CoRR abs/2102.07528 (2021) - [i8]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. CoRR abs/2103.05933 (2021) - 2020
- [i7]Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal:
NP-completeness Results for Graph Burning on Geometric Graphs. CoRR abs/2003.07746 (2020) - [i6]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots. CoRR abs/2004.11439 (2020) - 2018
- [i5]Chen Avin, Kaushik Mondal, Stefan Schmid:
Push-Down Trees: Optimal Self-Adjusting Complete Trees. CoRR abs/1807.04613 (2018) - 2017
- [i4]Chen Avin, Kaushik Mondal, Stefan Schmid:
Demand-Aware Network Designs of Bounded Degree. CoRR abs/1705.06024 (2017) - 2016
- [i3]Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal:
Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection. CoRR abs/1608.02432 (2016) - [i2]Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid:
Convergence of Even Simpler Robots without Location Information. CoRR abs/1608.06002 (2016) - 2014
- [i1]Kaushik Mondal, Arindam Karmakar, Partha Sarathi Mandal:
Designing Path Planning Algorithms for Mobile Anchor towards Range-Free Localization. CoRR abs/1409.0085 (2014)
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 2024-10-31 21:10 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:
