{"arxiv":1,"_id":"18261","day":"13","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.01434"}],"publication_status":"published","doi":"10.1145/3308560.3316589","author":[{"full_name":"Tsitsulin, Anton","last_name":"Tsitsulin","first_name":"Anton"},{"full_name":"Mottin, Davide","last_name":"Mottin","first_name":"Davide"},{"first_name":"Panagiotis","last_name":"Karras","full_name":"Karras, Panagiotis"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"first_name":"Emmanuel","last_name":"Müller","full_name":"Müller, Emmanuel"}],"article_processing_charge":"No","date_created":"2024-10-08T13:08:59Z","page":"308 - 309","year":"2019","status":"public","month":"05","extern":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"ACM","conference":{"start_date":"2019-05-13","location":"San Francisco, CA, United States","end_date":"2019-05-17","name":"WWW: The Web Conference"},"external_id":{"arxiv":["2211.01434"]},"date_published":"2019-05-13T00:00:00Z","publication_identifier":{"isbn":["9781450366755"]},"OA_type":"green","oa_version":"Preprint","OA_place":"repository","scopus_import":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A. M., &#38; Müller, E. (2019). Spectral graph complexity. In <i>Companion Proceedings of The 2019 World Wide Web Conference</i> (pp. 308–309). San Francisco, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3308560.3316589\">https://doi.org/10.1145/3308560.3316589</a>","ieee":"A. Tsitsulin, D. Mottin, P. Karras, A. M. Bronstein, and E. Müller, “Spectral graph complexity,” in <i>Companion Proceedings of The 2019 World Wide Web Conference</i>, San Francisco, CA, United States, 2019, pp. 308–309.","short":"A. Tsitsulin, D. Mottin, P. Karras, A.M. Bronstein, E. Müller, in:, Companion Proceedings of The 2019 World Wide Web Conference, ACM, 2019, pp. 308–309.","ama":"Tsitsulin A, Mottin D, Karras P, Bronstein AM, Müller E. Spectral graph complexity. In: <i>Companion Proceedings of The 2019 World Wide Web Conference</i>. ACM; 2019:308-309. doi:<a href=\"https://doi.org/10.1145/3308560.3316589\">10.1145/3308560.3316589</a>","ista":"Tsitsulin A, Mottin D, Karras P, Bronstein AM, Müller E. 2019. Spectral graph complexity. Companion Proceedings of The 2019 World Wide Web Conference. WWW: The Web Conference, 308–309.","mla":"Tsitsulin, Anton, et al. “Spectral Graph Complexity.” <i>Companion Proceedings of The 2019 World Wide Web Conference</i>, ACM, 2019, pp. 308–09, doi:<a href=\"https://doi.org/10.1145/3308560.3316589\">10.1145/3308560.3316589</a>.","chicago":"Tsitsulin, Anton, Davide Mottin, Panagiotis Karras, Alex M. Bronstein, and Emmanuel Müller. “Spectral Graph Complexity.” In <i>Companion Proceedings of The 2019 World Wide Web Conference</i>, 308–9. ACM, 2019. <a href=\"https://doi.org/10.1145/3308560.3316589\">https://doi.org/10.1145/3308560.3316589</a>."},"title":"Spectral graph complexity","publication":"Companion Proceedings of The 2019 World Wide Web Conference","date_updated":"2025-02-04T14:57:55Z"}