@InProceedings{hespe_et_al:LIPIcs.SEA.2021.17,
author = {Hespe, Demian and Lamm, Sebastian and Schorr, Christian},
title = {{Targeted Branching for the Maximum Independent Set Problem}},
booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)},
pages = {17:1--17:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-185-6},
ISSN = {1868-8969},
year = {2021},
volume = {190},
editor = {Coudert, David and Natale, Emanuele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2021.17},
URN = {urn:nbn:de:0030-drops-137893},
doi = {10.4230/LIPIcs.SEA.2021.17},
annote = {Keywords: Graphs, Combinatorial Optimization, Independent Set, Vertex Cover, Clique, Branch-and-Reduce, Branch-and-Bound, Data Reduction}
}