Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs"
@inproceedings{DBLP:conf/sofsem/LingasS12, author = {Andrzej Lingas and Dzmitry Sledneu}, editor = {M{\'{a}}ria Bielikov{\'{a}} and Gerhard Friedrich and Georg Gottlob and Stefan Katzenbeisser and Gy{\"{o}}rgy Tur{\'{a}}n}, title = {A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs}, booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7147}, pages = {373--384}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-27660-6\_31}, doi = {10.1007/978-3-642-27660-6\_31}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/LingasS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1111-6519, author = {Andrzej Lingas and Dzmitry Sledneu}, title = {A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs}, journal = {CoRR}, volume = {abs/1111.6519}, year = {2011}, url = {http://arxiv.org/abs/1111.6519}, eprinttype = {arXiv}, eprint = {1111.6519}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-6519.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.