@InProceedings{anand_et_al:LIPIcs.FSTTCS.2012.257,
author = {Anand, Abhash and Baswana, Surender and Gupta, Manoj and Sen, Sandeep},
title = {{Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)},
pages = {257--266},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-47-7},
ISSN = {1868-8969},
year = {2012},
volume = {18},
editor = {D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.257},
URN = {urn:nbn:de:0030-drops-38648},
doi = {10.4230/LIPIcs.FSTTCS.2012.257},
annote = {Keywords: Matching, Dynamic Algorithm, Graph Algorithm}
}