BibTeX record conf/pkdd/HorvathOR13

download as .bib file

@inproceedings{DBLP:conf/pkdd/HorvathOR13,
  author    = {Tam{\'{a}}s Horv{\'{a}}th and
               Keisuke Otaki and
               Jan Ramon},
  title     = {Efficient Frequent Connected Induced Subgraph Mining in Graphs of
               Bounded Tree-Width},
  booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference,
               {ECML} {PKDD} 2013, Prague, Czech Republic, September 23-27, 2013,
               Proceedings, Part {I}},
  pages     = {622--637},
  year      = {2013},
  crossref  = {DBLP:conf/pkdd/2013-1},
  url       = {https://doi.org/10.1007/978-3-642-40988-2\_40},
  doi       = {10.1007/978-3-642-40988-2\_40},
  timestamp = {Tue, 14 May 2019 10:00:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pkdd/HorvathOR13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/pkdd/2013-1,
  editor    = {Hendrik Blockeel and
               Kristian Kersting and
               Siegfried Nijssen and
               Filip Zelezn{\'{y}}},
  title     = {Machine Learning and Knowledge Discovery in Databases - European Conference,
               {ECML} {PKDD} 2013, Prague, Czech Republic, September 23-27, 2013,
               Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8188},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40988-2},
  doi       = {10.1007/978-3-642-40988-2},
  isbn      = {978-3-642-40987-5},
  timestamp = {Tue, 14 May 2019 10:00:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pkdd/2013-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics