Falko Hegerfeld, Stefan Kratsch. Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. In Daniël Paulusma, Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers. Volume 14093 of Lecture Notes in Computer Science, pages 388-402, Springer, 2023. [doi]
@inproceedings{HegerfeldK23-0, title = {Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth}, author = {Falko Hegerfeld and Stefan Kratsch}, year = {2023}, doi = {10.1007/978-3-031-43380-1_28}, url = {https://doi.org/10.1007/978-3-031-43380-1_28}, researchr = {https://researchr.org/publication/HegerfeldK23-0}, cites = {0}, citedby = {0}, pages = {388-402}, booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers}, editor = {Daniël Paulusma and Bernard Ries}, volume = {14093}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-031-43380-1}, }