( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Geometric Avatar Problems.

, и . FSTTCS, том 24 из LIPIcs, стр. 389-400. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)

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.

Shibashish Giri

Karthik Narasimhan

Wolfgang Girisch

Vijay Narasimhan

Srihari Narasimhan

 

Другие публикации лиц с тем же именем

A Note on the Hamiltonian Circuit Problem on Directed Path Graphs.. Inf. Process. Lett., 32 (4): 167-170 (1989)Microbiome maps: Hilbert curve visualizations of metagenomic profiles., , , , , и . Frontiers Bioinform., (мая 2023)On Hamiltonian Triangulations in Simple Polygons.. Int. J. Comput. Geom. Appl., 9 (3): 261-275 (1999)Geometric Spanners., , и . Encyclopedia of Algorithms, (2016)Resource-Constrained Geometric Network Optimization., , и . SCG, стр. 307-316. ACM, (1998)LR-visibility in Polygons., , и . CCCG, стр. 303-308. University of Waterloo, (1993)Distance-Preserving Approximations of Polygonal Paths., , и . FSTTCS, том 2914 из Lecture Notes in Computer Science, стр. 217-228. Springer, (2003)Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract)., , и . SWAT, том 824 из Lecture Notes in Computer Science, стр. 119-130. Springer, (1994)A branch-and-bound approach to knowledge-based protein structure assembly., и . BIBE, стр. 1-5. IEEE, (2008)Approximation Algorithms for the Bottleneck Stretch Factor Problem., и . STACS, том 2010 из Lecture Notes in Computer Science, стр. 502-513. Springer, (2001)