@inproceedings{DBLP:conf/semweb/AsprinoBCHP19a,
  author    = {Luigi Asprino and
               Wouter Beek and
               Paolo Ciancarini and
               Frank van Harmelen and
               Valentina Presutti},
  editor    = {Chiara Ghidini and
               Olaf Hartig and
               Maria Maleshkova and
               Vojtech Sv{\'{a}}tek and
               Isabel F. Cruz and
               Aidan Hogan and
               Jie Song and
               Maxime Lefran{\c{c}}ois and
               Fabien Gandon},
  title     = {Observing {LOD} Using Equivalent Set Graphs: It Is Mostly Flat and
               Sparsely Linked},
  booktitle = {The Semantic Web - {ISWC} 2019 - 18th International Semantic Web Conference,
               Auckland, New Zealand, October 26-30, 2019, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {11778},
  pages     = {57--74},
  publisher = {Springer},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-30793-6\_4},
  doi       = {10.1007/978-3-030-30793-6\_4},
  timestamp = {Fri, 09 Apr 2021 18:46:52 +0200},
  biburl    = {https://dblp.org/rec/conf/semweb/AsprinoBCHP19a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"Dg4Yv5FHQb2JKBZXo","bibbaseid":"asprino-beek-ciancarini-vanharmelen-presutti-observinglodusingequivalentsetgraphsitismostlyflatandsparselylinked-2019","author_short":["Asprino, L.","Beek, W.","Ciancarini, P.","van Harmelen, F.","Presutti, V."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Luigi"],"propositions":[],"lastnames":["Asprino"],"suffixes":[]},{"firstnames":["Wouter"],"propositions":[],"lastnames":["Beek"],"suffixes":[]},{"firstnames":["Paolo"],"propositions":[],"lastnames":["Ciancarini"],"suffixes":[]},{"firstnames":["Frank"],"propositions":["van"],"lastnames":["Harmelen"],"suffixes":[]},{"firstnames":["Valentina"],"propositions":[],"lastnames":["Presutti"],"suffixes":[]}],"editor":[{"firstnames":["Chiara"],"propositions":[],"lastnames":["Ghidini"],"suffixes":[]},{"firstnames":["Olaf"],"propositions":[],"lastnames":["Hartig"],"suffixes":[]},{"firstnames":["Maria"],"propositions":[],"lastnames":["Maleshkova"],"suffixes":[]},{"firstnames":["Vojtech"],"propositions":[],"lastnames":["Svátek"],"suffixes":[]},{"firstnames":["Isabel","F."],"propositions":[],"lastnames":["Cruz"],"suffixes":[]},{"firstnames":["Aidan"],"propositions":[],"lastnames":["Hogan"],"suffixes":[]},{"firstnames":["Jie"],"propositions":[],"lastnames":["Song"],"suffixes":[]},{"firstnames":["Maxime"],"propositions":[],"lastnames":["Lefrançois"],"suffixes":[]},{"firstnames":["Fabien"],"propositions":[],"lastnames":["Gandon"],"suffixes":[]}],"title":"Observing LOD Using Equivalent Set Graphs: It Is Mostly Flat and Sparsely Linked","booktitle":"The Semantic Web - ISWC 2019 - 18th International Semantic Web Conference, Auckland, New Zealand, October 26-30, 2019, Proceedings, Part I","series":"Lecture Notes in Computer Science","volume":"11778","pages":"57–74","publisher":"Springer","year":"2019","url":"https://doi.org/10.1007/978-3-030-30793-6\\_4","doi":"10.1007/978-3-030-30793-6_4","timestamp":"Fri, 09 Apr 2021 18:46:52 +0200","biburl":"https://dblp.org/rec/conf/semweb/AsprinoBCHP19a.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/semweb/AsprinoBCHP19a,\n author = {Luigi Asprino and\n Wouter Beek and\n Paolo Ciancarini and\n Frank van Harmelen and\n Valentina Presutti},\n editor = {Chiara Ghidini and\n Olaf Hartig and\n Maria Maleshkova and\n Vojtech Sv{\\'{a}}tek and\n Isabel F. Cruz and\n Aidan Hogan and\n Jie Song and\n Maxime Lefran{\\c{c}}ois and\n Fabien Gandon},\n title = {Observing {LOD} Using Equivalent Set Graphs: It Is Mostly Flat and\n Sparsely Linked},\n booktitle = {The Semantic Web - {ISWC} 2019 - 18th International Semantic Web Conference,\n Auckland, New Zealand, October 26-30, 2019, Proceedings, Part {I}},\n series = {Lecture Notes in Computer Science},\n volume = {11778},\n pages = {57--74},\n publisher = {Springer},\n year = {2019},\n url = {https://doi.org/10.1007/978-3-030-30793-6\\_4},\n doi = {10.1007/978-3-030-30793-6\\_4},\n timestamp = {Fri, 09 Apr 2021 18:46:52 +0200},\n biburl = {https://dblp.org/rec/conf/semweb/AsprinoBCHP19a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n","author_short":["Asprino, L.","Beek, W.","Ciancarini, P.","van Harmelen, F.","Presutti, V."],"editor_short":["Ghidini, C.","Hartig, O.","Maleshkova, M.","Svátek, V.","Cruz, I. F.","Hogan, A.","Song, J.","Lefrançois, M.","Gandon, F."],"key":"DBLP:conf/semweb/AsprinoBCHP19a","id":"DBLP:conf/semweb/AsprinoBCHP19a","bibbaseid":"asprino-beek-ciancarini-vanharmelen-presutti-observinglodusingequivalentsetgraphsitismostlyflatandsparselylinked-2019","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-030-30793-6\\_4"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/KRRVU/website/master/publications/krr.bib","dataSources":["H6xuGqu5uQ6rXhdJ4","dJmTXpbSWWjnxatYT"],"keywords":[],"search_terms":["observing","lod","using","equivalent","set","graphs","mostly","flat","sparsely","linked","asprino","beek","ciancarini","van harmelen","presutti"],"title":"Observing LOD Using Equivalent Set Graphs: It Is Mostly Flat and Sparsely Linked","year":2019}