Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{chawin_et_al:LIPIcs.STACS.2023.20, author = {Chawin, Dror and Haviv, Ishay}, title = {{Improved NPHardness of Approximation for Orthogonality Dimension and Minrank}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {20:120:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772662}, ISSN = {18688969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17672}, URN = {urn:nbn:de:0030drops176724}, doi = {10.4230/LIPIcs.STACS.2023.20}, annote = {Keywords: hardness of approximation, graph coloring, orthogonality dimension, minrank, index coding} }
Keywords:  hardness of approximation, graph coloring, orthogonality dimension, minrank, index coding  
Collection:  40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)  
Issue Date:  2023  
Date of publication:  03.03.2023 