Commit 7cc6e463 authored by André Nichterlein's avatar André Nichterlein
Browse files

updates and fixes

parent ac0ac312
......@@ -73,10 +73,11 @@
series = {Lecture Notes in Computer Science},
publisher = {Springer},
year = {2021},
volume = {12701},
pages = {216--230},
url = {https://arxiv.org/abs/2006.14972},
url2 = {},
url2 = {https://doi.org/10.1007/978-3-030-75242-2\_15},
type = {conference2021},
note = {Accepted for publication.}
}
@inproceedings {conference-BN21,
......@@ -123,9 +124,8 @@
}
@inproceedings {conference-RMNN21,
title = {Towards Classifying the Polynomial-Time
Solvability of Temporal Betweenness Centrality},
author = {Maciej Rymar and Hendrik Molter and Andr{\'{e}} Nicherlein and Rolf Niedermeier},
title = {Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality},
author = {Maciej Rymar and Hendrik Molter and Andr{\'{e}} Nichterlein and Rolf Niedermeier},
booktitle = {Proceedings of the 47th International Workshop
on Graph-Theoretic Concepts in Computer Science (WG '21)},
year = {2021},
......@@ -155,3 +155,15 @@ on Graph-Theoretic Concepts in Computer Science (WG '21)},
url = {https://arxiv.org/abs/2105.07006},
}
@inproceedings{conference-BNRZ21,
title = {{Using a Geometric Lens to Find k Disjoint Shortest Paths}},
author = {Matthias Bentert and Andr\'{e} Nichterlein and Malte Renken and Philipp Zschoche},
booktitle = {Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {26:1--26:14},
series = {LIPIcs},
year = {2021},
volume = {198},
type = {conference2021},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
url = {https://drops.dagstuhl.de/opus/volltexte/2021/14095},
}
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment