Go to the corresponding LIPIcs Volume Portal 
Bonsma, Paul ; Paulusma, Daniël
pdfformat: 

@InProceedings{bonsma_et_al:LIPIcs:2016:6435, author = {Paul Bonsma and Dani{\"e}l Paulusma}, title = {{Using Contracted Solution Graphs for Solving Reconfiguration Problems}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {20:120:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770163}, ISSN = {18688969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6435}, URN = {urn:nbn:de:0030drops64351}, doi = {10.4230/LIPIcs.MFCS.2016.20}, annote = {Keywords: reconfiguration, contraction, dynamic programming, graph coloring} }
Keywords:  reconfiguration, contraction, dynamic programming, graph coloring  
Seminar:  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  
Issue Date:  2016  
Date of publication:  19.08.2016 