default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Inkulu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]R. Inkulu
, Pawan Kumar:
Routing Among Convex Polygonal Obstacles in the Plane. Int. J. Found. Comput. Sci. 35(6): 723-739 (2024)- 2023
- [j10]R. Inkulu, Apurv Singh:
Vertex fault-tolerant spanners for weighted points in polygonal domains. Discret. Math. Algorithms Appl. 15(2): 2250074:1-2250074:23 (2023) - 2022
- [j9]Sukanya Bhattacharjee, R. Inkulu:
Vertex Fault-Tolerant Geometric Spanners for Weighted Points. Int. J. Comput. Geom. Appl. 32(3&4): 175-199 (2022) - [j8]Tameem Choudhury, R. Inkulu:
Computing an L1 shortest path among splinegonal obstacles in the plane. J. Comb. Optim. 44(3): 1594-1614 (2022) - [j7]Sanjana Agrawal, R. Inkulu:
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane. J. Comb. Optim. 44(4): 3056-3082 (2022) - [e1]Niranjan Balachandran, R. Inkulu:
Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings. Lecture Notes in Computer Science 13179, Springer 2022, ISBN 978-3-030-95017-0 [contents] - 2021
- [j6]Debangshu Banerjee, R. Inkulu:
Vertex Guarding for Dynamic Orthogonal Art Galleries. Int. J. Comput. Geom. Appl. 31(2-3): 123-140 (2021) - [c14]R. Inkulu, Pawan Kumar:
Routing Among Convex Polygonal Obstacles in the Plane. COCOA 2021: 1-11 - [i13]R. Inkulu, Apurv Singh:
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains. CoRR abs/2103.05931 (2021) - 2020
- [j5]R. Inkulu, K. Sowmya, Nitish P. Thakur:
Dynamic Algorithms for Visibility Polygons in Simple Polygons. Int. J. Comput. Geom. Appl. 30(1): 51-78 (2020) - [c13]R. Inkulu, Apurv Singh:
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains. COCOA 2020: 471-485 - [c12]Sanjana Agrawal, R. Inkulu:
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane. COCOON 2020: 136-148 - [i12]Debangshu Banerjee, R. Inkulu:
Vertex guarding for dynamic orthogonal art galleries. CoRR abs/2006.16651 (2020) - [i11]Sukanya Bhattacharjee, R. Inkulu:
Vertex Fault-Tolerant Geometric Spanners for Weighted Points. CoRR abs/2011.03354 (2020) - [i10]Sanjana Agrawal, R. Inkulu:
Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane. CoRR abs/2011.09925 (2020)
2010 – 2019
- 2019
- [j4]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum weight connectivity augmentation for planar straight-line graphs. Theor. Comput. Sci. 789: 50-63 (2019) - [c11]Sukanya Bhattacharjee, R. Inkulu:
Fault-Tolerant Additive Weighted Geometric Spanners. CALDAM 2019: 29-41 - [c10]Tameem Choudhury, R. Inkulu:
Maintaining the Visibility Graph of a Dynamic Simple Polygon. CALDAM 2019: 42-52 - [c9]Sukanya Bhattacharjee, R. Inkulu:
Geodesic Fault-Tolerant Additive Weighted Spanners. COCOON 2019: 38-51 - [c8]R. Inkulu, Sanjiv Kapoor:
Approximate Euclidean Shortest Paths in Polygonal Domains. ISAAC 2019: 11:1-11:17 - 2018
- [c7]Tameem Choudhury, R. Inkulu:
Computing a Rectilinear Shortest Path amid Splinegons in Plane. COCOA 2018: 169-182 - 2017
- [c6]R. Inkulu, Nitish P. Thakur:
Incremental Algorithms to Update Visibility Polygons. CALDAM 2017: 205-218 - [c5]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. WALCOM 2017: 204-216 - [i9]R. Inkulu, K. Sowmya:
Dynamic algorithms for visibility polygons. CoRR abs/1704.08219 (2017) - [i8]R. Inkulu, Sukanya Bhattacharjee:
Fault-Tolerant Additive Weighted Geometric Spanners. CoRR abs/1709.01061 (2017) - [i7]Tameem Choudhury, R. Inkulu:
Computing a rectilinear shortest path amid splinegons in plane. CoRR abs/1711.11524 (2017) - 2016
- [j3]Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-point L1 shortest path queries in the plane. J. Comput. Geom. 7(1): 473-519 (2016) - [i6]Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston:
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. CoRR abs/1612.04780 (2016) - 2015
- [i5]Rajasekhar Inkulu, Sanjiv Kapoor:
A polynomial time algorithm for finding an approximate shortest path amid weighted regions. CoRR abs/1501.00340 (2015) - [i4]Rajasekhar Inkulu, Sanjiv Kapoor:
Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles. CoRR abs/1506.01769 (2015) - 2014
- [c4]Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-Point L1 Shortest Path Queries in the Plane. SoCG 2014: 406-416 - [i3]Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-Point L1 Shortest Path Queries in the Plane. CoRR abs/1403.3458 (2014) - 2010
- [i2]Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari:
A near optimal algorithm for finding Euclidean shortest path in polygonal domain. CoRR abs/1011.6481 (2010) - [i1]Rajasekhar Inkulu, Sanjiv Kapoor:
Approximate Shortest Path through a Weighted Planar Subdivision. CoRR abs/1011.6498 (2010)
2000 – 2009
- 2009
- [j2]Rajasekhar Inkulu, Sanjiv Kapoor:
Visibility queries in a polygonal region. Comput. Geom. 42(9): 852-864 (2009) - [j1]Rajasekhar Inkulu, Sanjiv Kapoor:
Planar rectilinear shortest path computation using corridors. Comput. Geom. 42(9): 873-884 (2009) - [c3]Milind Kulkarni, Martin Burtscher, Rajasekhar Inkulu, Keshav Pingali, Calin Cascaval:
How much parallelism is there in irregular applications? PPoPP 2009: 3-14 - 2007
- [c2]Rajasekhar Inkulu, Sanjiv Kapoor:
Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. FSTTCS 2007: 412-423 - 2001
- [c1]Karen Daniels, Rajasekhar Inkulu:
Translational polygon covering using intersection graphs. CCCG 2001: 61-64
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-23 20:36 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:
