# Sandip Das

According to our database

Collaborative distances:

^{1}, Sandip Das authored at least 124 papers between 1993 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

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

Discret. Appl. Math., 2020

Discret. Appl. Math., 2020

Discret. Appl. Math., 2020

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

Discret. Appl. Math., 2020

CoRR, 2020

CoRR, 2020

2019

Theor. Comput. Sci., 2019

Oper. Res. Lett., 2019

Theory Comput. Syst., 2019

CoRR, 2019

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

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

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

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

Largest Triangle inside a Terrain.

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Theor. Comput. Sci., 2018

Discret. Math., 2018

CoRR, 2018

CoRR, 2018

CoRR, 2018

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

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

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Inf. Process. Lett., 2017

Discret. Math., 2017

Discret. Appl. Math., 2017

Comput. Geom., 2017

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Discret. Math., 2016

Discret. Appl. Math., 2016

CoRR, 2016

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

Linear Time Algorithm for 1-Center in R<sup>d</sup> Under Convex Polyhedral Distance Function.

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

Proceedings of the Combinatorial Optimization and Applications, 2016

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

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

Theor. Comput. Sci., 2015

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

Electron. Notes Discret. Math., 2015

Electron. Notes Discret. Math., 2015

CoRR, 2015

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

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Comput. Geom., 2014

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

Proceedings of the Combinatorial Optimization and Applications, 2014

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Theor. Comput. Sci., 2013

Trans. Comput. Sci., 2013

Period. Math. Hung., 2013

J. Graph Theory, 2013

J. Comb. Optim., 2013

J. Comb. Optim., 2013

Electron. Notes Discret. Math., 2013

Discret. Math., 2013

Comput. Geom., 2013

Electron. J. Comb., 2013

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

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

One-Round Discrete Voronoi Game in ℝ<sup>2</sup> in Presence of Existing Facilities.

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

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

2011

J. Graph Algorithms Appl., 2011

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

2010

J. Discrete Algorithms, 2010

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

CoRR, 2010

CoRR, 2010

Comput. Geom., 2010

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

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

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

2009

ACM Trans. Embed. Comput. Syst., 2009

Inf. Process. Lett., 2009

Inf. Process. Lett., 2009

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

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

CoRR, 2009

Comput. Geom., 2009

Comput. Geom., 2009

2008

J. Parallel Distributed Comput., 2008

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

Inf. Process. Lett., 2008

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

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

Maximal Covering by Two Isothetic Unit Squares.

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.

Inf. Process. Lett., 2007

Comput. Geom., 2007

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

Proceedings of the Workshop on Algorithms and Computation 2007, 2007

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

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

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

2006

Theor. Comput. Sci., 2006

Pattern Recognit., 2006

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

J. Parallel Distributed Comput., 2006

Discret. Math., 2006

Proceedings of the Computational Science and Its Applications, 2006

Proceedings of the Computational Science and Its Applications, 2006

2005

Inf. Process. Lett., 2005

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

Proceedings of the Distributed Computing, 2005

Proceedings of the Distributed Computing and Internet Technology, 2005

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

Proceedings of the Computational Science and Its Applications, 2005

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

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

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

2004

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

Inf. Process. Lett., 2004

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

Comput. Geom., 2004

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

Proceedings of the Computational Science and Its Applications, 2004

Proceedings of the High Performance Computing, 2004

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

2003

Theor. Comput. Sci., 2003

J. Algorithms, 2003

Electron. Notes Discret. Math., 2003

Electron. Notes Discret. Math., 2003

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

2002

Proceedings of the Algorithm Theory, 2002

2000

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

1999

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

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.

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

1996

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

1993

Discret. Math., 1993

Proceedings of the Sixth International Conference on VLSI Design, 1993