Asish Mukhopadhyay

Available identifiers

zbMath Open mukhopadhyay.asish-kumarMaRDI QIDQ725596

List of research outcomes

Publication	Date of Publication	Type
A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences	2024-11-13	Paper
Generating weakly chordal graphs from arbitrary graphs	2023-08-03	Paper
Computing in linear time a chord from which a simple polygon is weakly internally visible	2023-03-21	Paper
A linear-time construction of the relative neighborhood graph within a histogram	2022-12-16	Paper
Semi-dynamic algorithms for strongly chordal graphs	2021-11-30	Paper
Algorithms for generating strongly chordal graphs	2021-10-18	Paper
A separator-based method for generating weakly chordal graphs	2021-04-09	Paper
Semi-dynamic Algorithms for Strongly Chordal Graphs	2020-01-30	Paper
Strongly Chordal Graph Generation using Intersection Graph Characterisation	2019-07-25	Paper
QCA gray code converter circuits using LTEx methodology	2018-08-01	Paper
Linear layouts of weakly triangulated graphs	2016-09-16	Paper
Algorithms for Problems on Maximum Density Segment	2016-03-23	Paper
Three Paths to Point Placement	2015-02-19	Paper
All-maximum and all-minimum problems under some measures	2014-08-13	Paper
More on Generalized Jewels and the Point Placement Problem	2014-03-24	Paper
From approximate balls to approximate ellipses	2013-06-14	Paper
The ordinary line problem revisited	2012-06-13	Paper
Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions	2011-03-18	Paper
Approximate Ellipsoid in the Streaming Model	2011-01-10	Paper
On intersecting a set of parallel line segments with a convex polygon of minimum area	2010-03-24	Paper
An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points	2010-03-24	Paper
Discrete and Computational Geometry	2010-02-05	Paper
On the all-farthest-segments problem for a planar set of points	2010-01-29	Paper
ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES	2005-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4779120	2002-11-24	Paper
Optimally computing a shortest weakly visible line segment inside a simple polygon	2002-09-03	Paper
Fast algorithms for computing \(\beta\)-skeletons and their relatives.	2001-01-01	Paper
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON	2000-11-07	Paper
https://portal.mardi4nfdi.de/entity/Q4948734	2000-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4256651	1999-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q4385174	1998-04-13	Paper
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons	1996-12-11	Paper
A new necessary condition for the vertex visibility graphs of simple polygons	1994-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4037437	1993-05-18	Paper
A Solution to the Polynomial Hensel Code Conversion Problem	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3727249	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3660785	1983-01-01	Paper

Research outcomes over time

This page was built for person: Asish Mukhopadhyay