The following pages link to Binay K. Bhattacharya (Q175380):
Displaying 50 items.
- (Q390141) (redirect page) (← links)
- Improved algorithms to network \(p\)-center location problems (Q390143) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- On representing a simple polygon perceivable to a blind person (Q506157) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- The cyclical scheduling problem (Q744050) (← links)
- Computing shortest transversals (Q757096) (← links)
- Computation of spatial skyline points (Q827323) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- Optimal movement of mobile sensors for barrier coverage of a planar region (Q1040594) (← links)
- An upper bound on the probability of misclassification in terms of Matusita's measure of affinity (Q1055121) (← links)
- Fast algorithms for computing the diameter of a finite planar set (Q1104078) (← links)
- Computing the volume of the union of spheres (Q1104079) (← links)
- On the multimodality of distances in convex polygons (Q1165585) (← links)
- (Q1332344) (redirect page) (← links)
- Optimal algorithms for some intersection radius problems (Q1332347) (← links)
- Improved algorithms for uniform partitions of points (Q1348950) (← links)
- (Q1603483) (redirect page) (← links)
- On computing the optimal bridge between two convex polygons. (Q1603485) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Minsum \(k\)-sink problem on dynamic flow path networks (Q1670987) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Efficient reconstruction of binary trees from their transversals (Q2277867) (← links)
- Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
- Minmax-regret evacuation planning for cycle networks (Q2327455) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- On intersecting a set of parallel line segments with a convex polygon of minimum area (Q2380042) (← links)
- Improved algorithms for computing \(k\)-sink on dynamic flow path networks (Q2405281) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- (Q2753927) (← links)
- Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
- A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306) (← links)
- Back-Up 2-Center on a Path/Tree/Cycle/Unicycle (Q2920478) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network (Q2942389) (← links)
- (Q2957510) (← links)
- Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
- Approximation Algorithms for the Multi-Vehicle Scheduling Problem (Q3060773) (← links)
