@inproceedings{conf/mfcs/AkutsuT12,
  added-at = {2012-08-12T00:00:00.000+0200},
  author = {Akutsu, Tatsuya and Tamura, Takeyuki},
  biburl = {http://www.bibsonomy.org/bibtex/25fad33b34b12acc4693f025530cd3755/dblp},
  booktitle = {MFCS},
  crossref = {conf/mfcs/2012},
  editor = {Rovan, Branislav and Sassone, Vladimiro and Widmayer, Peter},
  ee = {http://dx.doi.org/10.1007/978-3-642-32589-2_10},
  interhash = {fa5dbd9ef95badd66c2819d80d0b4acf},
  intrahash = {5fad33b34b12acc4693f025530cd3755},
  isbn = {978-3-642-32588-5},
  keywords = {dblp},
  pages = {76-87},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2012-08-12T00:00:00.000+0200},
  title = {A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree.},
  url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2012.html#AkutsuT12},
  volume = 7464,
  year = 2012
}