@InProceedings{assadi_et_al:LIPIcs.FSTTCS.2015.52,
author = {Assadi, Sepehr and Khanna, Sanjeev and Li, Yang and Tannen, Val},
title = {{Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches}},
booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
pages = {52--68},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-97-2},
ISSN = {1868-8969},
year = {2015},
volume = {45},
editor = {Harsha, Prahladh and Ramalingam, G.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.52},
URN = {urn:nbn:de:0030-drops-56361},
doi = {10.4230/LIPIcs.FSTTCS.2015.52},
annote = {Keywords: Small-space Algorithms, Maximum Matchings, Vertex Sparsifiers}
}