Sanjiv Kapoor

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Rajasekhar Inkulu

> Home > Persons > Sanjiv Kapoor

Publications

2019
[c44]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/isaac/InkuluK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/InkuluK19
R. Inkulu, Sanjiv Kapoor:
Approximate Euclidean Shortest Paths in Polygonal Domains. ISAAC 2019: 11:1-11:17
2015
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/InkuluK15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/InkuluK15
Rajasekhar Inkulu, Sanjiv Kapoor:
A polynomial time algorithm for finding an approximate shortest path amid weighted regions. CoRR abs/1501.00340 (2015)
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/InkuluK15a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/InkuluK15a
Rajasekhar Inkulu, Sanjiv Kapoor:
Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles. CoRR abs/1506.01769 (2015)
2010
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1011-6481
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1011-6481
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]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1011-6498
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1011-6498
Rajasekhar Inkulu, Sanjiv Kapoor:
Approximate Shortest Path through a Weighted Planar Subdivision. CoRR abs/1011.6498 (2010)
2009
[j18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/comgeo/InkuluK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/InkuluK09
Rajasekhar Inkulu, Sanjiv Kapoor:
Visibility queries in a polygonal region. Comput. Geom. 42(9): 852-864 (2009)
[j17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/comgeo/InkuluK09a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/InkuluK09a
Rajasekhar Inkulu, Sanjiv Kapoor:
Planar rectilinear shortest path computation using corridors. Comput. Geom. 42(9): 873-884 (2009)
2007
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/fsttcs/InkuluK07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/InkuluK07
Rajasekhar Inkulu, Sanjiv Kapoor:
Finding a Rectilinear Shortest Path in R² Using Corridor Based Staircase Structures. FSTTCS 2007: 412-423

a service of

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.