The following pages link to Sandip Das (Q299088):
Displaying 50 items.
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- Largest triangle inside a terrain (Q2222094) (← links)
- Disjoint empty convex pentagons in planar point sets (Q2250824) (← links)
- The 1-dimensional discrete Voronoi game (Q2294280) (← links)
- Dominating set on overlap graphs of rectangles intersecting a line (Q2300029) (← links)
- Approximating minimum dominating set on string graphs (Q2301546) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- The discrete Voronoi game in a simple polygon (Q2326396) (← links)
- The relative signed clique number of planar graphs is 8 (Q2326575) (← links)
- Optimal \(L(3, 2, 1)\)-labeling of triangular lattice (Q2357158) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- Burning spiders (Q2636560) (← links)
- On oriented \(L(p,1)\)-labeling (Q2636569) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- A homomorphic polynomial for oriented graphs (Q2692188) (← links)
- Approximating \(k\)-orthogonal line center (Q2692202) (← links)
- Optimal strategies in single round Voronoi game on convex polygons with constraints (Q2692236) (← links)
- Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points (Q2792797) (← links)
- Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
- Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints (Q2795940) (← links)
- Relative Clique Number of Planar Signed Graphs (Q2795959) (← links)
- On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation (Q2868517) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
- On Local Structures of Cubicity 2 Graphs (Q2958318) (← links)
- On Chromatic Number of Colored Mixed Graphs (Q2971641) (← links)
- Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity (Q2971642) (← links)
- Minimum Width Rectangular Annulus (Q3004689) (← links)
- (Q3046479) (← links)
- (Q3046483) (← links)
- Some Variations on Constrained Minimum Enclosing Circle Problem (Q3066170) (← links)
- Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point (Q3078388) (← links)
- Optimal Strategies for the One-Round Discrete Voronoi Game on a Line (Q3087952) (← links)
- GUARD PLACEMENT FOR MAXIMIZING <font>L</font>-VISIBILITY EXTERIOR TO A CONVEX POLYGON (Q3401891) (← links)
- Computation of Non-dominated Points Using Compact Voronoi Diagrams (Q3404431) (← links)
- A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion (Q3404433) (← links)
- Chronological Orderings of Interval Digraph (Q3439082) (← links)
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
- Homogeneous 2-Hops Broadcast in 2D (Q3599030) (← links)
- SMALLEST COLOR-SPANNING OBJECT REVISITED (Q3647618) (← links)
- Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
- The $p$-Center Problem in Tree Networks Revisited (Q5369508) (← links)
- On the minimum size of a point set containing a 5-hole and a disjoint 4-hole (Q5389357) (← links)
- (Q5875588) (← links)
- (Q6065396) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- Approximation algorithms for orthogonal line centers (Q6166042) (← links)
