Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma. Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theoretical Computer Science, 705:75-83, 2018. [doi]
@article{ChiarelliHJMP18,
title = {Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity},
author = {Nina Chiarelli and Tatiana Romina Hartinger and Matthew Johnson 0002 and Martin Milanic and Daniël Paulusma},
year = {2018},
doi = {10.1016/j.tcs.2017.09.033},
url = {https://doi.org/10.1016/j.tcs.2017.09.033},
researchr = {https://researchr.org/publication/ChiarelliHJMP18},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {705},
pages = {75-83},
}