Hermish Mehta, Daniel Reichman 0001. Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks. In Amit Chakrabarti, Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Volume 245 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{MehtaR22-1,
title = {Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks},
author = {Hermish Mehta and Daniel Reichman 0001},
year = {2022},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.7},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.7},
researchr = {https://researchr.org/publication/MehtaR22-1},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)},
editor = {Amit Chakrabarti and Chaitanya Swamy},
volume = {245},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-249-5},
}