by Chen, J.; Czerwiński, W.;
Disser, Y.; Feldmann, A.E.; Hermelin, D.; Nadara, W.; Pilipczuk, M.; Pilipczuk, M.; Sorge, M.; Wróblewski, B. and Zych-Pawlewicz, A.
Reference:
Chen, J.; Czerwiński, W.; Disser, Y.; Feldmann, A.E.; Hermelin, D.; Nadara, W.; Pilipczuk, M.; Pilipczuk, M.; Sorge, M.; Wróblewski, B. and Zych-Pawlewicz, A.: "Efficient Fully Dynamic Elimination Forests with Applications to Detecting Long Paths and Cycles", In: Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 796–809, 2021.
Bibtex Entry:
@inproceedings{ChenCzerwinskiDisserEtal/20,
author = {Chen, J. and Czerwiński, W. and Disser, Y. and Feldmann, A.E. and Hermelin, D. and Nadara, W. and Pilipczuk, M. and Pilipczuk, M. and Sorge, M. and Wróblewski, B. and Zych-Pawlewicz, A.},
title = {Efficient Fully Dynamic Elimination Forests with
Applications to Detecting Long Paths and Cycles},
booktitle = {Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
tier = {1},
pages = {796--809},
year = {2021}}
