1. Alt, H., Cabello, S., Giannopoulos, P., Knauer, C.: On some connection problems in straight-line segment arrangements. In: 27th EuroCG, pp. 27–30 (2011)
2. Bandyapadhyay, S., Kumar, N., Suri, S., Varadarajan, K.: Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. 90, 101650 (2020)
3. Basch, J., Guibas, L.J., Hsu, D., Nguyen, A.T.: Disconnection proofs for motion planning. In: Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No. 01CH37164), vol. 2, pp. 1765–1772. IEEE (2001)
4. Bereg, S., Kirkpatrick, D.: Approximating barrier resilience in wireless sensor networks. In: Algorithmic Aspects of Wireless Sensor Networks: 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 10–11, 2009. Revised Selected Papers 5, pp. 29–40. Springer, Berlin (2009)
5. Chan, D.Y.C., Kirkpatrick, D.: Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience. Theor. Comput. Sci. 553, 74–90 (2014)