Binay K. Bhattacharya

108 papers A* 3A 3B 16C 6Misc 4Journal 49Unranked 27

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Constant work-space algorithms for facility location problems. Discret. Appl. Math. Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2017	J	`jnl`	Rectilinear path problems in restricted memory setup. Discret. Appl. Math. Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2016	J	`jnl`	Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2016	J	`jnl`	Space-efficient algorithm for computing a centerpoint of a set of points in R Theor. Comput. Sci. Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
2016	J	`jnl`	The $p$-Center Problem in Tree Networks Revisited. CoRR Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
2016	—	`conf`	The p-Center Problem in Tree Networks Revisited. SWAT Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
2015	C	`conf`	Approximation Algorithms for Generalized MST and TSP in Grid Clusters. COCOA Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
2015	J	`jnl`	Approximation Algorithms for Generalized MST and TSP in Grid Clusters. CoRR Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
2015	J	`jnl`	Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2015	J	`jnl`	Improved algorithms for computing minmax regret sinks on dynamic path and tree networks. Theor. Comput. Sci. Binay K. Bhattacharya, Tsunehiko Kameda
2015	J	`jnl`	Linear-Time Fitting of a $k$-Step Function. CoRR Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda
2015	—	`conf`	Rectilinear Path Problems in Restricted Memory Setup. CALDAM Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2014	J	`jnl`	A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
2014	Misc	`conf`	Back-Up 2-Center on a Path/Tree/Cycle/Unicycle. COCOON Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song
2014	J	`jnl`	Facility location problems in the constant work-space read-only memory model. CoRR Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2014	C	`conf`	Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network. COCOA Binay K. Bhattacharya, Tsunehiko Kameda
2014	B	`conf`	Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. LATIN Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
2014	J	`jnl`	Improved algorithms to network p-center location problems. Comput. Geom. Binay K. Bhattacharya, Qiaosheng Shi
2014	—	`conf`	Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2014	C	`conf`	Optimizing Squares Covering a Set of Points. COCOA Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song
2014	—	`conf`	Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
2013	J	`jnl`	Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
2012	Misc	`conf`	A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. COCOON Binay K. Bhattacharya, Tsunehiko Kameda
2012	B	`conf`	Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. ISAAC Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song
2012	J	`jnl`	Efficient algorithms for the conditional covering problem. Inf. Comput. Robert Benkoczi, Binay K. Bhattacharya, Yuzhuang Hu, Chien-Hsin Lin, Qiaosheng Shi, Biing-Feng Wang
2012	—	`conf`	k-delivery traveling salesman problem on tree networks. FSTTCS Binay K. Bhattacharya, Yuzhuang Hu
2011	C	`conf`	Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. ICTAC Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi
2010	—	`conf`	Approximation Algorithms for the Multi-Vehicle Scheduling Problem. ISAAC (2) Binay K. Bhattacharya, Yuzhuang Hu
2010	B	`conf`	Computation of Non-dominated Points Using Compact Voronoi Diagrams. WALCOM Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
2010	—	`conf`	Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
2009	Misc	`conf`	Approximation Algorithms for a Network Design Problem. COCOON Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi
2009	J	`jnl`	Collection depots facility location problems in trees. Networks Robert Benkoczi, Binay K. Bhattacharya, Arie Tamir
2009	J	`jnl`	On Finding Non-dominated Points using Compact Voronoi Diagrams CoRR Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
2009	J	`jnl`	Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. Algorithmica Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
2009	J	`jnl`	Optimal movement of mobile sensors for barrier coverage of a planar region. Theor. Comput. Sci. Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese
2009	A	`conf`	Sensor network connectivity with multiple directional antennae of a given angular sum. IPDPS Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Evangelos Kranakis, Danny Krizanc
2009	J	`jnl`	Single facility collection depots location problem in the plane. Comput. Geom. Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
2009	A*	`conf`	Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing. ICRA Binay K. Bhattacharya, Tsunehiko Kameda, John Z. Zhang
2008	—	`conf`	Application of computational geometry to network p-center location problems. CCCG Qiaosheng Shi, Binay K. Bhattacharya
2008	J	`jnl`	Joint cluster analysis of attribute data and relationship data: The connected ACM Trans. Knowl. Discov. Data Rong Ge, Martin Ester, Byron J. Gao, Zengjian Hu, Binay K. Bhattacharya, Boaz Ben-Moshe
2008	C	`conf`	New Upper Bounds on Continuous Tree Edge-Partition Problem. AAIM Robert Benkoczi, Binay K. Bhattacharya, Qiaosheng Shi
2008	J	`jnl`	On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Process. Lett. Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Binay K. Bhattacharya
2008	C	`conf`	Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region. COCOA Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese
2008	B	`conf`	Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. ISAAC Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi
2007	Misc	`conf`	Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov
2007	—	`conf`	Computing a planar widest empty alpha-siphon in o(n CCCG Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi
2007	J	`jnl`	Computing the maximum clique in the visibility graph of a simple polygon. J. Discrete Algorithms Subir Kumar Ghosh, Thomas C. Shermer, Binay K. Bhattacharya, Partha P. Goswami
2007	—	`conf`	Efficient Snap Rounding with Integer Arithmetic. CCCG Binay K. Bhattacharya, Jeff Sember
2007	J	`jnl`	Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
2007	B	`conf`	Optimal Algorithms for the Weighted WADS Binay K. Bhattacharya, Qiaosheng Shi
2006	J	`jnl`	A linear time algorithm to remove winding of a simple polygon. Comput. Geom. Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
2006	B	`conf`	An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees. LATIN Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
2006	—	`conf`	An Optimal Solution to Room Search Problem. CCCG Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Shi, Tsunehiko Kameda
2006	J	`jnl`	Competitive Algorithms for Maintaining a Mobile Center. Mob. Networks Appl. Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
2006	J	`jnl`	Efficient computation of 2-medians in a tree network with positive/negative weights. Discret. Math. Robert Benkoczi, Binay K. Bhattacharya, David Breton
2006	B	`conf`	Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. ISAAC Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
2005	A	`conf`	A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time. ESA Robert Benkoczi, Binay K. Bhattacharya
2005	—	`conf`	Collection depot location problem in the plane. CCCG Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
2005	—	`conf`	Computing the Widest Empty Boomerang. CCCG Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
2005	B	`conf`	Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. ISAAC Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
2005	—	`conf`	Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles. CCCG Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
2005	—	`conf`	Geometric Decision Rules for Instance-Based Learning Problems. PReMI Binay K. Bhattacharya, Kaustav Mukherjee, Godfried T. Toussaint
2003	J	`jnl`	Efficient computation of 2-medians in a tree network with positive/negative weights. Electron. Notes Discret. Math. Robert Benkoczi, Binay K. Bhattacharya, David Breton
2003	B	`conf`	Faster Algorithms for MFCS Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
2002	J	`jnl`	Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
2002	J	`jnl`	Improved Algorithms for Uniform Partitions of Points. Algorithmica Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
2002	—	`conf`	Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
2002	—	`conf`	On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG Binay K. Bhattacharya, Asish Mukhopadhyay
2002	J	`jnl`	Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan
2001	J	`jnl`	Characterizing LR-visibility polygons and related problems. Comput. Geom. Binay K. Bhattacharya, Subir Kumar Ghosh
2001	J	`jnl`	On computing the optimal bridge between two convex polygons. Inf. Process. Lett. Binay K. Bhattacharya, Robert Benkoczi
2001	B	`conf`	Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
2000	A*	`conf`	EODM - A Novel Representation for Collision Detection. ICRA Maria del C. Amézquita Benítez, Kamal K. Gupta, Binay K. Bhattacharya
2000	A	`conf`	Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
2000	—	`conf`	Mobile facility location. DIAL-M Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
1999	J	`jnl`	Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geom. Appl. Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
1999	B	`conf`	Generalized Maximum Independent Sets for Trees in Subquadratic Time. ISAAC Binay K. Bhattacharya, Michael E. Houle
1999	B	`conf`	Output-Sensitive Algorithms for Uniform Partitions of Points. ISAAC Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
1998	—	`conf`	Characterizing lr-visibility polygons and related problems. CCCG Binay K. Bhattacharya, Subir Kumar Ghosh
1998	B	`conf`	Reference set thinning for the k-nearest neighbor decision rule. ICPR Binay K. Bhattacharya, Damon Kaller
1997	J	`jnl`	An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. J. Algorithms Binay K. Bhattacharya, Damon Kaller
1997	—	`conf`	Biased search and k-point clustering. CCCG Binay K. Bhattacharya
1997	J	`jnl`	Computing Maximum Cliques of Circular Arcs in Parallel. Parallel Algorithms Appl. Selim G. Akl, Binay K. Bhattacharya
1997	J	`jnl`	On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms Binay K. Bhattacharya, Sandeep Sen
1996	J	`jnl`	A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. SIAM J. Discret. Math. Binay K. Bhattacharya, Pavol Hell, Jing Huang
1996	J	`jnl`	An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
1995	B	`conf`	Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC Binay K. Bhattacharya, Asish Mukhopadhyay
1994	J	`jnl`	Optimal algorithms for some intersection radius problems. Computing Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert
1993	—	`conf`	Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya
1993	B	`conf`	Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. WADS Pinaki Mitra, Binay K. Bhattacharya
1992	—	`conf`	An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya
1992	J	`jnl`	Computing shortest transversals of sets. Int. J. Comput. Geom. Appl. Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia
1991	B	`conf`	A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. WADS Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
1991	J	`jnl`	A counterexample to a dynamic algorithm for convex hulls of line arrangements. Pattern Recognit. Lett. Binay K. Bhattacharya, Hazel Everett, Godfried T. Toussaint
1991	J	`jnl`	An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window. CVGIP Graph. Model. Image Process. Binay K. Bhattacharya
1991	—	`conf`	Computing Shortest Transversals of Sets (Extended Abstract). SCG Binay K. Bhattacharya, Jurek Czyzowicz, Peter Egyed, Ivan Stojmenovic, Godfried T. Toussaint, Jorge Urrutia
1991	A*	`conf`	Computing Shortest Transversals. ICALP Binay K. Bhattacharya, Godfried T. Toussaint
1991	—	`conf`	Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). SCG Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert
1991	—	`conf`	Usefulness of Angle-Sweep over Line-Sweep. FSTTCS Binay K. Bhattacharya
1989	—	`conf`	Determining Sector Visibility of a Polygon. SCG Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint
1988	—	`conf`	Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao
1988	J	`jnl`	Computing the volume of the union of spheres. Vis. Comput. David Avis, Binay K. Bhattacharya, Hiroshi Imai
1988	J	`jnl`	Fast algorithms for computing the diameter of a finite planar set. Vis. Comput. Binay K. Bhattacharya, Godfried T. Toussaint
1988	J	`jnl`	Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. J. Algorithms Binay K. Bhattacharya, J. Zorbas
1983	J	`jnl`	Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. J. Algorithms Binay K. Bhattacharya, Godfried T. Toussaint
1983	J	`jnl`	Optimal algorithms for computing the minimum distance between two finite planar sets. Pattern Recognit. Lett. Godfried T. Toussaint, Binay K. Bhattacharya
1983	J	`jnl`	Time- and storage-efficient implementation of an optimal planar convex hull algorithm. Image Vis. Comput. Binay K. Bhattacharya, Godfried T. Toussaint
1982	J	`jnl`	A Counterexample to a Diameter Algorithm for Convex Polygons. IEEE Trans. Pattern Anal. Mach. Intell. Binay K. Bhattacharya, Godfried T. Toussaint