Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Ghosh, Subir Kumar"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some results on point visibility graphs
Subir Kumar Ghosh
,
Bodhayan Roy
Theoretical Computer Science
575
, 2015, pp. 17-32
Mapping a polygon with holes using a compass
Yann Disser
,
Subir Kumar Ghosh
,
Matús̑ Mihalák
,
Peter Widmayer
Theoretical Computer Science
553
, 2014, pp. 106-113
NC
-algorithms for minimum link path and related problems
Vijay Chandru
,
Subir Kumar Ghosh
,
Anil Maheshwari
,
V.T. Rajan
,
Sanjeev Saluja
Journal of Algorithms
19
(2), 1995, pp. 173-203
An optimal parallel algorithm for computing furthest neighbors in a tree
Subir Kumar Ghosh
,
Anil Maheshwari
Information Processing Letters
44
, 1992, pp. 155-160
Parallel algorithms for all minimum link paths and link center problems
Subir Kumar Ghosh
,
Anil Maheshwari
Lecture Notes in Computer Science
621
, 1992, pp. 106-117
Computing the shortest path tree in a weak visibility polygon
Subir Kumar Ghosh
,
Anil Maheshwari
,
Sudebkumar Prasant Pal
,
Sanjeev Saluja
,
C.E. Veni Madhavan
Lecture Notes in Computer Science
560
, 1991, pp. 369-389
An output-sensitive algorithm for computing visibility graphs
Subir Kumar Ghosh
,
David M. Mount
SIAM Journal on Computing
20
(5), 1991, October, pp. 888-910
Computing the visiblity polygon from a convex set and related problems
Subir Kumar Ghosh
Journal of Algorithms
12
, 1991, pp. 75-95
An optimal algorithm for computing a minimum nested nonconvex polygon
Subir Kumar Ghosh
,
Anil Maheshwari
Information Processing Letters
36
, 1990, pp. 277-280
Computing a viewpoint of a set of points inside a polygon
Subir Kumar Ghosh
Lecture Notes in Computer Science
338
, 1988, pp. 18-29