Shripad Thite

According to our database, Shripad Thite authored at least 21 papers between 2004 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2010

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time.

Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite

Comput. Geom., 2010

Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions.

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma

Comput. Geom., 2010

2009

Adaptive spacetime meshing for discontinuous Galerkin methods.

Shripad Thite

Comput. Geom., 2009

2008

Cache-oblivious selection in sorted X.

Mark de Berg, Shripad Thite

Inf. Process. Lett., 2008

Spacetime Meshing for Discontinuous Galerkin Methods

Shripad Thite

CoRR, 2008

Optimum Binary Search Trees on the Hierarchical Memory Model

Shripad Thite

CoRR, 2008

Cache-Oblivious Selection in Sorted X+Y Matrices

Mark de Berg, Shripad Thite

CoRR, 2008

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains.

Boris Aronov, Mark de Berg, Shripad Thite

Proceedings of the Algorithms, 2008

Walking your dog in the woods in polynomial time.

Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Capturing a Convex Object With Three Discs.

Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce

IEEE Trans. Robotics, 2007

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements

Shripad Thite

CoRR, 2006

On Covering a Graph Optimally with Induced Subgraphs

Shripad Thite

CoRR, 2006

Pants Decomposition of the Punctured Plane

Sheung-Hung Poon, Shripad Thite

CoRR, 2006

Strong Edge Coloring for Channel Assignment in Wireless Radio Networks.

Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

2005

Spacetime Meshing for Discontinuous Galerkin Methods

Shripad Thite

PhD thesis, 2005

Distance-2 Edge Coloring is NP-Complete

Jeff Erickson, Shripad Thite, David P. Bunde

CoRR, 2005

A unified algorithm for adaptive spacetime meshing with nonlocal cone constraints.

Shripad Thite

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks.

Hari Balakrishnan, Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite

IEEE J. Sel. Areas Commun., 2004

Efficient Spacetime Meshing with Nonlocal Cone Constraints.

Shripad Thite

Proceedings of the 13th International Meshing Roundtable, 2004

Spacetime meshing with adaptive refinement and coarsening.

Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert B. Haber, John M. Sullivan, Shripad Thite, Yuan Zhou

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004