1. Packing paths perfectly;Akiyama;Discrete Math.,1990
2. Online algorithms for covering and packing problems with convex objectives;Azar,2016
3. Extension of vertex cover and independent set in some classes of graphs;Casel;Lect. Notes Comput. Sci.,2019
4. On the mutual-visibility in Cartesian products and in triangle-free graphs;Cicerone;Appl. Math. Comput.,2023
5. Mutual visibility in graphs;Di Stefano;Appl. Math. Comput.,2022