Go to the corresponding LIPIcs Volume Portal 
Curticapean, Radu ; Dell, Holger ; Roth, Marc
pdfformat: 

@InProceedings{curticapean_et_al:LIPIcs:2017:7008, author = {Radu Curticapean and Holger Dell and Marc Roth}, title = {{Counting EdgeInjective Homomorphisms and Matchings on Restricted Graph Classes}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {25:125:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770286}, ISSN = {18688969}, year = {2017}, volume = {66}, editor = {Heribert Vollmer and Brigitte Vallée}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7008}, URN = {urn:nbn:de:0030drops70080}, doi = {10.4230/LIPIcs.STACS.2017.25}, annote = {Keywords: matchings, homomorphisms, line graphs, counting complexity, parameterized complexity} }
Keywords:  matchings, homomorphisms, line graphs, counting complexity, parameterized complexity  
Seminar:  34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)  
Issue Date:  2017  
Date of publication:  24.02.2017 