Publisher
Springer International Publishing
Reference20 articles.
1. Ahmadinejad, A., Zarrabi-Zadeh, H.: Finding maximum disjoint set of boundary rectangles with application to PCB routing. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 36(3), 412–420 (2017)
2. Ahmadinejad, A., Assadi, S., Emamjomeh-Zadeh, E., Yazdanbod, S., Zarrabi-Zadeh, H.: On the rectangle escape problem. Theor. Comput. Sci. 689, 126–136 (2017)
3. Bandyapadhyay, S., Maheshwari, A., Mehrabi, S., Suri, S.: Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82, 32–44 (2019)
4. Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37–40 (1984)
5. Chan, T.M., Grant, E.: Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47(2, Part A), 112–124 (2014)