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). red. / Nicolas Ollinger; Heribert Vollmer. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. s. 1-13 27 (Leibniz International Proceedings in Informatics, Bind 47).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Chechik, S, Kaplan, H
, Thorup, M, Zamir, O & Zwick, U 2016,
Bottleneck paths and trees and deterministic graphical games. i N Ollinger & H Vollmer (red),
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)., 27, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, bind 47, s. 1-13, Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orléans, Frankrig,
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. I N. Ollinger, & H. Vollmer (red.),
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) (s. 1-13). [27] Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. Leibniz International Proceedings in Informatics Bind 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. I Ollinger N, Vollmer H, red., 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. 2016. s. 1-13. 27. (Leibniz International Proceedings in Informatics, Bind 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). red. / Nicolas Ollinger ; Heribert Vollmer. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. s. 1-13 (Leibniz International Proceedings in Informatics, Bind 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 -
