| 2026 | ESA | On the Complexity of Multipacking. | Sandip Das, Sk Samim Islam, Daniel Lokshtanov |
| 2025 | FCT | On Distance-d Independent Set Problems for Some Graph Classes. | Sandip Das, Soura Sena Das, Sweta Das, Sk Samim Islam |
| 2025 | WALCOM | Multipacking and Broadcast Domination on Cactus Graphs and Its Impact on Hyperbolic Graphs. | Sandip Das, Sk Samim Islam |
| 2022 | ISAAC | On the Cop Number of String Graphs. | Sandip Das, Harmender Gahlawat |
| 2022 | ISAAC | 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 |
| 2022 | LATIN | Complexity Results on Untangling Red-Blue Matchings. | Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier |
| 2021 | WADS | Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. | Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee |
| 2020 | COCOA | Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. | Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda |
| 2020 | COCOA | Approximating k-Orthogonal Line Center. | Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee |
| 2020 | ISAAC | Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. | Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy |
| 2019 | COCOON | Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. | Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee |
| 2019 | ISAAC | The Weighted k-Center Problem in Trees for Fixed k. | Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev |
| 2019 | IWOCA | Cops and Robber on Some Families of Oriented Graphs. | Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen |
| 2019 | WG | Approximating Minimum Dominating Set on String Graphs. | Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee |
| 2016 | COCOA | On Local Structures of Cubicity 2 Graphs. | Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen |
| 2016 | FAW | Linear Time Algorithm for 1-Center in R | Sandip Das, Ayan Nandy, Swami Sarvottamananda |
| 2014 | AAIM | A Facility Coloring Problem in 1-D. | Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid |
| 2014 | COCOA | Optimizing Squares Covering a Set of Points. | Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song |
| 2013 | AAIM | Two-Round Discrete Voronoi Game along a Line. | Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das |
| 2013 | COCOON | The Discrete Voronoi Game in a Simple Polygon. | Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid |
| 2013 | ICDCN | POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. | Barun Gorain, Partha Sarathi Mandal, Sandip Das |
| 2013 | WALCOM | Voronoi Game on Graphs. | Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar |
| 2011 | AAIM | Minimum Width Rectangular Annulus. | Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das |
| 2011 | COCOON | Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. | Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das |
| 2011 | ICCSA | Untitled record | Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das, Partha P. Goswami |
| 2011 | WALCOM | Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. | Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das |
| 2010 | COCOA | Some Variations on Constrained Minimum Enclosing Circle Problem. | Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya |
| 2010 | WALCOM | Computation of Non-dominated Points Using Compact Voronoi Diagrams. | Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink |
| 2010 | WALCOM | A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 2008 | WALCOM | Guarding Exterior Region of a Simple Polygon. | Arindam Karmakar, Sasanka Roy, Sandip Das |
| 2007 | WALCOM | Base Station Placement Problem on the Boundary of a Convex Region. | Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy |
| 2006 | ICCSA | Optimal Guard Placement Problem Under L-Visibility. | Debabrata Bardhan, Sasanka Roy, Sandip Das |
| 2006 | ICCSA | Homogeneous 2-Hops Broadcast in 2D. | Gautam K. Das, Sandip Das, Subhas C. Nandy |
| 2006 | MFCS | Constrained Minimum Enclosing Circle with Center on a Query Line Segment. | Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy |
| 2005 | FPL | Fast FPGA Placement using Space-filling Curve. | Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy |
| 2005 | ICCSA | Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. | Sandip Das, Partha P. Goswami, Subhas C. Nandy |
| 2005 | ICDCIT | Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. | Sasanka Roy, Debabrata Bardhan, Sandip Das |
| 2005 | STACS | Shortest Monotone Descent Path Problem in Polyhedral Terrain. | Sasanka Roy, Sandip Das, Subhas C. Nandy |
| 2004 | HiPC | Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. | Gautam K. Das, Sandip Das, Subhas C. Nandy |
| 2004 | ICCSA | A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. | Sasanka Roy, Sandip Das, Subhas C. Nandy |
| 2003 | CIAC | An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 1999 | VLSID | Synthesis of Symmetric Functions for Path-Delay Fault Testability. | Susanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya |
| 1999 | VLSID | High Performance MCM Routing: A New Approach. | Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
| 1998 | VLSID | Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model. | Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya |
| 1996 | VLSID | Channel routing in Manhattan-diagonal model. | Sandip Das, Bhargab B. Bhattacharya |
| 1993 | VLSID | Via Minimization in Channel Routing by Layout Modification. | Sandip Das, Bhargab B. Bhattacharya |