21 results on '"Das, Sandip"'
Search Results
2. A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
3. Cops and Robber on butterflies, grids, and AT-free graphs
4. Approximation algorithms for orthogonal line centers
5. Triangle-free projective-planar graphs with diameter two: Domination and characterization
6. On clique numbers of colored mixed graphs
7. Bumblebee visitation problem
8. On fractional version of oriented coloring
9. Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
10. Variations of cops and robbers game on grids
11. On rectangle intersection graphs with stab number at most two
12. Optimizing movement in convex and non-convex path-networks to establish connectivity
13. Linear time algorithms for Euclidean 1-center in [formula omitted] with non-linear convex constraints
14. Relative clique number of planar signed graphs
15. Linear-time fitting of a [formula omitted]-step function
16. Optimal [formula omitted]-labeling of triangular lattice
17. Almost empty monochromatic triangles in planar point sets
18. Preface: CALDAM 2020
19. Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints
20. Linear-time fitting of a k-step function
21. Optimal L(3,2,1)-labeling of triangular lattice
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.