The following pages link to Binay Bhattacharya (Q175380):
Displaying 50 items.
- Approximation Algorithms for the Multi-Vehicle Scheduling Problem (Q3060773) (← links)
- Some Variations on Constrained Minimum Enclosing Circle Problem (Q3066170) (← links)
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
- COMPUTING SHORTEST TRANSVERSALS OF SETS (Q3136222) (← links)
- Optimal algorithms for computing the minimum distance between two finite planar sets (Q3311702) (← links)
- A new linear convex hull algorithm for simple polygons (Corresp.) (Q3313273) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- Computation of Non-dominated Points Using Compact Voronoi Diagrams (Q3404431) (← links)
- Approximation Algorithms for Generalized MST and TSP in Grid Clusters (Q3467839) (← links)
- New Upper Bounds on Continuous Tree Edge-Partition Problem (Q3511413) (← links)
- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees (Q3525757) (← links)
- Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times (Q3597881) (← links)
- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p (Q3603555) (← links)
- (Q3716329) (← links)
- (Q3779744) (← links)
- (Q3796753) (← links)
- Solving the two-dimensional findpath problem using a line-triangle representation of the robot (Q3813337) (← links)
- A Counterexample to a Diameter Algorithm for Convex Polygons (Q3933768) (← links)
- (Q4036601) (← links)
- (Q4037437) (← links)
- (Q4256651) (← links)
- An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window (Q4303749) (← links)
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm (Q4366880) (← links)
- AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (Q4373007) (← links)
- (Q4511241) (← links)
- (Q4511244) (← links)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
- Efficient algorithms for computing the maximum distance between two finite planar sets (Q4747526) (← links)
- (Q4779120) (← links)
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons (Q4876693) (← links)
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs (Q4881292) (← links)
- Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights (Q4909575) (← links)
- The Cyclical Scheduling Problem (Q4914450) (← links)
- Efficient approximate shortest-path queries among isothetic rectangular obstacles (Q5060142) (← links)
- (Q5091004) (← links)
- Rectilinear Path Problems in Restricted Memory Setup (Q5174950) (← links)
- Collection depots facility location problems in trees (Q5191128) (← links)
- Approximation Algorithms for a Network Design Problem (Q5323067) (← links)
- The $p$-Center Problem in Tree Networks Revisited (Q5369508) (← links)
- Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles (Q5405052) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431308) (← links)
- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees (Q5459133) (← links)
- Algorithms – ESA 2005 (Q5475839) (← links)
- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region (Q5505648) (← links)
- (Q5875588) (← links)
- Discrete and Computational Geometry (Q5897091) (← links)
- Algorithms and Computation (Q5897902) (← links)
- Efficient computation of 2-medians in a tree network with positive/negative weights (Q5899357) (← links)
- Efficient computation of 2-medians in a tree network with positive/negative weights (Q5920599) (← links)
