Jan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová. Computational Complexity of Covering Disconnected Multigraphs. In Evripidis Bampis, Aris Pagourtzis, editors, Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings. Volume 12867 of Lecture Notes in Computer Science, pages 85-99, Springer, 2021. [doi]
@inproceedings{BokFJKS21,
title = {Computational Complexity of Covering Disconnected Multigraphs},
author = {Jan Bok and Jirí Fiala 0001 and Nikola Jedlicková and Jan Kratochvíl and Michaela Seifrtová},
year = {2021},
doi = {10.1007/978-3-030-86593-1_6},
url = {https://doi.org/10.1007/978-3-030-86593-1_6},
researchr = {https://researchr.org/publication/BokFJKS21},
cites = {0},
citedby = {0},
pages = {85-99},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings},
editor = {Evripidis Bampis and Aris Pagourtzis},
volume = {12867},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-86593-1},
}