Author:
Abramovskaya T. V.,Petrov N. N.
Reference100 articles.
1. T. V. Abramovskaya, “Nontrivial discontinuities of the Golovach functions for trees,” Vestnik St. Petersburg Univ.: Math. 43(3), 123–130 (2010).
2. T. V. Abramovskaya and N. N. Petrov, “On some problems of guaranteed search on graphs,” Vestnik St. Petersburg Univ.: Math. 43(2), 68–73 (2010).
3. T. V. Abramovskaya and N. N. Petrov, “Arbitrarily large jumps of the Golovach function for trees,” Vestnik St. Petersburg Univ.: Math. 44(1), 59–65 (2011).
4. T. V. Abramovskaya and N. N. Petrov, “Monotonicity of the search number in the Golovach problem,” Vestnik St. Petersburg Univ.: Math. 44(4), 239–243 (2011).
5. V. Yu. Andrianov and N. N. Petrov, “Search with retaliation,” Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk 8(2), 1–9 (2002).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Asymptotically-Optimal Multi-Robot Visibility-Based Pursuit-Evasion;2024 IEEE International Conference on Robotics and Automation (ICRA);2024-05-13
2. Cops and Robbers: A Game of Pursuit on Graphs;Procedia Computer Science;2023
3. Rapid Recovery from Robot Failures in Multi-Robot Visibility-Based Pursuit-Evasion;2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2021-09-27
4. Complete and optimal visibility-based pursuit-evasion;The International Journal of Robotics Research;2017-07