Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Dynamic Matching in O(1) Update Time.”https://doi.org/10.1007/s00453-019-00630-4__Algorithmica. Springer Nature, 2020.https://doi.org/10.1007/s00453-019-00630-4 .
LibreCat: https://research-explorer.ista.ac.at/record/11675
DOI: 10.1007/s00453-019-00630-4

Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother. “Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow.”https://doi.org/10.15479/AT:ISTA:82__Institute of Science and Technology Austria, 2018.https://doi.org/10.15479/AT:ISTA:82 .
LibreCat: https://research-explorer.ista.ac.at/record/5573
DOI: 10.15479/AT:ISTA:82

Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph Matching Problems for Annotating C. Elegans.”https://doi.org/10.15479/AT:ISTA:57__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:57 .
LibreCat: https://research-explorer.ista.ac.at/record/5561
DOI: 10.15479/AT:ISTA:57

Alberts, D., and Monika H Henzinger. “Average-Case Analysis of Dynamic Graph Algorithms.”https://doi.org/10.1007/pl00009186__Algorithmica. Springer Nature, 1998.https://doi.org/10.1007/pl00009186 .
LibreCat: https://research-explorer.ista.ac.at/record/11680
DOI: 10.1007/pl00009186