Marc Hellmuth, Guillaume E. Scholz. Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. In Weili Wu 0001, Guangmo Tong, editors, Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I. Volume 14422 of Lecture Notes in Computer Science, pages 115-126, Springer, 2023. [doi]
@inproceedings{HellmuthS23,
title = {Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs},
author = {Marc Hellmuth and Guillaume E. Scholz},
year = {2023},
doi = {10.1007/978-3-031-49190-0_8},
url = {https://doi.org/10.1007/978-3-031-49190-0_8},
researchr = {https://researchr.org/publication/HellmuthS23},
cites = {0},
citedby = {0},
pages = {115-126},
booktitle = {Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I},
editor = {Weili Wu 0001 and Guangmo Tong},
volume = {14422},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-031-49190-0},
}