( en | de | ru )

 

Disambiguation of "Ghosh, Subir Kumar"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for Computing Diffuse Reflection Paths in Polygons.

, , , , , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 47-58. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Santosh Kumar Ghosh

Sukhendu Kumar Ghosh

Ranjan Kumar Ghosh

Mantu Kumar Ghosh

Tapan Kumar Ghosh

 

Other publications of authors with the same name

Drawing Bipartite Graphs in Two Layers with Specified Crossings., , and . CALDAM, volume 11394 of Lecture Notes in Computer Science, page 97-108. Springer, (2019)A linear time algorithm to remove winding of a simple polygon., , and . Comput. Geom., 33 (3): 165-173 (2006)Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets., and . Comput. Geom., (1997)Two-layer Drawings of Bipartite Graphs., , and . Electron. Notes Discret. Math., (2017)Understanding discrete visibility and related approximation algorithms., and . CCCG, (1997)An Output Sensitive Algorithm for Computing Visibility Graphs, and . FOCS, page 11-19. IEEE Computer Society, (1987)Berge's theorem for the maximum charge problem., , , and . Discret. Optim., 3 (2): 174-178 (2006)Computing the Shortest Path Tree in a Weak Visibility Polygon., , , , and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 369-389. Springer, (1991)Computing a Viewpoint of a Set of Points Inside a Polygon.. FSTTCS, volume 338 of Lecture Notes in Computer Science, page 18-29. Springer, (1988)Parallel Algorithms for All Minimum Link Paths and Link Center Problems., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 106-117. Springer, (1992)