The following pages link to Prosenjit Bose (Q223040):
Displaying 50 items.
- Pattern matching for permutations (Q293263) (← links)
- Probing convex polygons with a wedge (Q340529) (← links)
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Isoperimetric triangular enclosures with a fixed angle (Q375380) (← links)
- Making triangulations 4-connected using flips (Q390117) (← links)
- Triangulating and guarding realistic polygons (Q390140) (← links)
- Minimum-area enclosing triangle with a fixed angle (Q390370) (← links)
- Theta-3 is connected (Q396473) (← links)
- A distribution-sensitive dictionary with low space overhead (Q414433) (← links)
- Skip lift: a probabilistic alternative to red-black trees (Q450539) (← links)
- On bounded degree plane strong geometric spanners (Q450575) (← links)
- Switching to directional antennas with constant increase in radius and hop distance (Q517801) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- Ordered theta graphs (Q598550) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Spanners of additively weighted point sets (Q635742) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- A generalized Winternitz theorem (Q657008) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Guarding polyhedral terrains (Q676572) (← links)
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
- Flips in edge-labelled pseudo-triangulations (Q680154) (← links)
- Stable roommates spanner (Q691764) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- A note on the perimeter of fat objects (Q709064) (← links)
- Biased predecessor search (Q727976) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- Constructing plane spanners of bounded degree and low weight (Q818655) (← links)
- On the spanning and routing ratios of the directed \(\varTheta_6\)-graph (Q832828) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- Improved bounds on the spanning ratio of the theta-5-graph (Q832862) (← links)
- Routing on heavy-path WSPD-spanners (Q832910) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- Geodesic ham-sandwich cuts (Q878384) (← links)
- Reconfiguring triangulations with edge flips and point moves (Q879960) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Towards tight bounds on theta-graphs: more is not always better (Q906396) (← links)
- Flips in planar graphs (Q950400) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Augmented reality on cloth with realistic illumination (Q1008497) (← links)
- Rotationally monotone polygons (Q1025304) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
