@InProceedings{gawrychowski_et_al:LIPIcs.CPM.2016.25,
author = {Gawrychowski, Pawel and Landau, Gad M. and Mozes, Shay and Weimann, Oren},
title = {{The Nearest Colored Node in a Tree}},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
pages = {25:1--25:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-012-5},
ISSN = {1868-8969},
year = {2016},
volume = {54},
editor = {Grossi, Roberto and Lewenstein, Moshe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.25},
URN = {urn:nbn:de:0030-drops-60674},
doi = {10.4230/LIPIcs.CPM.2016.25},
annote = {Keywords: Marked ancestor, Vertex-label distance oracles, Nearest colored descend- ant, Top-trees}
}