Sandip Das

According to our database1, 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

Relative clique number of planar signed graphs.
Discret. Appl. Math., 2020

Linear-time fitting of a k-step function.
Discret. Appl. Math., 2020

Optimizing movement in convex and non-convex path-networks to establish connectivity.
Discret. Appl. Math., 2020

On the signed chromatic number of some classes of graphs.
CoRR, 2020

Algorithms and complexity for geodetic sets on planar and chordal graphs.
CoRR, 2020

2019
The discrete Voronoi game in a simple polygon.
Theor. Comput. Sci., 2019

The 1-dimensional discrete Voronoi game.
Oper. Res. Lett., 2019

Bounds on the Bend Number of Split and Cocomparability Graphs.
Theory Comput. Syst., 2019

Pushable chromatic number of graphs with degree constraints.
CoRR, 2019

Approximating Minimum Dominating Set on String Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Cops and Robber on Some Families of Oriented Graphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

The Weighted k-Center Problem in Trees for Fixed k.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Dominating Set on Overlap Graphs of Rectangles Intersecting a Line.
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

On Rectangle Intersection Graphs with Stab Number at Most Two.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

The Relative Signed Clique Number of Planar Graphs is 8.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

Bumblebee Visitation Problem.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Optimizing squares covering a set of points.
Theor. Comput. Sci., 2018

A study on oriented relative clique number.
Discret. Math., 2018

Computing the Minkowski Sum of Convex Polytopes in R<sup>d</sup>.
CoRR, 2018

On relative clique number of colored mixed graphs.
CoRR, 2018

On bounds on bend number of classes of split and cocomparability graphs.
CoRR, 2018

Variations of Cops and Robbers Game on Grids.
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

On Oriented L(p, 1)-labeling.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

Burning Spiders.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
On representing a simple polygon perceivable to a blind person.
Inf. Process. Lett., 2017

A lower bound technique for radio k-coloring.
Discret. Math., 2017

Optimal L(3, 2, 1)-labeling of triangular lattice.
Discret. Appl. Math., 2017

The discrete Voronoi game in R<sup>2</sup>.
Comput. Geom., 2017

On Chromatic Number of Colored Mixed Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Forbidden substructure for interval digraphs/bigraphs.
Discret. Math., 2016

Almost empty monochromatic triangles in planar point sets.
Discret. Appl. Math., 2016

Oriented Bipartite Graphs and the Goldbach Graph.
CoRR, 2016

The p-Center Problem in Tree Networks Revisited.
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

On Local Structures of Cubicity 2 Graphs.
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

Relative Clique Number of Planar Signed Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Voronoi game on graphs.
Theor. Comput. Sci., 2015

Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points.
Int. J. Comput. Geom. Appl., 2015

On L(k, k-1, ..., 1) labeling of triangular lattice.
Electron. Notes Discret. Math., 2015

On oriented relative clique number.
Electron. Notes Discret. Math., 2015

Geometric k-Center Problems with Centers Constrained to Two Lines.
CoRR, 2015

Geometric p-Center Problems with Centers Constrained to Two Lines.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

On a Special Class of Boxicity 2 Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
Minimum enclosing circle of a set of fixed points and a mobile point.
Comput. Geom., 2014

Efficient channel assignment for cellular networks modeled as honeycomb grid.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

Optimizing Squares Covering a Set of Points.
Proceedings of the Combinatorial Optimization and Applications, 2014

A Facility Coloring Problem in 1-D.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Minimum-width rectangular annulus.
Theor. Comput. Sci., 2013

On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation.
Trans. Comput. Sci., 2013

Disjoint empty convex pentagons in planar point sets.
Period. Math. Hung., 2013

Circular-Arc Bigraphs and Its Subclasses.
J. Graph Theory, 2013

Some variations on constrained minimum enclosing circle problem.
J. Comb. Optim., 2013

Optimal strategies for the one-round discrete Voronoi game on a line.
J. Comb. Optim., 2013

Almost Empty Monochromatic Triangles in Planar Point Sets.
Electron. Notes Discret. Math., 2013

On pseudo-convex partitions of a planar point set.
Discret. Math., 2013

Localized geometric query problems.
Comput. Geom., 2013

Recognition and Characterization of Chronological Interval Digraphs.
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

Two-Round Discrete Voronoi Game along a Line.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2011
Guest Editor's Foreword.
J. Graph Algorithms Appl., 2011

<i>k</i>-Enclosing Axis-Parallel Square.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2010
Approximation algorithms for shortest descending paths in terrains.
J. Discrete Algorithms, 2010

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

Holes or Empty Pseudo-Triangles in Planar Point Sets.
CoRR, 2010

Homogeneous 2-hop broadcast in 2D.
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

Computation of Non-dominated Points Using Compact Voronoi Diagrams.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009
FPGA placement using space-filling curves: Theory meets practice.
ACM Trans. Embed. Comput. Syst., 2009

Covering a set of points in a plane using two parallel rectangles.
Inf. Process. Lett., 2009

A new fast heuristic for labeling points.
Inf. Process. Lett., 2009

Smallest Color-Spanning Object Revisited.
Int. J. Comput. Geom. Appl., 2009

Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon.
Int. J. Comput. Geom. Appl., 2009

On Finding Non-dominated Points using Compact Voronoi Diagrams
CoRR, 2009

Constrained minimum enclosing circle with center on a query line segment.
Comput. Geom., 2009

Single facility collection depots location problem in the plane.
Comput. Geom., 2009

2008
Base station placement on boundary of a convex polygon.
J. Parallel Distributed Comput., 2008

Fast computation of smallest enclosing circle with center on a query line segment.
Inf. Process. Lett., 2008

Variations of Base-Station Placement Problem on the Boundary of a Convex Region.
Int. J. Found. Comput. Sci., 2008

Guarding Exterior Region of a Simple Polygon.
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

Shortest monotone descent path problem in polyhedral terrain.
Comput. Geom., 2007

Base Station Placement Problem on the Boundary of a Convex Region.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Approximate Shortest Descent Path on a Terrain.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Covering Points by Isothetic Unit Squares.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Computing a planar widest empty alpha-siphon in o(n<sup>3</sup>) time.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Range assignment for energy efficient broadcasting in linear radio networks.
Theor. Comput. Sci., 2006

Simple algorithms for partial point set pattern matching under rigid motion.
Pattern Recognit., 2006

Efficient algorithm for placing a given number of base stations to cover a convex region.
J. Parallel Distributed Comput., 2006

Chronological orderings of interval digraphs.
Discret. Math., 2006

Homogeneous 2-Hops Broadcast in 2D.
Proceedings of the Computational Science and Its Applications, 2006

Optimal Guard Placement Problem Under L-Visibility.
Proceedings of the Computational Science and Its Applications, 2006

2005
Smallest <i>k</i>-point enclosing rectangle and square of arbitrary orientation.
Inf. Process. Lett., 2005

Moving Griffith crack in an orthotropic strip with punches at boundary faces.
Int. J. Math. Math. Sci., 2005

Placing a Given Number of Base Stations to Cover a Convex Region.
Proceedings of the Distributed Computing, 2005

Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone.
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

Fast FPGA Placement using Space-filling Curve.
Proceedings of the 2005 International Conference on Field Programmable Logic and Applications (FPL), 2005

A Fast Algorithm for Point Labeling Problem.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Collection depot location problem in the plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Manhattan-diagonal routing in channels and switchboxes.
ACM Trans. Design Autom. Electr. Syst., 2004

Optimal algorithm for a special point-labeling problem.
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

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.
Proceedings of the High Performance Computing, 2004

Smallest k point enclosing rectangle of arbitrary orientation.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
An efficient k nearest neighbors searching algorithm for a query line.
Theor. Comput. Sci., 2003

Largest empty rectangle among a point set.
J. Algorithms, 2003

Chronological Orderings of Interval Digraph.
Electron. Notes Discret. Math., 2003

Homogeneously Representable Interval Bigraphs.
Electron. Notes Discret. Math., 2003

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.
Proceedings of the Algorithm Theory, 2002

2000
Synthesis of symmetric functions for path-delay fault testability.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2000

1999
High Performance MCM Routing: A New Approach.
Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999

Synthesis of Symmetric Functions for Path-Delay Fault Testability.
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
Channel routing in Manhattan-diagonal model.
Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996

1993
An interval digraph in relation to its associated bipartite graph.
Discret. Math., 1993

Via Minimization in Channel Routing by Layout Modification.
Proceedings of the Sixth International Conference on VLSI Design, 1993


  Loading...