Ofer Neiman, Shay Solomon. Simple deterministic algorithms for fully dynamic maximal matching. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 745-754, ACM, 2013. [doi]
@inproceedings{NeimanS13,
title = {Simple deterministic algorithms for fully dynamic maximal matching},
author = {Ofer Neiman and Shay Solomon},
year = {2013},
doi = {10.1145/2488608.2488703},
url = {http://doi.acm.org/10.1145/2488608.2488703},
researchr = {https://researchr.org/publication/NeimanS13},
cites = {0},
citedby = {0},
pages = {745-754},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
publisher = {ACM},
isbn = {978-1-4503-2029-0},
}