Binay K. Bhattacharya

From MaRDI portal
Person:175380

Available identifiers

zbMath Open bhattacharya.binay-kumarWikidataQ102251590 ScholiaQ102251590MaRDI QIDQ175380

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q58755882023-02-03Paper
Efficient approximate shortest-path queries among isothetic rectangular obstacles2023-01-18Paper
An efficient algorithm for the proximity connected two center problem2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50910042022-07-21Paper
The weighted \(k\)-center problem in trees for fixed \(k\)2022-02-21Paper
Computation of spatial skyline points2021-01-07Paper
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms2021-01-07Paper
Constant work-space algorithms for facility location problems2020-06-29Paper
Linear-time fitting of a \(k\)-step function2020-05-18Paper
Minsum \(k\)-sink problem on path networks2020-01-16Paper
Minmax-regret evacuation planning for cycle networks2019-10-15Paper
Minsum \(k\)-sink problem on dynamic flow path networks2018-09-06Paper
Optimizing squares covering a set of points2018-05-17Paper
The bilinear assignment problem: complexity and polynomially solvable special cases2017-12-01Paper
The $p$-Center Problem in Tree Networks Revisited2017-10-17Paper
Improved algorithms for computing \(k\)-sink on dynamic flow path networks2017-09-22Paper
Rectilinear path problems in restricted memory setup2017-06-19Paper
Geometric p-Center Problems with Centers Constrained to Two Lines2017-02-01Paper
On representing a simple polygon perceivable to a blind person2017-01-31Paper
https://portal.mardi4nfdi.de/entity/Q29575102017-01-26Paper
Linear-Time Fitting of a k-Step Function2016-03-23Paper
Approximation Algorithms for Generalized MST and TSP in Grid Clusters2016-02-05Paper
Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)2016-01-21Paper
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks2015-12-11Paper
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks2015-09-21Paper
Optimizing Squares Covering a Set of Points2015-09-11Paper
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network2015-09-11Paper
Rectilinear Path Problems in Restricted Memory Setup2015-02-19Paper
A linear time algorithm for computing minmax regret 1-median on a tree network2015-01-19Paper
The cyclical scheduling problem2014-10-06Paper
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle2014-09-26Paper
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles2014-03-31Paper
Improved algorithms to network \(p\)-center location problems2014-01-22Paper
The Cyclical Scheduling Problem2013-04-12Paper
Some variations on constrained minimum enclosing circle problem2013-03-25Paper
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights2013-03-21Paper
Efficient algorithms for the conditional covering problem2012-11-27Paper
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree2012-09-25Paper
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand2012-01-06Paper
Some Variations on Constrained Minimum Enclosing Circle Problem2011-01-08Paper
Approximation Algorithms for the Multi-Vehicle Scheduling Problem2010-12-09Paper
On intersecting a set of parallel line segments with a convex polygon of minimum area2010-03-24Paper
Computation of Non-dominated Points Using Compact Voronoi Diagrams2010-02-09Paper
Discrete and Computational Geometry2010-02-05Paper
Optimal movement of mobile sensors for barrier coverage of a planar region2009-11-25Paper
Optimal algorithms for the path/tree-shaped facility location problems in trees2009-10-23Paper
Collection depots facility location problems in trees2009-07-28Paper
Approximation Algorithms for a Network Design Problem2009-07-23Paper
Single facility collection depots location problem in the plane2009-06-18Paper
Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p2009-02-17Paper
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times2009-01-29Paper
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region2009-01-27Paper
An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees2008-09-18Paper
New Upper Bounds on Continuous Tree Edge-Partition Problem2008-07-10Paper
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees2008-04-24Paper
Computing the maximum clique in the visibility graph of a simple polygon2008-01-11Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Efficient algorithms for center problems in cactus networks2007-07-09Paper
Efficient computation of 2-medians in a tree network with positive/negative weights2007-05-29Paper
Algorithms and Computation2006-11-14Paper
Efficient computation of 2-medians in a tree network with positive/negative weights2006-08-04Paper
Algorithms – ESA 20052006-06-27Paper
A linear time algorithm to remove winding of a simple polygon2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q47791202002-11-24Paper
Optimally computing a shortest weakly visible line segment inside a simple polygon2002-09-03Paper
On computing the optimal bridge between two convex polygons.2002-07-14Paper
Efficient algorithms for centers and medians in interval and circular-arc graphs2002-07-01Paper
Improved algorithms for uniform partitions of points2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q27539272001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45112442001-08-12Paper
Characterizing LR-visibility polygons and related problems2001-04-24Paper
https://portal.mardi4nfdi.de/entity/Q45112412001-03-06Paper
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON2000-11-07Paper
Optimal algorithms for some intersection radius problems1999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42566511999-08-08Paper
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm1998-09-27Paper
AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs1998-05-25Paper
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs1997-01-22Paper
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons1996-12-11Paper
An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window1994-08-29Paper
COMPUTING SHORTEST TRANSVERSALS OF SETS1993-11-26Paper
https://portal.mardi4nfdi.de/entity/Q40366011993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374371993-05-18Paper
Computing shortest transversals1991-01-01Paper
Efficient reconstruction of binary trees from their transversals1989-01-01Paper
Fast algorithms for computing the diameter of a finite planar set1988-01-01Paper
Computing the volume of the union of spheres1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967531988-01-01Paper
Solving the two-dimensional findpath problem using a line-triangle representation of the robot1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37797441987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37163291985-01-01Paper
A new linear convex hull algorithm for simple polygons (Corresp.)1984-01-01Paper
Optimal algorithms for computing the minimum distance between two finite planar sets1983-01-01Paper
Efficient algorithms for computing the maximum distance between two finite planar sets1983-01-01Paper
An upper bound on the probability of misclassification in terms of Matusita's measure of affinity1982-01-01Paper
On the multimodality of distances in convex polygons1982-01-01Paper
A Counterexample to a Diameter Algorithm for Convex Polygons1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Binay K. Bhattacharya