BibTeX record conf/pkdd/HorvathR08

download as .bib file

@inproceedings{DBLP:conf/pkdd/HorvathR08,
  author    = {Tam{\'{a}}s Horv{\'{a}}th and
               Jan Ramon},
  title     = {Efficient Frequent Connected Subgraph Mining in Graphs of Bounded
               Treewidth},
  booktitle = {Machine Learning and Knowledge Discovery in Databases, European Conference,
               {ECML/PKDD} 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings,
               Part {I}},
  pages     = {520--535},
  year      = {2008},
  crossref  = {DBLP:conf/pkdd/2008-1},
  url       = {https://doi.org/10.1007/978-3-540-87479-9\_52},
  doi       = {10.1007/978-3-540-87479-9\_52},
  timestamp = {Tue, 14 May 2019 10:00:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pkdd/HorvathR08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/pkdd/2008-1,
  editor    = {Walter Daelemans and
               Bart Goethals and
               Katharina Morik},
  title     = {Machine Learning and Knowledge Discovery in Databases, European Conference,
               {ECML/PKDD} 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings,
               Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {5211},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-87479-9},
  doi       = {10.1007/978-3-540-87479-9},
  isbn      = {978-3-540-87478-2},
  timestamp = {Tue, 14 May 2019 10:00:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pkdd/2008-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics