default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSwami Sarvattomananda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Sandip Das, Subhadeep Ranjan Dev
, Swami Sarvattomananda:
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes. Discret. Appl. Math. 350: 44-61 (2024)- 2023
- [c9]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM 2023: 89-100 - 2022
- [j7]Swami Sarvattamananda, Sudebkumar Prasant Pal:
Preface: CALDAM 2019. Discret. Appl. Math. 319: 1 (2022) - [c8]Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Voronoi Games Using Geodesics. CALDAM 2022: 195-207 - 2021
- [j6]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. Discret. Appl. Math. 305: 311-328 (2021) - [j5]Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Voronoi game on polygons. Theor. Comput. Sci. 882: 125-142 (2021) - [c7]Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda:
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. CALDAM 2021: 179-195 - 2020
- [j4]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints. Discret. Appl. Math. 280: 71-85 (2020) - [j3]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Optimizing movement in convex and non-convex path-networks to establish connectivity. Discret. Appl. Math. 286: 62-77 (2020) - [c6]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
- 2018
- [c5]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. CALDAM 2018: 283-300 - [i4]Sandip Das, Swami Sarvottamananda:
Computing the Minkowski Sum of Convex Polytopes in Rd. CoRR abs/1811.05812 (2018) - 2017
- [c4]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity. CALDAM 2017: 141-155 - 2016
- [c3]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints. CALDAM 2016: 126-138 - [c2]Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function. FAW 2016: 41-52 - 2013
- [j2]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013) - [i3]Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda:
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon. CoRR abs/1304.4320 (2013) - 2012
- [j1]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. 28(12): 1229-1237 (2012) - 2011
- [i2]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized Geometric Query Problems. CoRR abs/1111.2918 (2011) - 2010
- [i1]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010)
2000 – 2009
- 2009
- [c1]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58
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-06-03 00:12 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:
