%0 Conference Paper %1 conf/isaac/BirmeleMPV17 %A Birmelé, Etienne %A de Montgolfier, Fabien %A Planche, Léo %A Viennot, Laurent %B ISAAC %D 2017 %E Okamoto, Yoshio %E Tokuyama, Takeshi %I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik %K dblp %P 15:1-15:13 %T Decomposing a Graph into Shortest Paths with Bounded Eccentricity. %U http://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#BirmeleMPV17 %V 92 %@ 978-3-95977-054-5

@inproceedings{conf/isaac/BirmeleMPV17, added-at = {2018-08-23T00:00:00.000+0200}, author = {Birmelé, Etienne and de Montgolfier, Fabien and Planche, Léo and Viennot, Laurent}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/20341cc0a091140b39f05e6b9638eda7a/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/2017}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, ee = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.15}, interhash = {4e58d48982393de7070ff99ca35807ec}, intrahash = {0341cc0a091140b39f05e6b9638eda7a}, isbn = {978-3-95977-054-5}, keywords = {dblp}, pages = {15:1-15:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, series = {LIPIcs}, timestamp = {2019-09-27T12:36:55.000+0200}, title = {Decomposing a Graph into Shortest Paths with Bounded Eccentricity.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#BirmeleMPV17}, volume = 92, year = 2017 }