Publisher
Springer Berlin Heidelberg
Cited by
98 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounding and Computing Obstacle Numbers of Graphs;SIAM Journal on Discrete Mathematics;2024-05-20
2. Happy Ending: An Empty Hexagon in Every Set of 30 Points;Lecture Notes in Computer Science;2024
3. Safe Smooth Paths Between Straight Line Obstacles;Lecture Notes in Computer Science;2024
4. Topological Art in Simple Galleries;Discrete & Computational Geometry;2023-08-27
5. The Dirac–Goodman–Pollack Conjecture;Discrete & Computational Geometry;2023-04-07