( en | de | ru )

 

Disambiguation of "Narasimhan, Giri"

Author of the publication

copydeleteadd this publication to your clipboard
Balanced Partition of Minimum Spanning Trees.

, , , and . International Conference on Computational Science (3), volume 2331 of Lecture Notes in Computer Science, page 26-35. Springer, (2002)

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.

Shibashish Giri

Karthik Narasimhan

Wolfgang Girisch

Vijay Narasimhan

Srihari Narasimhan

 

Other publications of authors with the same name

A Generalization of Lovasz's 0_ Function., and . Polyhedral Combinatorics, volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 19-28. DIMACS/AMS, (1990)Degenerate Primer Design via Clustering., , and . CSB, page 75-83. IEEE Computer Society, (2003)Geometric Searching and Link Distance (Extended Abstract)., and . WADS, volume 519 of Lecture Notes in Computer Science, page 261-272. Springer, (1991)On Hamiltonian Triangulations in Simple Polygons (Extended Abstract).. WADS, volume 1272 of Lecture Notes in Computer Science, page 321-330. Springer, (1997)A Graph Reduction Method for 2D Snake Problems., , , , and . CVPR, IEEE Computer Society, (2007)Planar Geometric Spanners., , and . Encyclopedia of Algorithms, Springer, (2008)Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners., , and . STOC, page 186-195. ACM, (1998)Weighted Consensus Clustering for Identifying Functional Modules in Protein-Protein Interaction Networks., , , and . ICMLA, page 539-544. IEEE Computer Society, (2009)LR-visibility in Polygons., , and . Comput. Geom., (1997)Optimally computing a shortest weakly visible line segment inside a simple polygon., , , and . Comput. Geom., 23 (1): 1-29 (2002)