@InProceedings{quesada_et_al:LIPIcs.CP.2021.46,
author = {Quesada, Luis and Brown, Kenneth N.},
title = {{Positive and Negative Length-Bound Reachability Constraints}},
booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
pages = {46:1--46:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-211-2},
ISSN = {1868-8969},
year = {2021},
volume = {210},
editor = {Michel, Laurent D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.46},
URN = {urn:nbn:de:0030-drops-153372},
doi = {10.4230/LIPIcs.CP.2021.46},
annote = {Keywords: Reachability Constraints, Graph Connectivity, Constraint Programming}
}