BibTeX record conf/isaac/AkutsuT12

download as .bib file

@inproceedings{DBLP:conf/isaac/AkutsuT12,
  author       = {Tatsuya Akutsu and
                  Takeyuki Tamura},
  editor       = {Kun{-}Mao Chao and
                  Tsan{-}sheng Hsu and
                  Der{-}Tsai Lee},
  title        = {On the Complexity of the Maximum Common Subgraph Problem for Partial
                  k-Trees of Bounded Degree},
  booktitle    = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
                  2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7676},
  pages        = {146--155},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-35261-4\_18},
  doi          = {10.1007/978-3-642-35261-4\_18},
  timestamp    = {Fri, 09 Apr 2021 18:46:54 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/AkutsuT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.