Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{haviv:LIPIcs:2018:9446, author = {Ishay Haviv}, title = {{On Minrank and Forbidden Subgraphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {42:142:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770859}, ISSN = {18688969}, year = {2018}, volume = {116}, editor = {Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9446}, URN = {urn:nbn:de:0030drops94461}, doi = {10.4230/LIPIcs.APPROXRANDOM.2018.42}, annote = {Keywords: Minrank, Forbidden subgraphs, Shannon capacity, Circuit Complexity} }
Keywords:  Minrank, Forbidden subgraphs, Shannon capacity, Circuit Complexity  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)  
Issue Date:  2018  
Date of publication:  13.08.2018 