@InProceedings{barnoy_et_al:LIPIcs.ISAAC.2021.27,
author = {Bar-Noy, Amotz and Peleg, David and Rawitz, Dror and Yehezkel, Elad},
title = {{Selected Neighbor Degree Forest Realization}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {27:1--27:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.27},
URN = {urn:nbn:de:0030-drops-154609},
doi = {10.4230/LIPIcs.ISAAC.2021.27},
annote = {Keywords: network realization, graph algorithms, lower bound}
}