Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{takhanov:LIPIcs:2010:2493, author = {Rustem Takhanov}, title = {{A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {657668}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897163}, ISSN = {18688969}, year = {2010}, volume = {5}, editor = {JeanYves Marion and Thomas Schwentick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2493}, URN = {urn:nbn:de:0030drops24936}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2493}, annote = {Keywords: Minimum cost homomorphisms problem, relational clones, constraint satisfaction problem, perfect graphs, supervised learning} }
Keywords:  Minimum cost homomorphisms problem, relational clones, constraint satisfaction problem, perfect graphs, supervised learning  
Seminar:  27th International Symposium on Theoretical Aspects of Computer Science  
Issue Date:  2010  
Date of publication:  09.03.2010 