Matthias Sauer, Jie Jiang, Alejandro Czutro, Ilia Polian, Bernd Becker. Efficient SAT-Based Search for Longest Sensitisable Paths. In Proceedings of the 20th IEEE Asian Test Symposium, ATS 2011, New Delhi, India, November 20-23, 2011. pages 108-113, IEEE Computer Society, 2011. [doi]
@inproceedings{SauerJCPB11,
title = {Efficient SAT-Based Search for Longest Sensitisable Paths},
author = {Matthias Sauer and Jie Jiang and Alejandro Czutro and Ilia Polian and Bernd Becker},
year = {2011},
doi = {10.1109/ATS.2011.43},
url = {http://doi.ieeecomputersociety.org/10.1109/ATS.2011.43},
researchr = {https://researchr.org/publication/SauerJCPB11},
cites = {0},
citedby = {0},
pages = {108-113},
booktitle = {Proceedings of the 20th IEEE Asian Test Symposium, ATS 2011, New Delhi, India, November 20-23, 2011},
publisher = {IEEE Computer Society},
isbn = {978-1-4577-1984-4},
}