I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Inkulu, Rajasekhar
11
results:
Online X
Search for persons
X
Format
Online (11)
Mediatypes
Articles (Online) (3)
Bookchapter (Online) (1)
OpenAccess-fulltext (7)
Sorted by: Relevance
Sorted by: Year
?
1
Minimum weight connectivity augmentation for planar straigh..:
Akitaya, Hugo A.
;
Inkulu, Rajasekhar
;
Nichols, Torrie L.
...
Theoretical Computer Science. 789 (2019) - p. 50-63 , 2019
Link:
https://doi.org/10.1016/..
?
2
Two-Point L1 Shortest Path Queries in the Plane:
, In:
Proceedings of the thirtieth annual symposium on Computational geometry
,
Chen, Danny Z.
;
Inkulu, Rajasekhar
;
Wang, Haitao
- p. 406-415 , 2014
Link:
https://dl.acm.org/doi/1..
?
3
Visibility queries in a polygonal region:
Inkulu, Rajasekhar
;
Kapoor, Sanjiv
Computational Geometry. 42 (2009) 9 - p. 852-864 , 2009
Link:
https://doi.org/10.1016/..
?
4
Planar rectilinear shortest path computation using corridor:
Inkulu, Rajasekhar
;
Kapoor, Sanjiv
Computational Geometry. 42 (2009) 9 - p. 873-884 , 2009
Link:
https://doi.org/10.1016/..
?
5
Two-point L1 shortest path queries in the plane:
Chen, Danny Z
;
Inkulu, Rajasekhar
;
Wang, Haitao
https://jocg.org/index.php/jocg/article/view/3024/2738. , 2016
Link:
https://jocg.org/index.p..
?
6
Minimum Weight Connectivity Augmentation for Planar Straigh..:
Akitaya, Hugo A
;
Inkulu, Rajasekhar
;
Nichols, Torrie L
...
http://arxiv.org/abs/1612.04780. , 2016
Link:
http://arxiv.org/abs/161..
?
7
Two-Point $L_1$ Shortest Path Queries in the Plane:
Chen, Danny Z
;
Inkulu, Rajasekhar
;
Wang, Haitao
http://arxiv.org/abs/1403.3458. , 2014
Link:
http://arxiv.org/abs/140..
?
8
ANN queries: covering Voronoi diagram with hyperboxes:
Inkulu, Rajasekhar
;
Kapoor, Sanjiv
http://arxiv.org/abs/1111.5893. , 2011
Link:
http://arxiv.org/abs/111..
?
9
Approximate Shortest Path through a Weighted Planar Subdivi..:
Inkulu, Rajasekhar
;
Kapoor, Sanjiv
http://arxiv.org/abs/1011.6498. , 2010
Link:
http://arxiv.org/abs/101..
?
10
A near optimal algorithm for finding Euclidean shortest pat..:
Inkulu, Rajasekhar
;
Kapoor, Sanjiv
;
Maheshwari, S. N
http://arxiv.org/abs/1011.6481. , 2010
Link:
http://arxiv.org/abs/101..
?
11
Two-point L1 shortest path queries in the plane:
Danny Z. Chen
;
Rajasekhar Inkulu
;
Haitao Wang
http://jocg.org/index.php/jocg/article/view/293. , 2016
Link:
https://doi.org/10.20382..
1-11