Publisher
Springer Nature Switzerland
Reference22 articles.
1. Lecture Notes in Computer Science;A Adiga,2010
2. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335–379 (1976)
3. Caoduro, M.: Geometric challenges in combinatorial optimization: packing, hitting, and coloring rectangles. Ph.D. thesis, Laboratoire G-SCOP (Univ. Grenoble Alpes) (2022)
4. Caoduro, M., Lichev, L.: On the boxicity of Kneser graphs and complements of line graphs. Discret. Math. 346(5), 113333 (2023)
5. Caoduro, M., Sebő, A.: Boxicity and interval-orders: Petersen and the complements of line graphs. arxiv:2309.02062 (2023)