Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- R. Inkulu
aka: Rajasekhar Inkulu
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 42 matches
- 2024
- M. Eswaran, Anil Kumar Inkulu, Kaartick Tamilarasan, M. V. A. Raju Bahubalendruni, R. Jaideep, Muhammad Selmanul Faris, Nidhin Jacob:
Optimal layout planning for human robot collaborative assembly systems and visualization through immersive technologies. Expert Syst. Appl. 241: 122465 (2024) - 2023
- Anil Kumar Inkulu, M. V. A. Raju Bahubalendruni:
Optimal resource allocation for multiple shop floor tasks in collaborative assembly. Comput. Ind. Eng. 185: 109695 (2023) - 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) - M. Eswaran, Anil Kumar Gulivindala, Anil Kumar Inkulu, M. V. A. Raju Bahubalendruni:
Augmented reality-based guidance in product assembly and maintenance/repair perspective: A state of the art review on challenges and opportunities. Expert Syst. Appl. 213(Part): 118983 (2023) - 2022
- Sukanya Bhattacharjee, R. Inkulu:
Vertex Fault-Tolerant Geometric Spanners for Weighted Points. Int. J. Comput. Geom. Appl. 32(3&4): 175-199 (2022) - Anil Kumar Inkulu, M. V. A. Raju Bahubalendruni, Ashok Dara, K. Sankaranarayanasamy:
Challenges and opportunities in human robot collaboration context of Industry 4.0 - a state of the art review. Ind. Robot 49(2): 226-239 (2022) - Sanjana Agrawal, R. Inkulu:
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane. J. Comb. Optim. 44(4): 3056-3082 (2022) - Tameem Choudhury, R. Inkulu:
Computing an L1 shortest path among splinegonal obstacles in the plane. J. Comb. Optim. 44(3): 1594-1614 (2022) - 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
- Debangshu Banerjee, R. Inkulu:
Vertex Guarding for Dynamic Orthogonal Art Galleries. Int. J. Comput. Geom. Appl. 31(2-3): 123-140 (2021) - R. Inkulu, Pawan Kumar:
Routing Among Convex Polygonal Obstacles in the Plane. COCOA 2021: 1-11 - R. Inkulu, Apurv Singh:
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains. CoRR abs/2103.05931 (2021) - 2020
- 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) - R. Inkulu, Apurv Singh:
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains. COCOA 2020: 471-485 - Sanjana Agrawal, R. Inkulu:
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane. COCOON 2020: 136-148 - Debangshu Banerjee, R. Inkulu:
Vertex guarding for dynamic orthogonal art galleries. CoRR abs/2006.16651 (2020) - Sukanya Bhattacharjee, R. Inkulu:
Vertex Fault-Tolerant Geometric Spanners for Weighted Points. CoRR abs/2011.03354 (2020) - Sanjana Agrawal, R. Inkulu:
Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane. CoRR abs/2011.09925 (2020) - 2019
- 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) - Sukanya Bhattacharjee, R. Inkulu:
Fault-Tolerant Additive Weighted Geometric Spanners. CALDAM 2019: 29-41 - Tameem Choudhury, R. Inkulu:
Maintaining the Visibility Graph of a Dynamic Simple Polygon. CALDAM 2019: 42-52 - Sukanya Bhattacharjee, R. Inkulu:
Geodesic Fault-Tolerant Additive Weighted Spanners. COCOON 2019: 38-51 - R. Inkulu, Sanjiv Kapoor:
Approximate Euclidean Shortest Paths in Polygonal Domains. ISAAC 2019: 11:1-11:17 - 2018
- Tameem Choudhury, R. Inkulu:
Computing a Rectilinear Shortest Path amid Splinegons in Plane. COCOA 2018: 169-182 - 2017
- R. Inkulu, Nitish P. Thakur:
Incremental Algorithms to Update Visibility Polygons. CALDAM 2017: 205-218 - 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 - R. Inkulu, K. Sowmya:
Dynamic algorithms for visibility polygons. CoRR abs/1704.08219 (2017) - R. Inkulu, Sukanya Bhattacharjee:
Fault-Tolerant Additive Weighted Geometric Spanners. CoRR abs/1709.01061 (2017) - Tameem Choudhury, R. Inkulu:
Computing a rectilinear shortest path amid splinegons in plane. CoRR abs/1711.11524 (2017) - 2016
- Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-point L1 shortest path queries in the plane. J. Comput. Geom. 7(1): 473-519 (2016)
skipping 12 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-08-14 20:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint