Standard
Bottleneck paths and trees and deterministic graphical games. / Chechik, Shiri; Kaplan, Haim; Thorup, Mikkel; Zamir, Or; Zwick, Uri.
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). ed. / Nicolas Ollinger; Heribert Vollmer. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. p. 1-13 27 (Leibniz International Proceedings in Informatics, Vol. 47).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Chechik, S, Kaplan, H
, Thorup, M, Zamir, O & Zwick, U 2016,
Bottleneck paths and trees and deterministic graphical games. in N Ollinger & H Vollmer (eds),
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)., 27, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, vol. 47, pp. 1-13, Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orléans, France,
17/02/2016.
https://doi.org/10.4230/LIPIcs.STACS.2016.27APA
Chechik, S., Kaplan, H.
, Thorup, M., Zamir, O., & Zwick, U. (2016).
Bottleneck paths and trees and deterministic graphical games. In N. Ollinger, & H. Vollmer (Eds.),
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) (pp. 1-13). [27] Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics Vol. 47
https://doi.org/10.4230/LIPIcs.STACS.2016.27Vancouver
Chechik S, Kaplan H
, Thorup M, Zamir O, Zwick U.
Bottleneck paths and trees and deterministic graphical games. In Ollinger N, Vollmer H, editors, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. 2016. p. 1-13. 27. (Leibniz International Proceedings in Informatics, Vol. 47).
https://doi.org/10.4230/LIPIcs.STACS.2016.27Author
Chechik, Shiri ; Kaplan, Haim ; Thorup, Mikkel ; Zamir, Or ; Zwick, Uri. / Bottleneck paths and trees and deterministic graphical games. 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). editor / Nicolas Ollinger ; Heribert Vollmer. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. pp. 1-13 (Leibniz International Proceedings in Informatics, Vol. 47).
Bibtex
@inproceedings{87ffc07eaacb47be951f1ae52c82be60,
title = "Bottleneck paths and trees and deterministic graphical games",
author = "Shiri Chechik and Haim Kaplan and Mikkel Thorup and Or Zamir and Uri Zwick",
year = "2016",
doi = "10.4230/LIPIcs.STACS.2016.27",
language = "English",
isbn = "978-3-95977-001-9",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH",
pages = "1--13",
editor = "Nicolas Ollinger and Heribert Vollmer",
booktitle = "33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)",
note = "null ; Conference date: 17-02-2016 Through 20-02-2016",
url = "http://www.univ-orleans.fr/lifo/events/STACS2016/",
}
RIS
TY - GEN
T1 - Bottleneck paths and trees and deterministic graphical games
AU - Chechik, Shiri
AU - Kaplan, Haim
AU - Thorup, Mikkel
AU - Zamir, Or
AU - Zwick, Uri
N1 - Conference code: 33
PY - 2016
Y1 - 2016
U2 - 10.4230/LIPIcs.STACS.2016.27
DO - 10.4230/LIPIcs.STACS.2016.27
M3 - Article in proceedings
SN - 978-3-95977-001-9
T3 - Leibniz International Proceedings in Informatics
SP - 1
EP - 13
BT - 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
A2 - Ollinger, Nicolas
A2 - Vollmer, Heribert
PB - Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH
Y2 - 17 February 2016 through 20 February 2016
ER -
