Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - CPAPER
ID - DBLP:conf/iccS/BlinFRV05
AU - Blin, Guillaume
AU - Fertin, Guillaume
AU - Rizzi, Romeo
AU - Vialette, Stéphane
TI - What Makes the Arc-Preserving Subsequence Problem Hard?
BT - Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part II
SP - 860
EP - 868
PY - 2005//
DO - 10.1007/11428848_110
UR - https://doi.org/10.1007/11428848_110
ER -
