Sandip Das - RankMe

218 papers A 1B 18C 7Misc 12Journal 129Unranked 50

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Exact Algorithms for Resource Reallocation Under Budgetary Constraints. CoRR Arun Kumar Das, Sandip Das, Sweta Das, Foivos Fioravantes, Nikolaos Melissinos
2026	J	`jnl`	Growth rates of the number of empty triangles and simplices. Comput. Geom. Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen
2026	J	`jnl`	On the Number of Almost Empty Monochromatic Triangles. CoRR Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Aashirwad Mohapatra, Ishan Paul, Saumya Sen
2026	J	`jnl`	On the complexity of Multipacking. CoRR Sandip Das, Sk Samim Islam, Daniel Lokshtanov
2026	J	`jnl`	Parameterized complexity of r-Hop, r-Step, and r-Hop Roman Domination. CoRR Sandip Das, Sweta Das, Sk Samim Islam
2026	J	`jnl`	Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. Discret. Appl. Math. Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
2025	—	`conf`	Almost Empty Monochromatic Polygons in Planar Point Sets. CALDAM Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen
2025	J	`jnl`	Counting the minimum number of arcs in an oriented graph having weak diameter 2. Discret. Appl. Math. Sandip Das, Koushik Kumar Dey, Pavan P. D, Sagnik Sen
2025	J	`jnl`	Finding a largest-area triangle in a terrain in near-linear time. Comput. Geom. Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2025	B	`conf`	Multipacking and Broadcast Domination on Cactus Graphs and Its Impact on Hyperbolic Graphs. WALCOM Sandip Das, Sk Samim Islam
2025	—	`conf`	Multipacking in the Euclidean Metric Space. CALDAM Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M. Mitra, Bodhayan Roy
2025	B	`conf`	On Distance-d Independent Set Problems for Some Graph Classes. FCT Sandip Das, Soura Sena Das, Sweta Das, Sk Samim Islam
2025	J	`jnl`	On the Cop Number of String Graphs. Electron. J. Comb. Harmender Gahlawat, Sandip Das
2024	J	`jnl`	A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes. Discret. Appl. Math. Sandip Das, Subhadeep Ranjan Dev, Swami Sarvattomananda
2024	J	`jnl`	Cops and Robber on butterflies, grids, and AT-free graphs. Discret. Appl. Math. Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat
2024	—	`conf`	Growth Rate of the Number of Empty Triangles in the Plane. CALDAM Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen
2024	J	`jnl`	Growth Rate of the Number of Empty Triangles in the Plane. CoRR Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen
2024	J	`jnl`	Multipacking in Euclidean Plane. CoRR Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M. Mitra, Bodhayan Roy
2024	J	`jnl`	On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. Discret. Appl. Math. Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
2024	J	`jnl`	On the Cop Number of String Graphs. CoRR Sandip Das, Harmender Gahlawat
2024	J	`jnl`	Oriented total-coloring of oriented graphs. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen
2023	J	`jnl`	A Homomorphic Polynomial for Oriented Graphs. Electron. J. Comb. Sandip Das, Sumitava Ghosh, Swathy Prabhu, Sagnik Sen
2023	J	`jnl`	A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. CoRR Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2023	J	`jnl`	An update on (n, m)-chromatic numbers. CoRR Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
2023	J	`jnl`	Approximation algorithm for finding multipacking on Cactus. CoRR Sandip Das, Sk Samim Islam
2023	J	`jnl`	Approximation algorithms for orthogonal line centers. Discret. Appl. Math. Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2023	J	`jnl`	Burning a binary tree and its generalization. CoRR Sandip Das, Sk Samim Islam, Ritam M. Mitra, Sanchita Paul
2023	J	`jnl`	Complexity results on untangling red-blue matchings. Comput. Geom. Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2023	—	`conf`	Cops and Robber on Oriented Graphs with Respect to Push Operation. CALDAM Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen
2023	J	`jnl`	Counting the minimum number of arcs in an oriented graph having weak diameter 2. CoRR Sandip Das, Koushik Kumar Dey, Pavan P. D, Sagnik Sen
2023	J	`jnl`	On clique numbers of colored mixed graphs. Discret. Appl. Math. Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
2023	—	`conf`	Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. CALDAM Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
2023	—	`conf`	Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. CALDAM Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
2023	J	`jnl`	Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. CoRR Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
2023	J	`jnl`	Triangle-free projective-planar graphs with diameter two: Domination and characterization. Discret. Appl. Math. Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen
2022	—	`conf`	A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs. JCDCGGG Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2022	J	`jnl`	Bumblebee visitation problem. Discret. Appl. Math. Sandip Das, Harmender Gahlawat
2022	J	`jnl`	Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	B	`conf`	Complexity Results on Untangling Red-Blue Matchings. LATIN Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	B	`conf`	Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
2022	J	`jnl`	On dominating set of some subclasses of string graphs. Comput. Geom. Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
2022	J	`jnl`	On fractional version of oriented coloring. Discret. Appl. Math. Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen
2022	B	`conf`	On the Cop Number of String Graphs. ISAAC Sandip Das, Harmender Gahlawat
2022	J	`jnl`	On the signed chromatic number of some classes of graphs. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2022	J	`jnl`	Preface: CALDAM 2020. Discret. Appl. Math. Manoj Changat, Sandip Das
2022	J	`jnl`	The weighted Theor. Comput. Sci. Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2022	J	`jnl`	Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen
2022	—	`conf`	Voronoi Games Using Geodesics. CALDAM Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
2021	—	`conf`	A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes. CALDAM Sandip Das, Subhadeep Ranjan Dev, Swami Sarvottamananda
2021	—	`conf`	Approximation Algorithms for Orthogonal Line Centers. CALDAM Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2021	J	`jnl`	Computation of spatial skyline points. Comput. Geom. Binay Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink
2021	—	`conf`	Cops and Robber on Butterflies and Solid Grids. CALDAM Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat
2021	J	`jnl`	Cops and Robber on some families of oriented graphs. Theor. Comput. Sci. Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
2021	B	`conf`	Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2021	J	`jnl`	Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. CoRR Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2021	J	`jnl`	Largest triangle inside a terrain. Theor. Comput. Sci. Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2021	—	`conf`	On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. CALDAM Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo
2021	J	`jnl`	On clique numbers of colored mixed graphs. CoRR Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
2021	J	`jnl`	On fractional version of oriented coloring. CoRR Sandip Das, Soham Das, Swathy Prabhu, Sagnik Sen
2021	J	`jnl`	On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
2021	J	`jnl`	Oriented bipartite graphs and the Goldbach graph. Discret. Math. Sandip Das, Prantar Ghosh, Shamik Ghosh, Sagnik Sen
2021	J	`jnl`	Pushable chromatic number of graphs with degree constraints. Discret. Math. Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
2021	J	`jnl`	Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. Discret. Appl. Math. Sandip Das, Ayan Nandy, Swami Sarvottamananda
2021	J	`jnl`	Variations of cops and robbers game on grids. Discret. Appl. Math. Sandip Das, Harmender Gahlawat
2021	J	`jnl`	Voronoi game on polygons. Theor. Comput. Sci. Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
2020	B	`conf`	Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
2020	—	`ed.`	Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings CALDAM Manoj Changat, Sandip Das
2020	J	`jnl`	Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
2020	C	`conf`	Approximating k-Orthogonal Line Center. COCOA Barunabha Chakraborty, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2020	J	`jnl`	Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints. Discret. Appl. Math. Sandip Das, Ayan Nandy, Swami Sarvottamananda
2020	J	`jnl`	Linear-time fitting of a k-step function. Discret. Appl. Math. Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
2020	J	`jnl`	On the signed chromatic number of some classes of graphs. CoRR Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
2020	C	`conf`	Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. COCOA Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda
2020	J	`jnl`	Optimizing movement in convex and non-convex path-networks to establish connectivity. Discret. Appl. Math. Sandip Das, Ayan Nandy, Swami Sarvottamananda
2020	J	`jnl`	Relative clique number of planar signed graphs. Discret. Appl. Math. Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen
2019	B	`conf`	Approximating Minimum Dominating Set on String Graphs. WG Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
2019	J	`jnl`	Bounds on the Bend Number of Split and Cocomparability Graphs. Theory Comput. Syst. Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo
2019	—	`conf`	Bumblebee Visitation Problem. CALDAM Sandip Das, Harmender Gahlawat
2019	C	`conf`	Cops and Robber on Some Families of Oriented Graphs. IWOCA Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
2019	Misc	`conf`	Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. COCOON Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
2019	—	`conf`	Largest Triangle inside a Terrain. CCCG Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2019	—	`conf`	On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
2019	J	`jnl`	Pushable chromatic number of graphs with degree constraints. CoRR Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
2019	J	`jnl`	The 1-dimensional discrete Voronoi game. Oper. Res. Lett. Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das
2019	—	`conf`	The Relative Signed Clique Number of Planar Graphs is 8. CALDAM Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth
2019	B	`conf`	The Weighted k-Center Problem in Trees for Fixed k. ISAAC Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2019	J	`jnl`	The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
2018	J	`jnl`	A study on oriented relative clique number. Discret. Math. Sandip Das, Swathy Prabhu, Sagnik Sen
2018	J	`jnl`	Approximating Minimum Dominating Set on String Graphs. CoRR Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
2018	—	`conf`	Burning Spiders. CALDAM Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen
2018	J	`jnl`	Computing the Minkowski Sum of Convex Polytopes in R CoRR Sandip Das, Swami Sarvottamananda
2018	—	`conf`	On Oriented L(p, 1)-labeling. CALDAM Sandip Das, Soumen Nandi, Sagnik Sen
2018	J	`jnl`	On bounds on bend number of classes of split and cocomparability graphs. CoRR Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo
2018	J	`jnl`	On relative clique number of colored mixed graphs. CoRR Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen
2018	J	`jnl`	Optimizing squares covering a set of points. Theor. Comput. Sci. Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song
2018	—	`conf`	Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. CALDAM Sandip Das, Ayan Nandy, Swami Sarvottamananda
2018	—	`conf`	Variations of Cops and Robbers Game on Grids. CALDAM Sandip Das, Harmender Gahlawat
2017	J	`jnl`	A lower bound technique for radio k-coloring. Discret. Math. Sandip Das, Sasthi C. Ghosh, Soumen Nandi, Sagnik Sen
2017	—	`conf`	On Chromatic Number of Colored Mixed Graphs. CALDAM Sandip Das, Soumen Nandi, Sagnik Sen
2017	J	`jnl`	On representing a simple polygon perceivable to a blind person. Inf. Process. Lett. Sandip Banerjee, Bhargab B. Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mandal, Sasanka Roy
2017	J	`jnl`	Optimal L(3, 2, 1)-labeling of triangular lattice. Discret. Appl. Math. Sandip Das, Sasthi C. Ghosh, Soumen Nandi
2017	—	`conf`	Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity. CALDAM Sandip Das, Ayan Nandy, Swami Sarvottamananda
2017	J	`jnl`	The discrete Voronoi game in R Comput. Geom. Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee
2016	J	`jnl`	Almost empty monochromatic triangles in planar point sets. Discret. Appl. Math. Deepan Basu, Kinjal Basu, Bhaswar B. Bhattacharya, Sandip Das
2016	J	`jnl`	Forbidden substructure for interval digraphs/bigraphs. Discret. Math. Ashok Kumar Das, Sandip Das, Malay K. Sen
2016	Misc	`conf`	Linear Time Algorithm for 1-Center in R FAW Sandip Das, Ayan Nandy, Swami Sarvottamananda
2016	—	`conf`	Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints. CALDAM Sandip Das, Ayan Nandy, Swami Sarvottamananda
2016	—	`conf`	Linear-Time Fitting of a k-Step Function. CALDAM Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
2016	C	`conf`	On Local Structures of Cubicity 2 Graphs. COCOA Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
2016	J	`jnl`	On a special class of boxicity 2 graphs. CoRR Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
2016	J	`jnl`	On local structures of cubicity 2 graphs. CoRR Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
2016	J	`jnl`	Oriented Bipartite Graphs and the Goldbach Graph. CoRR Sandip Das, Shamik Ghosh, Prantar Ghosh, Sagnik Sen
2016	—	`conf`	Relative Clique Number of Planar Signed Graphs. CALDAM Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen
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	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	—	`conf`	Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2015	J	`jnl`	Linear-Time Fitting of a $k$-Step Function. CoRR Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda
2015	J	`jnl`	On L(k, k-1, ..., 1) labeling of triangular lattice. Electron. Notes Discret. Math. Soumen Nandi, Sagnik Sen, Sasthi C. Ghosh, Sandip Das
2015	—	`conf`	On a Special Class of Boxicity 2 Graphs. CALDAM Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
2015	J	`jnl`	On chromatic number of colored mixed graphs. CoRR Sandip Das, Soumen Nandi, Sagnik Sen
2015	J	`jnl`	On oriented relative clique number. Electron. Notes Discret. Math. Sandip Das, Swathyprabhu Mj, Sagnik Sen
2015	J	`jnl`	Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points. Int. J. Comput. Geom. Appl. Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
2015	J	`jnl`	Voronoi game on graphs. Theor. Comput. Sci. Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
2014	C	`conf`	A Facility Coloring Problem in 1-D. AAIM Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid
2014	—	`conf`	Efficient channel assignment for cellular networks modeled as honeycomb grid. ICTCS Soumen Nandi, Nitish Panigrahy, Mohit Agrawal, Sasthi Charan Ghosh, Sandip Das
2014	J	`jnl`	Minimum enclosing circle of a set of fixed points and a mobile point. Comput. Geom. Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
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	J	`jnl`	Voronoi Game on Graphs. CoRR Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
2013	J	`jnl`	Almost Empty Monochromatic Triangles in Planar Point Sets. Electron. Notes Discret. Math. Deepan Basu, Bhaswar B. Bhattacharya, Sandip Das
2013	J	`jnl`	Circular-Arc Bigraphs and Its Subclasses. J. Graph Theory Asim Basu, Sandip Das, Shamik Ghosh, Malay K. Sen
2013	J	`jnl`	Disjoint empty convex pentagons in planar point sets. Period. Math. Hung. Bhaswar B. Bhattacharya, Sandip Das
2013	J	`jnl`	Localized geometric query problems. Comput. Geom. John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2013	J	`jnl`	Minimum-width rectangular annulus. Theor. Comput. Sci. Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das
2013	J	`jnl`	On pseudo-convex partitions of a planar point set. Discret. Math. Bhaswar B. Bhattacharya, Sandip Das
2013	J	`jnl`	On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation. Trans. Comput. Sci. Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy
2013	—	`conf`	One-Round Discrete Voronoi Game in ℝ CCCG Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee
2013	J	`jnl`	Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
2013	Misc	`conf`	POSTER: Approximation Algorithm for Minimizing the Size of Coverage Hole in Wireless Sensor Networks. ICDCN Barun Gorain, Partha Sarathi Mandal, Sandip Das
2013	J	`jnl`	Recognition and Characterization of Chronological Interval Digraphs. Electron. J. Comb. Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang
2013	J	`jnl`	Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
2013	Misc	`conf`	The Discrete Voronoi Game in a Simple Polygon. COCOON Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
2013	—	`conf`	Two-Round Discrete Voronoi Game along a Line. FAW-AAIM Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das
2013	B	`conf`	Voronoi Game on Graphs. WALCOM Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
2012	—	`conf`	On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation. ISVD Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari, Sasanka Roy
2011	J	`jnl`	Guest Editor's Foreword. J. Graph Algorithms Appl. Sandip Das, Ryuhei Uehara
2011	J	`jnl`	Localized Geometric Query Problems CoRR John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2011	B	`conf`	Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
2011	—	`conf`	Minimum Width Rectangular Annulus. FAW-AAIM Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das
2011	Misc	`conf`	Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. COCOON Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
2010	B	`conf`	A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. WALCOM Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
2010	J	`jnl`	Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy
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	J	`jnl`	Holes or Empty Pseudo-Triangles in Planar Point Sets. CoRR Bhaswar B. Bhattacharya, Sandip Das
2010	J	`jnl`	Homogeneous 2-hop broadcast in 2D. Comput. Geom. Gautam K. Das, Sandip Das, Subhas C. Nandy
2010	J	`jnl`	Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location CoRR John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2010	—	`conf`	Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
2009	J	`jnl`	A new fast heuristic for labeling points. Inf. Process. Lett. Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy
2009	J	`jnl`	Constrained minimum enclosing circle with center on a query line segment. Comput. Geom. Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
2009	J	`jnl`	Covering a set of points in a plane using two parallel rectangles. Inf. Process. Lett. Chandan Saha, Sandip Das
2009	J	`jnl`	FPGA placement using space-filling curves: Theory meets practice. ACM Trans. Embed. Comput. Syst. Pritha Banerjee, Susmita Sur-Kolay, Arijit Bishnu, Sandip Das, Subhas C. Nandy, Subhasis Bhattacharjee
2009	J	`jnl`	Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. Int. J. Comput. Geom. Appl. Debabrata Bardhan, Sasanka Roy, Sandip Das
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`	Single facility collection depots location problem in the plane. Comput. Geom. Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
2009	J	`jnl`	Smallest Color-Spanning Object Revisited. Int. J. Comput. Geom. Appl. Sandip Das, Partha P. Goswami, Subhas C. Nandy
2009	B	`ed.`	WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings WALCOM Sandip Das, Ryuhei Uehara
2008	J	`jnl`	Approximation Algorithms for Shortest Descending Paths in Terrains CoRR Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy
2008	J	`jnl`	Base station placement on boundary of a convex polygon. J. Parallel Distributed Comput. Sasanka Roy, Debabrata Bardhan, Sandip Das
2008	J	`jnl`	Fast computation of smallest enclosing circle with center on a query line segment. Inf. Process. Lett. Arindam Karmakar, Sasanka Roy, Sandip Das
2008	B	`conf`	Guarding Exterior Region of a Simple Polygon. WALCOM Arindam Karmakar, Sasanka Roy, Sandip Das
2008	—	`conf`	Maximal Covering by Two Isothetic Unit Squares. CCCG Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
2008	J	`jnl`	Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
2007	—	`conf`	Approximate Shortest Descent Path on a Terrain. CCCG Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari
2007	B	`conf`	Base Station Placement Problem on the Boundary of a Convex Region. WALCOM Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
2007	J	`jnl`	Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. Partha P. Goswami, Sandip Das, Subhas C. Nandy
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	—	`conf`	Covering Points by Isothetic Unit Squares. CCCG Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das
2007	—	`conf`	Covering a Set of Points in a Plane Using Two Parallel Rectangles. ICCTA Chandan Saha, Sandip Das
2007	—	`conf`	Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. CCCG Arindam Karmakar, Sasanka Roy, Sandip Das
2007	J	`jnl`	Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. Sasanka Roy, Sandip Das, Subhas C. Nandy
2006	J	`jnl`	Chronological orderings of interval digraphs. Discret. Math. Malay K. Sen, P. Talukdar, Sandip Das
2006	B	`conf`	Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
2006	J	`jnl`	Efficient algorithm for placing a given number of base stations to cover a convex region. J. Parallel Distributed Comput. Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
2006	—	`conf`	Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) Gautam K. Das, Sandip Das, Subhas C. Nandy
2006	—	`conf`	Optimal Guard Placement Problem Under L-Visibility. ICCSA (1) Debabrata Bardhan, Sasanka Roy, Sandip Das
2006	J	`jnl`	Range assignment for energy efficient broadcasting in linear radio networks. Theor. Comput. Sci. Gautam K. Das, Sandip Das, Subhas C. Nandy
2006	J	`jnl`	Simple algorithms for partial point set pattern matching under rigid motion. Pattern Recognit. Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
2005	—	`conf`	A Fast Algorithm for Point Labeling Problem. CCCG Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy
2005	—	`conf`	Collection depot location problem in the plane. CCCG Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
2005	Misc	`conf`	Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. ICDCIT Sasanka Roy, Debabrata Bardhan, Sandip Das
2005	B	`conf`	Fast FPGA Placement using Space-filling Curve. FPL Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy
2005	J	`jnl`	Moving Griffith crack in an orthotropic strip with punches at boundary faces. Int. J. Math. Math. Sci. Satyaki Mukherjee, Sandip Das
2005	—	`conf`	Placing a Given Number of Base Stations to Cover a Convex Region. IWDC Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
2005	—	`conf`	Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. ICCSA (1) Sandip Das, Partha P. Goswami, Subhas C. Nandy
2005	A	`conf`	Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS Sasanka Roy, Sandip Das, Subhas C. Nandy
2005	J	`jnl`	Smallest Inf. Process. Lett. Sandip Das, Partha P. Goswami, Subhas C. Nandy
2004	—	`conf`	A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. ICCSA (3) Sasanka Roy, Sandip Das, Subhas C. Nandy
2004	Misc	`conf`	Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC Gautam K. Das, Sandip Das, Subhas C. Nandy
2004	J	`jnl`	Manhattan-diagonal routing in channels and switchboxes. ACM Trans. Design Autom. Electr. Syst. Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya
2004	J	`jnl`	Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
2004	—	`conf`	Smallest k point enclosing rectangle of arbitrary orientation. CCCG Sandip Das, Partha P. Goswami, Subhas C. Nandy
2004	J	`jnl`	Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. Partha P. Goswami, Sandip Das, Subhas C. Nandy
2003	C	`conf`	An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. CIAC Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
2003	J	`jnl`	An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. Subhas C. Nandy, Sandip Das, Partha P. Goswami
2003	J	`jnl`	Chronological Orderings of Interval Digraph. Electron. Notes Discret. Math. Malay K. Sen, P. Talukdar, Sandip Das
2003	J	`jnl`	Homogeneously Representable Interval Bigraphs. Electron. Notes Discret. Math. Sandip Das, P. Talukdar, Malay K. Sen
2003	J	`jnl`	Largest empty rectangle among a point set. J. Algorithms Jeet Chaudhuri, Subhas C. Nandy, Sandip Das
2002	—	`conf`	Optimal Algorithm for a Special Point-Labeling Problem. SWAT Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
2002	—	`conf`	Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. SWAT Partha P. Goswami, Sandip Das, Subhas C. Nandy
2000	J	`jnl`	Synthesis of symmetric functions for path-delay fault testability. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Susanta Chakrabarti, Sandip Das, Debesh Kumar Das, Bhargab B. Bhattacharya
1999	Misc	`conf`	High Performance MCM Routing: A New Approach. VLSI Design Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
1999	Misc	`conf`	Synthesis of Symmetric Functions for Path-Delay Fault Testability. VLSI Design Susanta Chakraborty, Sandip Das, Debesh K. Das, Bhargab B. Bhattacharya
1998	Misc	`conf`	Routing of L-Shaped Channels, Switchboxes and Staircases in Manhattan-Diagonal Model. VLSI Design Sandip Das, Susmita Sur-Kolay, Bhargab B. Bhattacharya
1996	Misc	`conf`	Channel routing in Manhattan-diagonal model. VLSI Design Sandip Das, Bhargab B. Bhattacharya
1993	J	`jnl`	An interval digraph in relation to its associated bipartite graph. Discret. Math. Sandip Das, Malay K. Sen
1993	Misc	`conf`	Via Minimization in Channel Routing by Layout Modification. VLSI Design Sandip Das, Bhargab B. Bhattacharya
1989	J	`jnl`	Circular-arc digraphs: A characterization. J. Graph Theory Malay K. Sen, Sandip Das, Douglas B. West
1989	J	`jnl`	Interval digraphs: An analogue of interval graphs. J. Graph Theory Sandip Das, Malay K. Sen, A. B. Roy, Douglas B. West