Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{haviv:LIPIcs:2019:10983, author = {Ishay Haviv}, title = {{Approximating the Orthogonality Dimension of Graphs and Hypergraphs}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {39:139:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771177}, ISSN = {18688969}, year = {2019}, volume = {138}, editor = {Peter Rossmanith and Pinar Heggernes and JoostPieter Katoen}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10983}, URN = {urn:nbn:de:0030drops109836}, doi = {10.4230/LIPIcs.MFCS.2019.39}, annote = {Keywords: orthogonal representations of hypergraphs, orthogonality dimension, hardness of approximation, Kneser and Schrijver graphs, semidefinite programming} }
Keywords:  orthogonal representations of hypergraphs, orthogonality dimension, hardness of approximation, Kneser and Schrijver graphs, semidefinite programming  
Collection:  44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)  
Issue Date:  2019  
Date of publication:  20.08.2019 