Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. In David Fernández-Baca, editor, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Volume 7256 of Lecture Notes in Computer Science, pages 195-206, Springer, 2012. [doi]
@inproceedings{CyganPPW12, title = {Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n}, author = {Marek Cygan and Marcin Pilipczuk and Michal Pilipczuk and Jakub Onufry Wojtaszczyk}, year = {2012}, doi = {10.1007/978-3-642-29344-3_17}, url = {http://dx.doi.org/10.1007/978-3-642-29344-3_17}, researchr = {https://researchr.org/publication/CyganPPW12}, cites = {0}, citedby = {0}, pages = {195-206}, booktitle = {LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings}, editor = {David Fernández-Baca}, volume = {7256}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-29343-6}, }