The following pages link to Asish Kumar Mukhopadhyay (Q725596):
Displaying 35 items.
- (Q396655) (redirect page) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- The ordinary line problem revisited (Q427057) (← links)
- QCA gray code converter circuits using LTEx methodology (Q725598) (← links)
- On the all-farthest-segments problem for a planar set of points (Q845846) (← links)
- (Q1330884) (redirect page) (← links)
- A new necessary condition for the vertex visibility graphs of simple polygons (Q1330885) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- From approximate balls to approximate ellipses (Q1955552) (← links)
- Algorithms for generating strongly chordal graphs (Q2233439) (← links)
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039) (← links)
- On intersecting a set of parallel line segments with a convex polygon of minimum area (Q2380042) (← links)
- Algorithms for Problems on Maximum Density Segment (Q2795931) (← links)
- Approximate Ellipsoid in the Streaming Model (Q3066474) (← links)
- Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions (Q3082972) (← links)
- (Q3660785) (← links)
- (Q3727249) (← links)
- (Q4037437) (← links)
- (Q4256651) (← links)
- (Q4385174) (← links)
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233) (← links)
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES (Q4682206) (← links)
- A Solution to the Polynomial Hensel Code Conversion Problem (Q4720783) (← links)
- (Q4779120) (← links)
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons (Q4876693) (← links)
- (Q4948734) (← links)
- Semi-dynamic algorithms for strongly chordal graphs (Q5013507) (← links)
- A linear-time construction of the relative neighborhood graph within a histogram (Q5057436) (← links)
- Three Paths to Point Placement (Q5174947) (← links)
- More on Generalized Jewels and the Point Placement Problem (Q5404399) (← links)
- A separator-based method for generating weakly chordal graphs (Q5858151) (← links)
- Discrete and Computational Geometry (Q5897091) (← links)
- Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)
- A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences (Q6637059) (← links)
- On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors (Q6750309) (← links)
