Search the dblp DataBase

Publications of Author

1. Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert Haber, John M. Sullivan, Shripad Thite, Yuan Zhou
   Spacetime meshing with adaptive refinement and coarsening. [Citation Graph (0, 0)][DBLP]
   Symposium on Computational Geometry, 2004, pp:300-309 [Conf]
   
2. Jeff Erickson, Shripad Thite, Fred Rothganger, Jean Ponce
   Capturing a convex object with three discs. [Citation Graph (0, 0)][DBLP]
   ICRA, 2003, pp:2242-2247 [Conf]
   
3. Shripad Thite
   Efficient Spacetime Meshing with Nonlocal Cone Constraints. [Citation Graph (0, 0)][DBLP]
   IMR, 2004, pp:47-58 [Conf]
   
4. Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate
   Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. [Citation Graph (0, 0)][DBLP]
   PerCom Workshops, 2006, pp:106-110 [Conf]
   
5. Sheung-Hung Poon, Shripad Thite
   Pants Decomposition of the Punctured Plane [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
6. Shripad Thite
   On Covering a Graph Optimally with Induced Subgraphs [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
7. Shripad Thite
   Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
8. 
   Walking your dog in the woods in polynomial time. [Citation Graph (, )][DBLP]
   
   
9. 
   The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. [Citation Graph (, )][DBLP]
   
   
10. 
    A unified algorithm for adaptive spacetime meshing with nonlocal cone constraints. [Citation Graph (, )][DBLP]
    
    
11. 
    I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. [Citation Graph (, )][DBLP]
    
    
12. 
    Adaptive spacetime meshing for discontinuous Galerkin methods. [Citation Graph (, )][DBLP]
    
    
13. 
    Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. [Citation Graph (, )][DBLP]
    
    
14. 
    Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. [Citation Graph (, )][DBLP]
    
    
15. 
    Distance-2 Edge Coloring is NP-Complete [Citation Graph (, )][DBLP]
    
    
16. 
    Optimum Binary Search Trees on the Hierarchical Memory Model [Citation Graph (, )][DBLP]
    
    
17. 
    Spacetime Meshing for Discontinuous Galerkin Methods [Citation Graph (, )][DBLP]
    
    
18. 
    Efficient Spacetime Meshing with Nonlocal Cone Constraints [Citation Graph (, )][DBLP]
    
    
19. 
    Cache-Oblivious Selection in Sorted X+Y Matrices [Citation Graph (, )][DBLP]