Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{jozeph:LIPIcs:2014:4702, author = {Shlomo Jozeph}, title = {{Universal Factor Graphs for Every NPHard Boolean CSP}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {274283}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897743}, ISSN = {18688969}, year = {2014}, volume = {28}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4702}, URN = {urn:nbn:de:0030drops47021}, doi = {10.4230/LIPIcs.APPROXRANDOM.2014.274}, annote = {Keywords: Hardness of Approximation, Hardness with Preprocessing} }
Keywords:  Hardness of Approximation, Hardness with Preprocessing  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)  
Issue Date:  2014  
Date of publication:  02.09.2014 