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.

 

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

A time-constrained variation of the Watchman's Walk problem., и . Australas. J Comb., (2012)Sweeping Graphs with Large Clique Number., , и . ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 908-920. Springer, (2004)Arc Searching Digraphs Without Jumping., , , и . COCOA, том 4616 из Lecture Notes in Computer Science, стр. 354-365. Springer, (2007)Zero-visibility cops and robber and the pathwidth of a graph., , , и . J. Comb. Optim., 29 (3): 541-564 (2015)Bounds on watching and watching graph products., и . Discuss. Math. Graph Theory, 42 (1): 63-79 (2022)On minimum cost edge searching., и . Theor. Comput. Sci., (2013)Edge searching weighted graphs., , , и . Discret. Appl. Math., 157 (8): 1913-1923 (2009)Three-fast-searchable graphs., , и . Discret. Appl. Math., 161 (13-14): 1950-1958 (2013)Limited visibility Cops and Robber., , , , , и . Discret. Appl. Math., (2020)Time constrained graph searching., , , и . Theor. Comput. Sci., 399 (3): 158-168 (2008)