Go to the corresponding Portal 
pdfformat: 

@InProceedings{bonsma:LIPIcs:2012:3871, author = {Paul Bonsma}, title = {{Rerouting shortest paths in planar graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) }, pages = {337349}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897477}, ISSN = {18688969}, year = {2012}, volume = {18}, editor = {Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3871}, URN = {urn:nbn:de:0030drops38715}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.337}, annote = {Keywords: shortest path, rerouting, reconfiguration problem, planar graph, polynomial time, dynamic programming} }
Keywords:  shortest path, rerouting, reconfiguration problem, planar graph, polynomial time, dynamic programming  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)  
Issue Date:  2012  
Date of publication:  10.12.2012 