%0 Conference Paper %1 conf/ats/SauerJCPB11 %A Sauer, Matthias %A Jiang, Jie %A Czutro, Alejandro %A Polian, Ilia %A Becker, Bernd %B Asian Test Symposium %D 2011 %I IEEE Computer Society %K dblp %P 108-113 %T Efficient SAT-Based Search for Longest Sensitisable Paths. %U http://dblp.uni-trier.de/db/conf/ats/ats2011.html#SauerJCPB11 %@ 978-1-4577-1984-4

@inproceedings{conf/ats/SauerJCPB11, added-at = {2016-01-13T00:00:00.000+0100}, author = {Sauer, Matthias and Jiang, Jie and Czutro, Alejandro and Polian, Ilia and Becker, Bernd}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/26ddf3434e2e047c73ca515b4f1c55256/dblp}, booktitle = {Asian Test Symposium}, crossref = {conf/ats/2011}, ee = {http://doi.ieeecomputersociety.org/10.1109/ATS.2011.43}, interhash = {16b656c43d3a239f68d641236c1515b3}, intrahash = {6ddf3434e2e047c73ca515b4f1c55256}, isbn = {978-1-4577-1984-4}, keywords = {dblp}, pages = {108-113}, publisher = {IEEE Computer Society}, timestamp = {2016-02-02T14:23:14.000+0100}, title = {Efficient SAT-Based Search for Longest Sensitisable Paths.}, url = {http://dblp.uni-trier.de/db/conf/ats/ats2011.html#SauerJCPB11}, year = 2011 }