Standard
Faster separators for shallow minor-free graphs via dynamic approximate distance oracles. / Wulff-Nilsen, Christian.
Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. ed. / Javier Esparza; Pierre Fraigniaud; Thore Husfeldt; Elias Koutsoupias. Springer, 2014. p. 1063-1074 (Lecture notes in computer science, Vol. 8572).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Wulff-Nilsen, C 2014,
Faster separators for shallow minor-free graphs via dynamic approximate distance oracles. in J Esparza, P Fraigniaud, T Husfeldt & E Koutsoupias (eds),
Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Springer, Lecture notes in computer science, vol. 8572, pp. 1063-1074, 41st International Colloquium on Automata, Languages, and Programming, København, Denmark,
08/07/2014.
https://doi.org/10.1007/978-3-662-43948-7_88
APA
Wulff-Nilsen, C. (2014).
Faster separators for shallow minor-free graphs via dynamic approximate distance oracles. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds.),
Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (pp. 1063-1074). Springer. Lecture notes in computer science Vol. 8572
https://doi.org/10.1007/978-3-662-43948-7_88
Vancouver
Wulff-Nilsen C.
Faster separators for shallow minor-free graphs via dynamic approximate distance oracles. In Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E, editors, Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Springer. 2014. p. 1063-1074. (Lecture notes in computer science, Vol. 8572).
https://doi.org/10.1007/978-3-662-43948-7_88
Author
Wulff-Nilsen, Christian. / Faster separators for shallow minor-free graphs via dynamic approximate distance oracles. Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. editor / Javier Esparza ; Pierre Fraigniaud ; Thore Husfeldt ; Elias Koutsoupias. Springer, 2014. pp. 1063-1074 (Lecture notes in computer science, Vol. 8572).
Bibtex
@inproceedings{ad5680da2a614ea399f667e604c70c15,
title = "Faster separators for shallow minor-free graphs via dynamic approximate distance oracles",
author = "Christian Wulff-Nilsen",
year = "2014",
doi = "10.1007/978-3-662-43948-7_88",
language = "English",
isbn = "978-3-662-43947-0",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "1063--1074",
editor = "Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias",
booktitle = "Automata, languages, and programming",
address = "Switzerland",
note = "41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 ; Conference date: 08-07-2014 Through 11-07-2014",
}
RIS
TY - GEN
T1 - Faster separators for shallow minor-free graphs via dynamic approximate distance oracles
AU - Wulff-Nilsen, Christian
N1 - Conference code: 41
PY - 2014
Y1 - 2014
U2 - 10.1007/978-3-662-43948-7_88
DO - 10.1007/978-3-662-43948-7_88
M3 - Article in proceedings
SN - 978-3-662-43947-0
T3 - Lecture notes in computer science
SP - 1063
EP - 1074
BT - Automata, languages, and programming
A2 - Esparza, Javier
A2 - Fraigniaud, Pierre
A2 - Husfeldt, Thore
A2 - Koutsoupias, Elias
PB - Springer
T2 - 41st International Colloquium on Automata, Languages, and Programming
Y2 - 8 July 2014 through 11 July 2014
ER -
