R. Inkulu
Associate Professor
Department of Computer Science & Engineering
IIT Guwahati
, India
rinkulu AT iitg.ac.in
Interests: Algorithms, Computational Geometry
T. Choudhury, R. Inkulu: Computing a rectilinear shortest path amid splinegons.
[
arXiv
]
R. Inkulu, B. Sukanya: Fault-tolerant additive weighted geometric spanners.
[
arXiv
]
R. Inkulu, K. Sowmya: Dynamic algorithms for visibility polygons in simple polygons.
[
arXiv
]
R. Inkulu, S. Kapoor: Approximate Euclidean shortest paths amid polygonal obstacles.
[
arXiv
]
R. Inkulu, S. Kapoor: A polynomial time algorithm for finding an approximate shortest path amid weighted regions.
[
arXiv
]
R. Inkulu, N. P. Thakur: Incremental algorithms to update visibility polygons.
[
CALDAM: 205-218, 2017
]
H. Akitaya, R. Inkulu, T. Nichols, D. Souvaine, C. Toth: Minimum weight connectivity augmentation for PSLGs.
[
FWCG, 2016
] [
WALCOM: 204-216, 2017
] [
arXiv
(invited to TCS)]
D. Z. Chen, R. Inkulu, H. Wang: Two-point rectilinear shortest path queries in the plane.
[
SoCG: 406-415, 2014
] [
JoCG 7(1): 473-519, 2016
(invited)]
R. Inkulu, S. Kapoor, S. N. Maheshwari: A near optimal algorithm for finding Euclidean shortest path in polygonal domain.
[
arXiv
(manuscript)]
R. Inkulu, S. Kapoor: Visibility queries in a polygonal region.
[
CGTA 42(9): 852-864, 2009
]
M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, C. Cascaval: How much parallelism is there in irregular applications?.
[
PPoPP: 3-14, 2009
]
K. Daniels, R. Inkulu: Translational polygon covering using intersection graphs.
[
CCCG: 61-64, 2007
]
R. Inkulu, S. Kapoor: Planar rectilinear shortest path computation using corridors.
[
FSTTCS: 412-423, 2007
] [
CGTA 42(9): 873-884, 2009
]
Grants that supported some of these works:
Science & Engineering Reseach Board (SERB MATRICS grant MTR/2017/000474), "Approximate geodesic nearest neighbors and shortest paths", 2018-2020.
National Board for Higher Mathematics (NBHM grant 248(17)2014-R&D-II/1049), "Tradeoffs in geometric shortest path algorithms", 2015-2017.
IITG seed grant, "Algorithms for shortest paths in polygonal regions", 2011-2013.
Courses that I normally offer:
Discrete Mathematics
Data Structures
Algorithms
(Spring 2018)
Computational Geometry
Combinatorial Optimization
Faculty, IIT Guwahati, since 2010.
Postdoc, UTexas at Austin, 2007-2010.
Ph.D.
, IIT Chicago, Jan 2004-June 2007.
Software
developer
for six+ years.
M.Tech., IIT Kharagpur.
Organizing committee chair to
CALDAM 2018
,
FSTTCS 2013
and
WGGA 2011
at IITG.