default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShripad Thite
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j6]Erin W. Chambers
, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite:
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. Comput. Geom. 43(3): 295-311 (2010)- [j5]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. 43(5): 493-513 (2010)
2000 – 2009
- 2009
- [j4]Shripad Thite:
Adaptive spacetime meshing for discontinuous Galerkin methods. Comput. Geom. 42(1): 20-44 (2009) - 2008
- [j3]Mark de Berg, Shripad Thite:
Cache-oblivious selection in sorted X. Inf. Process. Lett. 109(2): 87-92 (2008) - [c7]Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite:
Walking your dog in the woods in polynomial time. SCG 2008: 101-109 - [c6]Boris Aronov, Mark de Berg, Shripad Thite:
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. ESA 2008: 100-111 - [i9]Mark de Berg, Shripad Thite:
Cache-Oblivious Selection in Sorted X+Y Matrices. CoRR abs/0804.0936 (2008) - [i8]Shripad Thite:
Optimum Binary Search Trees on the Hierarchical Memory Model. CoRR abs/0804.0940 (2008) - [i7]Shripad Thite:
Spacetime Meshing for Discontinuous Galerkin Methods. CoRR abs/0804.0942 (2008) - [i6]Shripad Thite:
Efficient Spacetime Meshing with Nonlocal Cone Constraints. CoRR abs/0804.0946 (2008) - 2007
- [j2]Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce:
Capturing a Convex Object With Three Discs. IEEE Trans. Robotics 23(6): 1133-1140 (2007) - [c5]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC 2007: 500-511 - 2006
- [c4]Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate:
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. PerCom Workshops 2006: 106-110 - [i5]Sheung-Hung Poon, Shripad Thite:
Pants Decomposition of the Punctured Plane. CoRR abs/cs/0602080 (2006) - [i4]Shripad Thite:
On Covering a Graph Optimally with Induced Subgraphs. CoRR abs/cs/0604013 (2006) - [i3]Shripad Thite:
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements. CoRR abs/cs/0606038 (2006) - 2005
- [b1]Shripad Thite:
Spacetime Meshing for Discontinuous Galerkin Methods. University of Illinois Urbana-Champaign, USA, 2005 - [i2]Shripad Thite:
A unified algorithm for adaptive spacetime meshing with nonlocal cone constraints. EuroCG 2005: 1-4 - [i1]Jeff Erickson, Shripad Thite, David P. Bunde:
Distance-2 Edge Coloring is NP-Complete. CoRR abs/cs/0509100 (2005) - 2004
- [j1]Hari Balakrishnan, Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite:
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks. IEEE J. Sel. Areas Commun. 22(6): 1069-1079 (2004) - [c3]Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert B. Haber, John M. Sullivan, Shripad Thite, Yuan Zhou:
Spacetime meshing with adaptive refinement and coarsening. SCG 2004: 300-309 - [c2]Shripad Thite:
Efficient Spacetime Meshing with Nonlocal Cone Constraints. IMR 2004: 47-58 - 2003
- [c1]Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce:
Capturing a convex object with three discs. ICRA 2003: 2242-2247
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-08-23 18:33 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:
