%0 Conference Paper %1 conf/ifipTCS/DarmannPS14 %A Darmann, Andreas %A Pferschy, Ulrich %A Schauer, Joachim %B IFIP TCS %D 2014 %E Díaz, Josep %E Lanese, Ivan %E Sangiorgi, Davide %I Springer %K dblp %P 39-53 %T The Shortest Path Game: Complexity and Algorithms. %U http://dblp.uni-trier.de/db/conf/ifipTCS/ifipTCS2014.html#DarmannPS14 %V 8705 %@ 978-3-662-44601-0

@inproceedings{conf/ifipTCS/DarmannPS14, added-at = {2018-12-23T00:00:00.000+0100}, author = {Darmann, Andreas and Pferschy, Ulrich and Schauer, Joachim}, biburl = {https://www.bibsonomy.org/bibtex/29e094f6a68ce8435e002f70894298e8e/dblp}, booktitle = {IFIP TCS}, crossref = {conf/ifipTCS/2014}, editor = {Díaz, Josep and Lanese, Ivan and Sangiorgi, Davide}, ee = {https://doi.org/10.1007/978-3-662-44602-7_4}, interhash = {cdf4c3c343cb03ad031f64ac24e37179}, intrahash = {9e094f6a68ce8435e002f70894298e8e}, isbn = {978-3-662-44601-0}, keywords = {dblp}, pages = {39-53}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:21:17.000+0200}, title = {The Shortest Path Game: Complexity and Algorithms.}, url = {http://dblp.uni-trier.de/db/conf/ifipTCS/ifipTCS2014.html#DarmannPS14}, volume = 8705, year = 2014 }