From post

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.

 

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

Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability., , , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 45-56. Springer, (2014)Computing Common Tangents Without a Separating Line., и . WADS, том 955 из Lecture Notes in Computer Science, стр. 183-193. Springer, (1995)On the Complexity of General Graph Factor Problems., и . SIAM J. Comput., 12 (3): 601-609 (1983)Alphabetic Minimax Trees., и . SIAM J. Comput., 14 (3): 514-526 (1985)The Ultimate Planar Convex Hull Algorithm?, и . SIAM J. Comput., 15 (1): 287-299 (1986)Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings., , , и . J. Algorithms, 23 (2): 291-328 (1997)Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings., , , и . J. ACM, 41 (2): 277-310 (1994)Improved Approximation for Guarding Simple Galleries from the Perimeter, и . CoRR, (2010)Approximating Barrier Resilience for Arrangements of Non-identical Disk Sensors., и . ALGOSENSORS, том 7718 из Lecture Notes in Computer Science, стр. 42-53. Springer, (2012)Input-Thrifty Extrema Testing., и . ISAAC, том 7074 из Lecture Notes in Computer Science, стр. 554-563. Springer, (2011)