Interval digraphs: An analogue of interval graphs. - Sandip Das 001; Malay K. Sen; A. B. Roy; Douglas B. West (J. Graph Theory, 1989)

Circular-arc digraphs: A characterization. - Malay K. Sen; Sandip Das 001; Douglas B. West (J. Graph Theory, 1989)

Via Minimization in Channel Routing by Layout Modification. - Sandip Das 001; Bhargab B. Bhattacharya (VLSI Design, 1993)

An interval digraph in relation to its associated bipartite graph. - Sandip Das 001; Malay K. Sen (Discret. Math., 1993)

Channel routing in Manhattan-diagonal model. - Sandip Das 001; Bhargab B. Bhattacharya (VLSI Design, 1996)

Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model. - Sandip Das 001; Susmita Sur-Kolay; Bhargab B. Bhattacharya (VLSI Design, 1998)

Synthesis of Symmetric Functions for Path-Delay Fault Testability. - Susanta Chakraborty; Sandip Das 001; Debesh K. Das; Bhargab B. Bhattacharya (VLSI Design, 1999)

High Performance MCM Routing: A New Approach. - Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (VLSI Design, 1999)

Synthesis of symmetric functions for path-delay fault testability. - Susanta Chakrabarti; Sandip Das 001; Debesh Kumar Das; Bhargab B. Bhattacharya (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2000)

Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (SWAT, 2002)

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. - Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (CIAC, 2003)

Homogeneously Representable Interval Bigraphs. - Sandip Das 001; P. Talukdar; Malay K. Sen (Electron. Notes Discret. Math., 2003)

Chronological Orderings of Interval Digraph. - Malay K. Sen; P. Talukdar; Sandip Das 001 (Electron. Notes Discret. Math., 2003)

Largest empty rectangle among a point set. - Jeet Chaudhuri; Subhas C. Nandy; Sandip Das 001 (J. Algorithms, 2003)

An efficient k nearest neighbors searching algorithm for a query line. - Subhas C. Nandy; Sandip Das 001; Partha P. Goswami (Theor. Comput. Sci., 2003)

Smallest k point enclosing rectangle of arbitrary orientation. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (CCCG, 2004)

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (HiPC, 2004)

A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. - Sasanka Roy; Sandip Das 001; Subhas C. Nandy (ICCSA (3), 2004)

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2004)

Optimal algorithm for a special point-labeling problem. - Sasanka Roy; Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2004)

Manhattan-diagonal routing in channels and switchboxes. - Sandip Das 001; Susmita Sur-Kolay; Bhargab B. Bhattacharya (ACM Trans. Design Autom. Electr. Syst., 2004)

Collection depot location problem in the plane. - Robert Benkoczi; Binay K. Bhattacharya; Sandip Das 001; Jeff Sember (CCCG, 2005)

A Fast Algorithm for Point Labeling Problem. - Sasanka Roy; Subhasis Bhattacharjee; Sandip Das 001; Subhas C. Nandy (CCCG, 2005)

Fast FPGA Placement using Space-filling Curve. - Pritha Banerjee 001; Subhasis Bhattacharjee; Susmita Sur-Kolay; Sandip Das 001; Subhas C. Nandy (FPL, 2005)

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (ICCSA (1), 2005)

Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. - Sasanka Roy; Debabrata Bardhan; Sandip Das 001 (ICDCIT, 2005)

Placing a Given Number of Base Stations to Cover a Convex Region. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy; Bhabani P. Sinha (IWDC, 2005)

Moving Griffith crack in an orthotropic strip with punches at boundary faces. - Satyaki Mukherjee; Sandip Das 001 (Int. J. Math. Math. Sci., 2005)

Smallest k-point enclosing rectangle and square of arbitrary orientation. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (Inf. Process. Lett., 2005)

Optimal Guard Placement Problem Under L-Visibility. - Debabrata Bardhan; Sasanka Roy; Sandip Das 001 (ICCSA (1), 2006)

Homogeneous 2-Hops Broadcast in 2D. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (ICCSA (2), 2006)

Chronological orderings of interval digraphs. - Malay K. Sen; P. Talukdar; Sandip Das 001 (Discret. Math., 2006)

Efficient algorithm for placing a given number of base stations to cover a convex region. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy; Bhabani P. Sinha (J. Parallel Distributed Comput., 2006)

Simple algorithms for partial point set pattern matching under rigid motion. - Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (Pattern Recognit., 2006)

Range assignment for energy efficient broadcasting in linear radio networks. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (Theor. Comput. Sci., 2006)

Computing a planar widest empty alpha-siphon in o(n3) time. - Boaz Ben-Moshe; Binay K. Bhattacharya; Sandip Das 001; Daya Ram Gaur; Qiaosheng Shi (CCCG, 2007)

Covering Points by Isothetic Unit Squares. - Priya Ranjan Sinha Mahapatra; Partha P. Goswami; Sandip Das 001 (CCCG, 2007)

Approximate Shortest Descent Path on a Terrain. - Sasanka Roy; Sachin Lodha; Sandip Das 001; Anil Maheshwari (CCCG, 2007)

Base Station Placement Problem on the Boundary of a Convex Region. - Gautam K. Das; Sasanka Roy; Sandip Das 001; Subhas C. Nandy (WALCOM, 2007)

Shortest monotone descent path problem in polyhedral terrain. - Sasanka Roy; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2007)

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2007)

Maximal Covering by Two Isothetic Unit Squares. - Priya Ranjan Sinha Mahapatra; Partha P. Goswami; Sandip Das 001 (CCCG, 2008)

Guarding Exterior Region of a Simple Polygon. - Arindam Karmakar; Sasanka Roy; Sandip Das 001 (WALCOM, 2008)

Variations of Base-Station Placement Problem on the Boundary of a Convex Region. - Gautam K. Das; Sasanka Roy; Sandip Das 001; Subhas C. Nandy (Int. J. Found. Comput. Sci., 2008)

Fast computation of smallest enclosing circle with center on a query line segment. - Arindam Karmakar; Sasanka Roy; Sandip Das 001 (Inf. Process. Lett., 2008)

Base station placement on boundary of a convex polygon. - Sasanka Roy; Debabrata Bardhan; Sandip Das 001 (J. Parallel Distributed Comput., 2008)

Single facility collection depots location problem in the plane. - Robert Benkoczi; Binay K. Bhattacharya; Sandip Das 001; Jeff Sember (Comput. Geom., 2009)

Constrained minimum enclosing circle with center on a query line segment. - Sasanka Roy; Arindam Karmakar; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2009)

On Finding Non-dominated Points using Compact Voronoi Diagrams - Binay K. Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (CoRR, 2009)

Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. - Debabrata Bardhan; Sasanka Roy; Sandip Das 001 (Int. J. Comput. Geom. Appl., 2009)

Smallest Color-Spanning Object Revisited. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 2009)

A new fast heuristic for labeling points. - Sasanka Roy; Subhasis Bhattacharjee; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2009)

Covering a set of points in a plane using two parallel rectangles. - Chandan Saha 001; Sandip Das 001 (Inf. Process. Lett., 2009)

FPGA placement using space-filling curves: Theory meets practice. - Pritha Banerjee 001; Susmita Sur-Kolay; Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Subhasis Bhattacharjee (ACM Trans. Embed. Comput. Syst., 2009)

Computation of Non-dominated Points Using Compact Voronoi Diagrams. - Binay K. Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (WALCOM, 2010)

A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. - Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (WALCOM, 2010)

Homogeneous 2-hop broadcast in 2D. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2010)

Holes or Empty Pseudo-Triangles in Planar Point Sets. - Bhaswar B. Bhattacharya; Sandip Das 001 (CoRR, 2010)

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location - John Augustine; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (CoRR, 2010)

Approximation algorithms for shortest descending paths in terrains. - Mustaq Ahmed; Sandip Das 001; Sachin Lodha; Anna Lubiw; Anil Maheshwari; Sasanka Roy (J. Discrete Algorithms, 2010)

k-Enclosing Axis-Parallel Square. - Priya Ranjan Sinha Mahapatra; Arindam Karmakar; Sandip Das 001; Partha P. Goswami (ICCSA (3), 2011)

Guest Editor's Foreword. - Sandip Das 001; Ryuhei Uehara (J. Graph Algorithms Appl., 2011)

Two-Round Discrete Voronoi Game along a Line. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Sreeja Das (FAW-AAIM, 2013)

One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Satyaki Mukherjee (CCCG, 2013)

POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. - Barun Gorain; Partha Sarathi Mandal 001; Sandip Das 001 (ICDCN, 2013)

Recognition and Characterization of Chronological Interval Digraphs. - Sandip Das 001; Mathew C. Francis; Pavol Hell; Jing Huang 007 (Electron. J. Comb., 2013)

Localized geometric query problems. - John Augustine; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (Comput. Geom., 2013)

On pseudo-convex partitions of a planar point set. - Bhaswar B. Bhattacharya; Sandip Das 001 (Discret. Math., 2013)

Almost Empty Monochromatic Triangles in Planar Point Sets. - Deepan Basu; Bhaswar B. Bhattacharya; Sandip Das 001 (Electron. Notes Discret. Math., 2013)

Optimal strategies for the one-round discrete Voronoi game on a line. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001 (J. Comb. Optim., 2013)

Some variations on constrained minimum enclosing circle problem. - Arindam Karmakar; Sandip Das 001; Subhas C. Nandy; Binay K. Bhattacharya (J. Comb. Optim., 2013)

Circular-Arc Bigraphs and Its Subclasses. - Asim Basu; Sandip Das 001; Shamik Ghosh; Malay K. Sen (J. Graph Theory, 2013)

Disjoint empty convex pentagons in planar point sets. - Bhaswar B. Bhattacharya; Sandip Das 001 (Period. Math. Hung., 2013)

On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. - Sandip Banerjee; Bhargab B. Bhattacharya; Sandip Das 001; Arindam Karmakar; Anil Maheshwari; Sasanka Roy (Trans. Comput. Sci., 2013)

Minimum-width rectangular annulus. - Joydeep Mukherjee; Priya Ranjan Sinha Mahapatra; Arindam Karmakar; Sandip Das 001 (Theor. Comput. Sci., 2013)

A Facility Coloring Problem in 1-D. - Sandip Das 001; Anil Maheshwari; Ayan Nandy; Michiel H. M. Smid (AAIM, 2014)

Optimizing Squares Covering a Set of Points. - Binay K. Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Priya Ranjan Sinha Mahapatra; Zhao Song 002 (COCOA, 2014)

Efficient channel assignment for cellular networks modeled as honeycomb grid. - Soumen Nandi; Nitish Panigrahy; Mohit Agrawal; Sasthi Charan Ghosh; Sandip Das 001 (ICTCS, 2014)

Minimum enclosing circle of a set of fixed points and a mobile point. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001 (Comput. Geom., 2014)

On a Special Class of Boxicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (CALDAM, 2015)

Geometric p-Center Problems with Centers Constrained to Two Lines. - Binay Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (JCDCGG, 2015)

Geometric k-Center Problems with Centers Constrained to Two Lines. - Binay K. Bhattacharya; Ante Custic; Sandip Das 001; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2015)

On oriented relative clique number. - Sandip Das 001; Swathyprabhu Mj; Sagnik Sen 001 (Electron. Notes Discret. Math., 2015)

On L(k, k-1, ..., 1) labeling of triangular lattice. - Soumen Nandi; Sagnik Sen 001; Sasthi C. Ghosh 001; Sandip Das 001 (Electron. Notes Discret. Math., 2015)

Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. - Priya Ranjan Sinha Mahapatra; Partha P. Goswami; Sandip Das 001 (Int. J. Comput. Geom. Appl., 2015)

Voronoi game on graphs. - Sayan Bandyapadhyay; Aritra Banik; Sandip Das 001; Hirak Sarkar (Theor. Comput. Sci., 2015)

Relative Clique Number of Planar Signed Graphs. - Sandip Das 001; Prantar Ghosh; Swathyprabhu Mj; Sagnik Sen 001 (CALDAM, 2016)

Linear Time Algorithms for Euclidean 1-Center in mathfrak R^d with Non-linear Convex Constraints. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (CALDAM, 2016)

On Local Structures of Cubicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (COCOA, 2016)

Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (FAW, 2016)

The p-Center Problem in Tree Networks Revisited. - Aritra Banik; Binay K. Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Zhao Song 002 (SWAT, 2016)

Almost empty monochromatic triangles in planar point sets. - Deepan Basu; Kinjal Basu 001; Bhaswar B. Bhattacharya; Sandip Das 001 (Discret. Appl. Math., 2016)

Forbidden substructure for interval digraphs/bigraphs. - Ashok Kumar Das; Sandip Das 001; Malay K. Sen (Discret. Math., 2016)

On Chromatic Number of Colored Mixed Graphs. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2017)

The discrete Voronoi game in R2. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Satyaki Mukherjee (Comput. Geom., 2017)

Optimal L(3, 2, 1)-labeling of triangular lattice. - Sandip Das 001; Sasthi C. Ghosh 001; Soumen Nandi (Discret. Appl. Math., 2017)

A lower bound technique for radio k-coloring. - Sandip Das 001; Sasthi C. Ghosh 001; Soumen Nandi; Sagnik Sen 001 (Discret. Math., 2017)

On representing a simple polygon perceivable to a blind person. - Sandip Banerjee; Bhargab B. Bhattacharya; Binay Bhattacharya; Arindam Biswas 002; Sandip Das 001; Ritankar Mandal; Sasanka Roy (Inf. Process. Lett., 2017)

Burning Spiders. - Sandip Das 001; Subhadeep Ranjan Dev; Arpan Sadhukhan; Uma Kant Sahoo; Sagnik Sen 001 (CALDAM, 2018)

On Oriented L(p, 1)-labeling. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001 (CALDAM, 2018)

On bounds on bend number of classes of split and cocomparability graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee; Uma Kant Sahoo (CoRR, 2018)

On relative clique number of colored mixed graphs. - Sandip Das 001; Soumen Nandi; Debdeep Roy; Sagnik Sen 001 (CoRR, 2018)

Computing the Minkowski Sum of Convex Polytopes in Rd. - Sandip Das 001; Swami Sarvottamananda (CoRR, 2018)

A study on oriented relative clique number. - Sandip Das 001; Swathy Prabhu; Sagnik Sen 001 (Discret. Math., 2018)

Optimizing squares covering a set of points. - Sergey Bereg; Binay Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Priya Ranjan Sinha Mahapatra; Zhao Song 002 (Theor. Comput. Sci., 2018)

The Relative Signed Clique Number of Planar Graphs is 8. - Sandip Das 001; Soumen Nandi; Sagnik Sen 001; Ritesh Seth (CALDAM, 2019)

Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee (COCOON, 2019)

The Weighted k-Center Problem in Trees for Fixed k. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (ISAAC, 2019)

Approximating Minimum Dominating Set on String Graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee (WG, 2019)

Bounds on the Bend Number of Split and Cocomparability Graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee; Uma Kant Sahoo (Theory Comput. Syst., 2019)

The 1-dimensional discrete Voronoi game. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Sreeja Das (Oper. Res. Lett., 2019)

The discrete Voronoi game in a simple polygon. - Aritra Banik; Sandip Das 001; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2019)

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. - Aritra Banik; Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvottamananda (COCOA, 2020)

Approximating k-Orthogonal Line Center. - Barunabha Chakraborty; Arun Kumar Das 001; Sandip Das 001; Joydeep Mukherjee (COCOA, 2020)

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. - Dibyayan Chakraborty; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Dimitri Lajou; Bodhayan Roy (ISAAC, 2020)

Optimizing movement in convex and non-convex path-networks to establish connectivity. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (Discret. Appl. Math., 2020)

Linear-time fitting of a k-step function. - Binay Bhattacharya; Sandip Das 001; Tsunehiko Kameda (Discret. Appl. Math., 2020)

Relative clique number of planar signed graphs. - Sandip Das 001; Prantar Ghosh; Swathy Prabhu; Sagnik Sen 001 (Discret. Appl. Math., 2020)

Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (Discret. Appl. Math., 2020)

Cops and Robber on Butterflies and Solid Grids. - Sheikh Shakil Akhtar; Sandip Das 001; Harmender Gahlawat (CALDAM, 2021)

On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. - Sandip Das 001; Siddani Bhaskara Rao; Uma Kant Sahoo (CALDAM, 2021)

Computation of spatial skyline points. - Binay Bhattacharya; Arijit Bishnu; Otfried Cheong; Sandip Das 001; Arindam Karmakar; Jack Snoeyink (Comput. Geom., 2021)

On rectangle intersection graphs with stab number at most two. - Dibyayan Chakraborty; Sandip Das 001; Mathew C. Francis; Sagnik Sen 001 (Discret. Appl. Math., 2021)

Variations of cops and robbers game on grids. - Sandip Das 001; Harmender Gahlawat (Discret. Appl. Math., 2021)

Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. - Sandip Das 001; Ayan Nandy; Swami Sarvottamananda (Discret. Appl. Math., 2021)

Pushable chromatic number of graphs with degree constraints. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Soumyajit Paul; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2021)

Oriented bipartite graphs and the Goldbach graph. - Sandip Das 001; Prantar Ghosh; Shamik Ghosh; Sagnik Sen 001 (Discret. Math., 2021)

Voronoi game on polygons. - Aritra Banik; Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvattomananda (Theor. Comput. Sci., 2021)

Largest triangle inside a terrain. - Arun Kumar Das 001; Sandip Das 001; Joydeep Mukherjee (Theor. Comput. Sci., 2021)

Cops and Robber on some families of oriented graphs. - Sandip Das 001; Harmender Gahlawat; Uma Kant Sahoo; Sagnik Sen 001 (Theor. Comput. Sci., 2021)

Voronoi Games Using Geodesics. - Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvattomananda (CALDAM, 2022)

On the Cop Number of String Graphs. - Sandip Das 001; Harmender Gahlawat (ISAAC, 2022)

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. - Dibyayan Chakraborty; Antoine Dailly; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh (ISAAC, 2022)

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (JCDCGGG, 2022)

On dominating set of some subclasses of string graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee (Comput. Geom., 2022)

Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. - Arun Kumar Das 001; Sandip Das 001; Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (CoRR, 2022)

Preface: CALDAM 2020. - Manoj Changat; Sandip Das 001 (Discret. Appl. Math., 2022)

On fractional version of oriented coloring. - Sandip Das 001; Soham Das 004; Swathy Prabhu; Sagnik Sen 001 (Discret. Appl. Math., 2022)

Bumblebee visitation problem. - Sandip Das 001; Harmender Gahlawat (Discret. Appl. Math., 2022)

On the signed chromatic number of some classes of graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2022)

The weighted k-center problem in trees for fixed k. - Binay Bhattacharya; Sandip Das 001; Subhadeep Ranjan Dev (Theor. Comput. Sci., 2022)

Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. - Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvattomananda (CALDAM, 2023)

Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. - Sandip Das 001; Florent Foucaud; Sk Samim Islam; Joydeep Mukherjee (CALDAM, 2023)

Cops and Robber on Oriented Graphs with Respect to Push Operation. - Sandip Das 001; Harmender Gahlawat; Ashwin Ramgopal; Uma Kant Sahoo; Sagnik Sen 001 (CALDAM, 2023)

A Homomorphic Polynomial for Oriented Graphs. - Sandip Das 001; Sumitava Ghosh; Swathy Prabhu; Sagnik Sen 001 (Electron. J. Comb., 2023)

An update on (n, m)-chromatic numbers. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

Burning a binary tree and its generalization. - Sandip Das 001; Sk Samim Islam; Ritam M. Mitra; Sanchita Paul (CoRR, 2023)

Approximation algorithm for finding multipacking on Cactus. - Sandip Das 001; Sk Samim Islam (CoRR, 2023)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. - Sandip Das 001; Florent Foucaud; Sk Samim Islam; Joydeep Mukherjee (CoRR, 2023)

On clique numbers of colored mixed graphs. - Dipayan Chakraborty; Sandip Das 001; Soumen Nandi; Debdeep Roy; Sagnik Sen 001 (Discret. Appl. Math., 2023)

Complexity results on untangling red-blue matchings. - Arun Kumar Das 001; Sandip Das 001; Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (Comput. Geom., 2023)

Triangle-free projective-planar graphs with diameter two: Domination and characterization. - Dibyayan Chakraborty; Sandip Das 001; Srijit Mukherjee; Uma Kant Sahoo; Sagnik Sen 001 (Discret. Appl. Math., 2023)

Approximation algorithms for orthogonal line centers. - Arun Kumar Das 001; Sandip Das 001; Joydeep Mukherjee (Discret. Appl. Math., 2023)

Growth Rate of the Number of Empty Triangles in the Plane. - Bhaswar B. Bhattacharya; Sandip Das 001; Sk Samim Islam; Saumya Sen (CALDAM, 2024)

Multipacking in Euclidean Plane. - Arun Kumar Das 001; Sandip Das 001; Sk Samim Islam; Ritam M. Mitra; Bodhayan Roy (CoRR, 2024)

A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes. - Sandip Das 001; Subhadeep Ranjan Dev; Swami Sarvattomananda (Discret. Appl. Math., 2024)

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2024)

Oriented total-coloring of oriented graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Ayan Nandy; Théo Pierron; Swathy Prabhu; Sagnik Sen 001 (Discret. Math., 2024)

Cops and Robber on butterflies, grids, and AT-free graphs. - Sheikh Shakil Akhtar; Sandip Das 001; Harmender Gahlawat (Discret. Appl. Math., 2024)

Almost Empty Monochromatic Polygons in Planar Point Sets. - Bhaswar B. Bhattacharya; Sandip Das 001; Sk Samim Islam; Saumya Sen (CALDAM, 2025)

Multipacking in the Euclidean Metric Space. - Arun Kumar Das 001; Sandip Das 001; Sk Samim Islam; Ritam M. Mitra; Bodhayan Roy (CALDAM, 2025)

Multipacking and Broadcast Domination on Cactus Graphs and Its Impact on Hyperbolic Graphs. - Sandip Das 001; Sk Samim Islam (WALCOM, 2025)

Finding a largest-area triangle in a terrain in near-linear time. - Sergio Cabello; Arun Kumar Das 001; Sandip Das 001; Joydeep Mukherjee (Comput. Geom., 2025)

Counting the minimum number of arcs in an oriented graph having weak diameter 2. - Sandip Das 001; Koushik Kumar Dey; Pavan P. D; Sagnik Sen 001 (Discret. Appl. Math., 2025)

Growth rates of the number of empty triangles and simplices. - Bhaswar B. Bhattacharya; Sandip Das 001; Sk Samim Islam; Saumya Sen (Comput. Geom., 2026)