Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{vikas:LIPIcs:2017:8137, author = {Narayan Vikas}, title = {{Computational Complexity of Graph Partition under VertexCompaction to an Irreflexive Hexagon}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {69:169:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770460}, ISSN = {18688969}, year = {2017}, volume = {83}, editor = {Kim G. Larsen and Hans L. Bodlaender and JeanFrancois Raskin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8137}, URN = {urn:nbn:de:0030drops81374}, doi = {10.4230/LIPIcs.MFCS.2017.69}, annote = {Keywords: computational complexity, algorithms, graph, partition, colouring, homomorphism, retraction, compaction, vertexcompaction} }
Keywords:  computational complexity, algorithms, graph, partition, colouring, homomorphism, retraction, compaction, vertexcompaction  
Seminar:  42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)  
Issue Date:  2017  
Date of publication:  22.11.2017 