Sandip Das

According to our database, Sandip Das authored at least 157 papers between 1989 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Cops and Robber on butterflies, grids, and AT-free graphs.

Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat

Discret. Appl. Math., March, 2024

Growth Rate of the Number of Empty Triangles in the Plane.

Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Approximation algorithms for orthogonal line centers.

Arun Kumar Das, Sandip Das, Joydeep Mukherjee

Discret. Appl. Math., October, 2023

Triangle-free projective-planar graphs with diameter two: Domination and characterization.

Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen

Discret. Appl. Math., May, 2023

Complexity results on untangling red-blue matchings.

Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier

Comput. Geom., April, 2023

On clique numbers of colored mixed graphs.

Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen

Discret. Appl. Math., 2023

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs.

Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee

CoRR, 2023

Approximation algorithm for finding multipacking on Cactus.

Sandip Das, Sk Samim Islam

CoRR, 2023

Burning a binary tree and its generalization.

Sandip Das, Sk Samim Islam, Ritam M. Mitra, Sanchita Paul

CoRR, 2023

An update on (n, m)-chromatic numbers.

Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni

CoRR, 2023

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs.

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev

CoRR, 2023

A Homomorphic Polynomial for Oriented Graphs.

Sandip Das, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen

Electron. J. Comb., 2023

Cops and Robber on Oriented Graphs with Respect to Push Operation.

Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs.

Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane.

Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

The weighted <i>k</i>-center problem in trees for fixed <i>k</i>.

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev

Theor. Comput. Sci., 2022

On the signed chromatic number of some classes of graphs.

Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena

Discret. Math., 2022

Bumblebee visitation problem.

Sandip Das, Harmender Gahlawat

Discret. Appl. Math., 2022

On fractional version of oriented coloring.

Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen

Discret. Appl. Math., 2022

Preface: CALDAM 2020.

Manoj Changat, Sandip Das

Discret. Appl. Math., 2022

Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings.

Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier

CoRR, 2022

On dominating set of some subclasses of string graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee

Comput. Geom., 2022

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond.

Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

On the Cop Number of String Graphs.

Sandip Das, Harmender Gahlawat

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Voronoi Games Using Geodesics.

Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Cops and Robber on some families of oriented graphs.

Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen

Theor. Comput. Sci., 2021

Largest triangle inside a terrain.

Arun Kumar Das, Sandip Das, Joydeep Mukherjee

Theor. Comput. Sci., 2021

Voronoi game on polygons.

Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda

Theor. Comput. Sci., 2021

Oriented bipartite graphs and the Goldbach graph.

Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen

Discret. Math., 2021

Pushable chromatic number of graphs with degree constraints.

Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena

Discret. Math., 2021

Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Discret. Appl. Math., 2021

Variations of cops and robbers game on grids.

Sandip Das, Harmender Gahlawat

Discret. Appl. Math., 2021

On rectangle intersection graphs with stab number at most two.

Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen

Discret. Appl. Math., 2021

Computation of spatial skyline points.

Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink

Comput. Geom., 2021

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time.

Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs.

Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes.

Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

Cops and Robber on Butterflies and Solid Grids.

Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Discret. Appl. Math., 2020

Relative clique number of planar signed graphs.

Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen

Discret. Appl. Math., 2020

Linear-time fitting of a k-step function.

Binay Bhattacharya, Sandip Das, Tsunehiko Kameda

Discret. Appl. Math., 2020

Optimizing movement in convex and non-convex path-networks to establish connectivity.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Discret. Appl. Math., 2020

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs.

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Approximating k-Orthogonal Line Center.

Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee

Proceedings of the Combinatorial Optimization and Applications, 2020

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints.

Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

The discrete Voronoi game in a simple polygon.

Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid

Theor. Comput. Sci., 2019

The 1-dimensional discrete Voronoi game.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das

Oper. Res. Lett., 2019

Bounds on the Bend Number of Split and Cocomparability Graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo

Theory Comput. Syst., 2019

Approximating Minimum Dominating Set on String Graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

The Weighted k-Center Problem in Trees for Fixed k.

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Dominating Set on Overlap Graphs of Rectangles Intersecting a Line.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

The Relative Signed Clique Number of Planar Graphs is 8.

Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Optimizing squares covering a set of points.

Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song

Theor. Comput. Sci., 2018

A study on oriented relative clique number.

Sandip Das, Swathy Prabhu, Sagnik Sen

Discret. Math., 2018

Computing the Minkowski Sum of Convex Polytopes in R^d.

Sandip Das, Swami Sarvottamananda

CoRR, 2018

On relative clique number of colored mixed graphs.

Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen

CoRR, 2018

On bounds on bend number of classes of split and cocomparability graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo

CoRR, 2018

On Oriented L(p, 1)-labeling.

Sandip Das, Soumen Nandi, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

Burning Spiders.

Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

On representing a simple polygon perceivable to a blind person.

Sandip Banerjee, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy

Inf. Process. Lett., 2017

A lower bound technique for radio k-coloring.

Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen

Discret. Math., 2017

Optimal L(3, 2, 1)-labeling of triangular lattice.

Sandip Das, Sasthi C. Ghosh, Soumen Nandi

Discret. Appl. Math., 2017

The discrete Voronoi game in R².

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee

Comput. Geom., 2017

On Chromatic Number of Colored Mixed Graphs.

Sandip Das, Soumen Nandi, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Forbidden substructure for interval digraphs/bigraphs.

Ashok Kumar Das, Sandip Das, Malay K. Sen

Discret. Math., 2016

Almost empty monochromatic triangles in planar point sets.

Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya, Sandip Das

Discret. Appl. Math., 2016

The p-Center Problem in Tree Networks Revisited.

Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Linear Time Algorithm for 1-Center in R^d Under Convex Polyhedral Distance Function.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

On Local Structures of Cubicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Combinatorial Optimization and Applications, 2016

Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Relative Clique Number of Planar Signed Graphs.

Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

Voronoi game on graphs.

Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar

Theor. Comput. Sci., 2015

Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points.

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das

Int. J. Comput. Geom. Appl., 2015

On L(k, k-1, ..., 1) labeling of triangular lattice.

Soumen Nandi, Sagnik Sen, Sasthi C. Ghosh, Sandip Das

Electron. Notes Discret. Math., 2015

On oriented relative clique number.

Sandip Das, Swathyprabhu Mj, Sagnik Sen

Electron. Notes Discret. Math., 2015

Geometric k-Center Problems with Centers Constrained to Two Lines.

Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

CoRR, 2015

Geometric p-Center Problems with Centers Constrained to Two Lines.

Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

On a Special Class of Boxicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Minimum enclosing circle of a set of fixed points and a mobile point.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das

Comput. Geom., 2014

Efficient channel assignment for cellular networks modeled as honeycomb grid.

Soumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Charan Ghosh, Sandip Das

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

Optimizing Squares Covering a Set of Points.

Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song

Proceedings of the Combinatorial Optimization and Applications, 2014

A Facility Coloring Problem in 1-D.

Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Minimum-width rectangular annulus.

Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das

Theor. Comput. Sci., 2013

On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation.

Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy

Trans. Comput. Sci., 2013

Disjoint empty convex pentagons in planar point sets.

Bhaswar B. Bhattacharya, Sandip Das

Period. Math. Hung., 2013

Circular-Arc Bigraphs and Its Subclasses.

Asim Basu, Sandip Das, Shamik Ghosh, Malay K. Sen

J. Graph Theory, 2013

Some variations on constrained minimum enclosing circle problem.

Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya

J. Comb. Optim., 2013

Optimal strategies for the one-round discrete Voronoi game on a line.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das

J. Comb. Optim., 2013

Almost Empty Monochromatic Triangles in Planar Point Sets.

Deepan Basu, Bhaswar B. Bhattacharya, Sandip Das

Electron. Notes Discret. Math., 2013

On pseudo-convex partitions of a planar point set.

Bhaswar B. Bhattacharya, Sandip Das

Discret. Math., 2013

Localized geometric query problems.

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda

Comput. Geom., 2013

Recognition and Characterization of Chronological Interval Digraphs.

Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang

Electron. J. Comb., 2013

POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks.

Barun Gorain, Partha Sarathi Mandal, Sandip Das

Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

One-Round Discrete Voronoi Game in ℝ² in Presence of Existing Facilities.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Two-Round Discrete Voronoi Game along a Line.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2011

Guest Editor's Foreword.

Sandip Das, Ryuhei Uehara

J. Graph Algorithms Appl., 2011

<i>k</i>-Enclosing Axis-Parallel Square.

Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2010

Approximation algorithms for shortest descending paths in terrains.

Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy

J. Discrete Algorithms, 2010

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda

CoRR, 2010

Holes or Empty Pseudo-Triangles in Planar Point Sets.

Bhaswar B. Bhattacharya, Sandip Das

CoRR, 2010

Homogeneous 2-hop broadcast in 2D.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Comput. Geom., 2010

A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion.

Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Computation of Non-dominated Points Using Compact Voronoi Diagrams.

Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009

FPGA placement using space-filling curves: Theory meets practice.

Pritha Banerjee, Susmita Sur-Kolay, Arijit Bishnu, Sandip Das, Subhas C. Nandy, Subhasis Bhattacharjee

ACM Trans. Embed. Comput. Syst., 2009

Covering a set of points in a plane using two parallel rectangles.

Chandan Saha, Sandip Das

Inf. Process. Lett., 2009

A new fast heuristic for labeling points.

Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2009

Smallest Color-Spanning Object Revisited.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Int. J. Comput. Geom. Appl., 2009

Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon.

Debabrata Bardhan, Sasanka Roy, Sandip Das

Int. J. Comput. Geom. Appl., 2009

On Finding Non-dominated Points using Compact Voronoi Diagrams

Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink

CoRR, 2009

Constrained minimum enclosing circle with center on a query line segment.

Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy

Comput. Geom., 2009

Single facility collection depots location problem in the plane.

Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember

Comput. Geom., 2009

2008

Base station placement on boundary of a convex polygon.

Sasanka Roy, Debabrata Bardhan, Sandip Das

J. Parallel Distributed Comput., 2008

Fast computation of smallest enclosing circle with center on a query line segment.

Arindam Karmakar, Sasanka Roy, Sandip Das

Inf. Process. Lett., 2008

Variations of Base-Station Placement Problem on the Boundary of a Convex Region.

Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy

Int. J. Found. Comput. Sci., 2008

Guarding Exterior Region of a Simple Polygon.

Arindam Karmakar, Sasanka Roy, Sandip Das

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Maximal Covering by Two Isothetic Unit Squares.

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2007

Shortest monotone descent path problem in polyhedral terrain.

Sasanka Roy, Sandip Das, Subhas C. Nandy

Comput. Geom., 2007

Base Station Placement Problem on the Boundary of a Convex Region.

Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy

Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Approximate Shortest Descent Path on a Terrain.

Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Covering Points by Isothetic Unit Squares.

Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Computing a planar widest empty alpha-siphon in o(n³) time.

Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Range assignment for energy efficient broadcasting in linear radio networks.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Theor. Comput. Sci., 2006

Simple algorithms for partial point set pattern matching under rigid motion.

Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Pattern Recognit., 2006

Efficient algorithm for placing a given number of base stations to cover a convex region.

Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha

J. Parallel Distributed Comput., 2006

Chronological orderings of interval digraphs.

Malay K. Sen, P. Talukdar, Sandip Das

Discret. Math., 2006

Homogeneous 2-Hops Broadcast in 2D.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Proceedings of the Computational Science and Its Applications, 2006

Optimal Guard Placement Problem Under L-Visibility.

Debabrata Bardhan, Sasanka Roy, Sandip Das

Proceedings of the Computational Science and Its Applications, 2006

2005

Smallest <i>k</i>-point enclosing rectangle and square of arbitrary orientation.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Inf. Process. Lett., 2005

Moving Griffith crack in an orthotropic strip with punches at boundary faces.

Satyaki Mukherjee, Sandip Das

Int. J. Math. Math. Sci., 2005

Placing a Given Number of Base Stations to Cover a Convex Region.

Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha

Proceedings of the Distributed Computing, 2005

Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone.

Sasanka Roy, Debabrata Bardhan, Sandip Das

Proceedings of the Distributed Computing and Internet Technology, 2005

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Proceedings of the Computational Science and Its Applications, 2005

Fast FPGA Placement using Space-filling Curve.

Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy

Proceedings of the 2005 International Conference on Field Programmable Logic and Applications (FPL), 2005

A Fast Algorithm for Point Labeling Problem.

Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Collection depot location problem in the plane.

Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Manhattan-diagonal routing in channels and switchboxes.

Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya

ACM Trans. Design Autom. Electr. Syst., 2004

Optimal algorithm for a special point-labeling problem.

Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2004

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Comput. Geom., 2004

A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface.

Sasanka Roy, Sandip Das, Subhas C. Nandy

Proceedings of the Computational Science and Its Applications, 2004

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Proceedings of the High Performance Computing, 2004

Smallest k point enclosing rectangle of arbitrary orientation.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

An efficient k nearest neighbors searching algorithm for a query line.

Subhas C. Nandy, Sandip Das, Partha P. Goswami

Theor. Comput. Sci., 2003

Largest empty rectangle among a point set.

Jeet Chaudhuri, Subhas C. Nandy, Sandip Das

J. Algorithms, 2003

Chronological Orderings of Interval Digraph.

Malay K. Sen, P. Talukdar, Sandip Das

Electron. Notes Discret. Math., 2003

Homogeneously Representable Interval Bigraphs.

Sandip Das, P. Talukdar, Malay K. Sen

Electron. Notes Discret. Math., 2003

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion.

Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Proceedings of the Algorithm Theory, 2002

2000

Synthesis of symmetric functions for path-delay fault testability.

Susanta Chakrabarti, Sandip Das, Debesh Kumar Das, Bhargab B. Bhattacharya

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2000

1999

High Performance MCM Routing: A New Approach.

Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999

Synthesis of Symmetric Functions for Path-Delay Fault Testability.

Susanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya

Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999

1998

Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model.

Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya

Proceedings of the 11th International Conference on VLSI Design (VLSI Design 1991), 1998

1996

Channel routing in Manhattan-diagonal model.

Sandip Das, Bhargab B. Bhattacharya

Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996

1993

An interval digraph in relation to its associated bipartite graph.

Sandip Das, Malay K. Sen

Discret. Math., 1993

Via Minimization in Channel Routing by Layout Modification.

Sandip Das, Bhargab B. Bhattacharya

Proceedings of the Sixth International Conference on VLSI Design, 1993

1989

Circular-arc digraphs: A characterization.

Malay K. Sen, Sandip Das, Douglas B. West

J. Graph Theory, 1989

Interval digraphs: An analogue of interval graphs.

Sandip Das, Malay K. Sen, A. B. Roy, Douglas B. West

J. Graph Theory, 1989