( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Depth-First Search Using O(n) Bits.

, , , , , , , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 553-564. Springer, (2014)

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.

Tetsuo Morino

Tetsuo Kishimoto

Naoko Asano

Dr. Igor A Asanov

Shoh Michael Asano

 

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

Do We Need a Stack to Erase a Component in a Binary Image?. FUN, том 6099 из Lecture Notes in Computer Science, стр. 16-27. Springer, (2010)Some theoretical challenges in digital geometry: A perspective., , и . Discret. Appl. Math., 157 (16): 3362-3371 (2009)Visibility of Disjoint Polygons., , , , и . Algorithmica, 1 (1): 49-63 (1986)Designing Algorithms with Limited Work Space.. TAMC, том 6648 из Lecture Notes in Computer Science, стр. 1. Springer, (2011)Dynamically Maintaining the Widest k -Dense Corridor., , и . CIAC, том 1767 из Lecture Notes in Computer Science, стр. 187-198. Springer, (2000)A Combined Radial Basis Function Model for Fingerprint Distortion., , и . ICIAR (2), том 4142 из Lecture Notes in Computer Science, стр. 286-296. Springer, (2006)Linear Boundary and Corner Detection Using Limited Number of Sensor Rows., , и . IWCIA, том 4958 из Lecture Notes in Computer Science, стр. 250-261. Springer, (2008)Effective Use of Geometric Properties for Clustering.. JCDCG, том 1763 из Lecture Notes in Computer Science, стр. 30-46. Springer, (1998)Visibility in the Plane., , и . Handbook of Computational Geometry, North Holland / Elsevier, (2000)Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming., , и . Int. J. Comput. Geom. Appl., 4 (1): 69-85 (1994)