Andreas Darmann, Ulrich Pferschy, Joachim Schauer. The Shortest Path Game: Complexity and Algorithms. In Josep Diaz, Ivan Lanese, Davide Sangiorgi, editors, Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Volume 8705 of Lecture Notes in Computer Science, pages 39-53, Springer, 2014. [doi]
@inproceedings{DarmannPS14,
title = {The Shortest Path Game: Complexity and Algorithms},
author = {Andreas Darmann and Ulrich Pferschy and Joachim Schauer},
year = {2014},
doi = {10.1007/978-3-662-44602-7_4},
url = {http://dx.doi.org/10.1007/978-3-662-44602-7_4},
researchr = {https://researchr.org/publication/DarmannPS14},
cites = {0},
citedby = {0},
pages = {39-53},
booktitle = {Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings},
editor = {Josep Diaz and Ivan Lanese and Davide Sangiorgi},
volume = {8705},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-44601-0},
}