Sandip Das

发表

Dominating Set on Overlap Graphs of Rectangles Intersecting a Line

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, 2019, COCOON.

Constrained Minimum Enclosing Circle with Center on a Query Line Segment

Sandip Das, Sasanka Roy, Arindam Karmakar, 2006, MFCS.

On Oriented L(p, 1)-labeling

Sandip Das, Soumen Nandi, Sagnik Sen, 2018, CALDAM.

The 1-dimensional discrete Voronoi game

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2019, Oper. Res. Lett..

Almost Empty Monochromatic Triangles in Planar Point Sets

Sandip Das, Bhaswar B. Bhattacharya, Deepan Basu, 2013, Electron. Notes Discret. Math..

Optimal Guard Placement Problem Under L-Visibility

Sandip Das, Sasanka Roy, Debabrata Bardhan, 2006, ICCSA.

Almost empty monochromatic triangles in planar point sets

Kinjal Basu, Sandip Das, Bhaswar B. Bhattacharya, 2016, Discret. Appl. Math..

On relative clique number of colored mixed graphs pdf

Sandip Das, Soumen Nandi, Sagnik Sen, 2018, ArXiv.

Optimal Strategies for the One-Round Discrete Voronoi Game on a Line

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2011, COCOON.

Covering a Set of Points in a Plane Using Two Parallel Rectangles

Sandip Das, Chandan Saha, Sandip Das, 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

An interval digraph in relation to its associated bipartite graph

Sandip Das, Malay K. Sen, 1993, Discret. Math..

Maximal Covering by Two Isothetic Unit Squares

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

Range assignment for energy efficient broadcasting in linear radio networks

Sandip Das, Subhas C. Nandy, Gautam K. Das, 2006, Theor. Comput. Sci..

Optimizing Squares Covering a Set of Points

Sandip Das, Zhao Song, Binay K. Bhattacharya, 2014, COCOA.

An improved heuristic algorithm for over-the-cell channel routing

Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya, 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

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

Sandip Das, Satyaki Mukherjee, 2005, Int. J. Math. Math. Sci..

Managing Interdisciplinary Senior Design with Nuclear Applications

Sandip Das, Valmiki Sooklal, Tristan Utschig, 2017 .

The $p$-Center Problem in Tree Networks Revisited

Sandip Das, Zhao Song, Binay K. Bhattacharya, 2016, SWAT.

Burning Spiders

Sandip Das, Sagnik Sen, Uma Kant Sahoo, 2018, CALDAM.

Computation of Non-dominated Points Using Compact Voronoi Diagrams

Otfried Cheong, Jack Snoeyink, Sandip Das, 2010, WALCOM.

Some variations on constrained minimum enclosing circle problem

Sandip Das, Arindam Karmakar, Subhas C. Nandy, 2013, J. Comb. Optim..

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

Sandip Das, Soumen Nandi, Sagnik Sen, 2015, Electron. Notes Discret. Math..

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

Sandip Das, Barun Gorain, Partha Sarathi Mandal, 2013, ICDCN.

Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function

Sandip Das, Ayan Nandy, Swami Sarvottamananda, 2016, FAW.

Voronoi game on graphs

Sayan Bandyapadhyay, Sandip Das, Aritra Banik, 2015, Theor. Comput. Sci..

Smallest Color-Spanning Object Revisited

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2009, Int. J. Comput. Geom. Appl..

On pseudo-convex partitions of a planar point set

Sandip Das, Bhaswar B. Bhattacharya, 2013, Discret. Math..

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion

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

Forbidden substructure for interval digraphs/bigraphs

Ashok Kumar Das, Sandip Das, Malay K. Sen, 2016, Discret. Math..

The Relative Signed Clique Number of Planar Graphs is 8

Sandip Das, Soumen Nandi, Sagnik Sen, 2019, CALDAM.

Oriented Bipartite Graphs and the Goldbach Graph pdf

Sandip Das, Sagnik Sen, Shamik Ghosh, 2016, Discret. Math..

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

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2004, Comput. Geom..

An efficient k nearest neighbors searching algorithm for a query line

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2003, Theor. Comput. Sci..

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

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2007, Inf. Process. Lett..

Damage-based design with no repairs for multiple events and its sensitivity to seismicity model

Sandip Das, Vinay K. Gupta, V. Srimahavishnu, 2007 .

Shortest Monotone Descent Path Problem in Polyhedral Terrain

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2005, STACS.

Optimizing squares covering a set of points

Sergey Bereg, Sandip Das, Zhao Song, 2018, Theor. Comput. Sci..

Covering Points by Isothetic Unit Squares

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

Smallest k-point enclosing rectangle and square of arbitrary orientation

Sandip Das, Subhas C. Nandy, Partha P. Goswami, 2005, Inf. Process. Lett..

k-Enclosing Axis-Parallel Square

Sandip Das, Arindam Karmakar, Priya Ranjan Sinha Mahapatra, 2011, ICCSA.

Single facility collection depots location problem in the plane

Robert Benkoczi, Sandip Das, Binay K. Bhattacharya, 2009, Comput. Geom..

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

Sandip Das, Soumen Nandi, Sasthi C. Ghosh, 2017, Discret. Appl. Math..

Approximating Minimum Dominating Set on String Graphs

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, 2018, WG.

Knowledge Management in Academic Institution through Knowledge Portal

Sandip Das, Sudipta Biswas, 2014 .

Voronoi Game on Graphs

Sayan Bandyapadhyay, Sandip Das, Aritra Banik, 2013, WALCOM.

Two-Round Discrete Voronoi Game along a Line

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2013, FAW-AAIM.

Computing the Minkowski Sum of Convex Polytopes in Rd pdf

Sandip Das, Swami Sarvottamananda, 2018, ArXiv.

A Fast Algorithm for Point Labeling Problem

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2005, CCCG.

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

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2008, Int. J. Found. Comput. Sci..

A lower bound technique for radio k-coloring

Sandip Das, Soumen Nandi, Sagnik Sen, 2017, Discret. Math..

Constrained minimum enclosing circle with center on a query line segment

Sandip Das, Sasanka Roy, Arindam Karmakar, 2009, Comput. Geom..

Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2011, WALCOM.

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

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, 2018, ArXiv.

Approximate Shortest Descent Path on a Terrain

Anil Maheshwari, Sandip Das, Sachin Lodha, 2007, CCCG.

Cops and Robber on Some Families of Oriented Graphs

Sandip Das, Sagnik Sen, Harmender Gahlawat, 2019, IWOCA.

Computing a planar widest empty alpha-siphon in o(n3) time

Boaz Ben-Moshe, Sandip Das, Binay K. Bhattacharya, 2007, CCCG.

Variations of Cops and Robbers Game on Grids

Sandip Das, Harmender Gahlawat, 2018, CALDAM.

The Discrete Voronoi Game in a Simple Polygon

Michiel H. M. Smid, Anil Maheshwari, Sandip Das, 2013, COCOON.

Collection depot location problem in the plane

Robert Benkoczi, Sandip Das, Binay K. Bhattacharya, 2005, CCCG.

Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions

Sandip Das, Ayan Nandy, Swami Sarvottamananda, 2018, CALDAM.

A new fast heuristic for labeling points

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2009, Inf. Process. Lett..

On oriented relative clique number

Sandip Das, Sagnik Sen, Swathyprabhu Mj, 2015, Electron. Notes Discret. Math..

Base station placement on boundary of a convex polygon

Sandip Das, Sasanka Roy, Debabrata Bardhan, 2008, J. Parallel Distributed Comput..

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

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

The discrete Voronoi game in R2

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2017, Comput. Geom..

Wavelet-based generation of accelerogram-consistent, spectrum-compatible motions: New algorithms and short-period overestimation

Sandip Das, Suparno Mukhopadhyay, Vinay K. Gupta, 2019, Soil Dynamics and Earthquake Engineering.

Simple algorithms for partial point set pattern matching under rigid motion

Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya, 2006, Pattern Recognit..

On Local Structures of Cubicity 2 Graphs

Dibyayan Chakraborty, Sandip Das, Sagnik Sen, 2016, COCOA.

Architectural Components of Digital Library:A Practical Example Using DSpace

Sandip Das, M. Krishnamurthy, 2014 .

Synthesis of symmetric functions for path-delay fault testability

Sandip Das, Bhargab B. Bhattacharya, Debesh Kumar Das, 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Querying for the Largest Empty Geometric Object in a Desired Location

John Augustine, Anil Maheshwari, Sandip Das, 2010, 1004.0558.

Optimal algorithm for a special point-labeling problem

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2002, Inf. Process. Lett..

Homogeneous 2-hop broadcast in 2D

Sandip Das, Subhas C. Nandy, Gautam K. Das, 2010, Comput. Geom..

Bumblebee Visitation Problem

Sandip Das, Harmender Gahlawat, 2019, CALDAM.

Approximation algorithms for shortest descending paths in terrains

Anil Maheshwari, Sandip Das, Sachin Lodha, 2008, J. Discrete Algorithms.

Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone

Sandip Das, Sasanka Roy, Debabrata Bardhan, 2005, ICDCIT.

Synthesis of symmetric functions for path-delay fault testability

Susanta Chakraborty, Sandip Das, Bhargab B. Bhattacharya, 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

On representing a simple polygon perceivable to a blind person

Arindam Biswas, Sandip Banerjee, Sandip Das, 2017, Inf. Process. Lett..

Guarding Exterior Region of a Simple Polygon

Sandip Das, Sasanka Roy, Arindam Karmakar, 2008, WALCOM.

Range Assignment Problem in Wireless Network

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

Optimal Algorithm for a Special Point-Labeling Problem

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2002, SWAT.

Homogeneously Representable Interval Bigraphs

Sandip Das, Malay K. Sen, P. Talukdar, 2003, Electron. Notes Discret. Math..

A Facility Coloring Problem in 1-D

Michiel H. M. Smid, Anil Maheshwari, Sandip Das, 2014, AAIM.

Guest Editor's Foreword

Ryuhei Uehara, Sandip Das, 2011, J. Graph Algorithms Appl..

Smallest k point enclosing rectangle of arbitrary orientation

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

On Rectangle Intersection Graphs with Stab Number at Most Two

Dibyayan Chakraborty, Sandip Das, Sagnik Sen, 2019, CALDAM.

Circular‐Arc Bigraphs and Its Subclasses

Sandip Das, Shamik Ghosh, Malay K. Sen, 2013, J. Graph Theory.

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

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

Efficient channel assignment for cellular networks modeled as honeycomb grid

Sandip Das, Mohit Agrawal, Soumen Nandi, 2014, ICTCS.

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

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2004, ICCSA.

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

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2013, CCCG.

Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity

Sandip Das, Ayan Nandy, Swami Sarvottamananda, 2017, CALDAM.

Minimum Width Rectangular Annulus

Sandip Das, Joydeep Mukherjee, Arindam Karmakar, 2011, FAW-AAIM.

Recognition and Characterization of Chronological Interval Digraphs

Pavol Hell, Sandip Das, Jing Huang, 2013, Electron. J. Comb..

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

Sandip Banerjee, Anil Maheshwari, Sandip Das, 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

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

Sandip Das, Bhabani P. Sinha, Subhas C. Nandy, 2005, IWDC.

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

Sandip Das, Priya Ranjan Sinha Mahapatra, Partha P. Goswami, 2015, Int. J. Comput. Geom. Appl..

Via Minimization in channel Routing by Layout Modification

Sandip Das, Bhargab B. Bhattacharya, 1993, The Sixth International Conference on VLSI Design.

On a Special Class of Boxicity 2 Graphs pdf

Dibyayan Chakraborty, Sandip Das, Sagnik Sen, 2015, CALDAM.

High performance MCM routing: a new approach

Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya, 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

Shortest monotone descent path problem in polyhedral terrain

Sandip Das, Sasanka Roy, Subhas C. Nandy, 2005, Comput. Geom..

Localized geometric query problems

John Augustine, Anil Maheshwari, Sandip Das, 2011, Comput. Geom..

On Chromatic Number of Colored Mixed Graphs pdf

Sandip Das, Soumen Nandi, Sagnik Sen, 2017, CALDAM.

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

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

Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment

Sandip Das, Sasanka Roy, Arindam Karmakar, 2007, CCCG.

ADAPTIVE FORCE-BASED FRAME ELEMENT FOR REGULARIZED RESPONSE

Sandip Das, João Saraiva Esteves Pacheco de Almeida, Rui Pinho, 2011 .

Homogeneous 2-Hops Broadcast in 2D

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

A study on oriented relative clique number

Sandip Das, Sagnik Sen, Swathy Prabhu, 2018, Discret. Math..

Largest empty rectangle among a point set

Sandip Das, Subhas C. Nandy, Jeet Chaudhuri, 2003, J. Algorithms.

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

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2014, Comput. Geom..

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks

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

Linear-Time Fitting of a k-Step Function

Sandip Das, Binay K. Bhattacharya, Tsunehiko Kameda, 2016, CALDAM.

Relative Clique Number of Planar Signed Graphs

Sandip Das, Sagnik Sen, Prantar Ghosh, 2016, CALDAM.

Minimum-width rectangular annulus

Sandip Das, Joydeep Mukherjee, Arindam Karmakar, 2013, Theor. Comput. Sci..

Disjoint empty convex pentagons in planar point sets

Sandip Das, Bhaswar B. Bhattacharya, 2013, Period. Math. Hung..

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

Sandip Das, Aritra Banik, Bhaswar B. Bhattacharya, 2013, J. Comb. Optim..

Some variations on constrained minimum enclosing circle problem

Sandip Das, Arindam Karmakar, Subhas C. Nandy, 2010, J. Comb. Optim..

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

Sandip Das, Bhabani P. Sinha, Subhas C. Nandy, 2006, J. Parallel Distributed Comput..

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

John Augustine, Anil Maheshwari, Sandip Das, 2010, ArXiv.

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

Sandip Das, Ayan Nandy, Swami Sarvottamananda, 2016, CALDAM.

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

Sandip Banerjee, Anil Maheshwari, Sandip Das, 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

Holes or Empty Pseudo-Triangles in Planar Point Sets pdf

Sandip Das, Bhaswar B. Bhattacharya, 2010, ArXiv.

Covering a Set of Points in a Plane Using Two Parallel Rectangles

Sandip Das, Chandan Saha, 2007, ICCTA.