default search action
Arun Kumar Das 0001
Person information
- affiliation: University of Hyderabad, India
- affiliation (former): Indian Statistical Institute, Kolkata, India
Other persons with the same name
- Arun Kumar Das 0002
— S. N. Bose National Centre for Basic Sciences, Kolkata, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j5]Sergio Cabello
Finding a largest-area triangle in a terrain in near-linear time. Comput. Geom. 128: 102171 (2025) - [c11]Arun Kumar Das:
Charging Station Placement for Limited Energy Robots. CALDAM 2025: 97-108 - [c10]Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M. Mitra, Bodhayan Roy:
Multipacking in the Euclidean Metric Space. CALDAM 2025: 109-120 - [i4]Helena Bergold, Arun Kumar Das, Robert Lauff, Manfred Scheucher, Felix Schröder, Marie Diana Sieper:
On Triangular Separation of Bichromatic Point Sets. CoRR abs/2503.05178 (2025) - 2024
- [c9]Arun Kumar Das, Tomás Valla:
On Erdős-Szekeres Maker-Breaker games. CCCG 2024: 179-184 - [i3]Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M. Mitra, Bodhayan Roy:
Multipacking in Euclidean Plane. CoRR abs/2411.12351 (2024) - 2023
- [j4]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity results on untangling red-blue matchings. Comput. Geom. 111: 101974 (2023) - [j3]Arun Kumar Das
Approximation algorithms for orthogonal line centers. Discret. Appl. Math. 338: 69-76 (2023) - [c8]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM 2023: 89-100 - 2022
- [c7]Arun Kumar Das
Voronoi Games Using Geodesics. CALDAM 2022: 195-207 - [c6]Arun Kumar Das
Complexity Results on Untangling Red-Blue Matchings. LATIN 2022: 730-745 - [i2]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR abs/2202.11857 (2022) - 2021
- [j2]Arun Kumar Das
Largest triangle inside a terrain. Theor. Comput. Sci. 858: 90-99 (2021) - [j1]Aritra Banik, Arun Kumar Das
Voronoi game on polygons. Theor. Comput. Sci. 882: 125-142 (2021) - [c5]Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Approximation Algorithms for Orthogonal Line Centers. CALDAM 2021: 43-54 - [c4]Sergio Cabello
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS 2021: 258-270 - [i1]Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. CoRR abs/2104.11420 (2021) - 2020
- [c3]Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Approximating k-Orthogonal Line Center. COCOA 2020: 47-60 - [c2]Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. COCOA 2020: 515-529
2010 – 2019
- 2019
- [c1]Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Largest Triangle inside a Terrain. CCCG 2019: 133-138
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 2025-06-02 01:22 CEST 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: