{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:04:28Z","timestamp":1742969068298,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_9","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"99-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Your Rugby Mates Don\u2019t Need to Know Your Colleagues: Triadic Closure with Edge Colors"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niels","family":"Gr\u00fcttemeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"40\u201342","key":"9_CR1","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"9_CR3","unstructured":"Diehl, C.P., Namata, G., Getoor, L.: Relationship identification for social network discovery. In: Proceedings of the 22nd AAAI, pp. 546\u2013552. AAAI Press (2007)"},{"issue":"1\u20132","key":"9_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Hung. 18(1\u20132), 25\u201366 (1967)","journal-title":"Acta Math. Hung."},{"key":"9_CR5","unstructured":"Golovach, P.A., Heggernes, P., Konstantinidis, A.L., Lima, P.T., Papadopoulos, C.: Parameterized aspects of strong subgraph closure. In: Proceedings of the 16th SWAT. LIPIcs, vol. 101, pp. 23:1\u201323:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"M Granovetter","year":"1973","unstructured":"Granovetter, M.: The strength of weak ties. Am. J. Sociol. 78, 1360\u20131380 (1973)","journal-title":"Am. J. Sociol."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-00256-5_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N Gr\u00fcttemeier","year":"2018","unstructured":"Gr\u00fcttemeier, N., Komusiewicz, C.: On the relation of strong triadic closure and cluster deletion. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) WG 2018. LNCS, vol. 11159, pp. 239\u2013251. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_20. https:\/\/arxiv.org\/abs\/1803.00807"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-54945-5_49","volume-title":"ISA\u201991 Algorithms","author":"WL Hsu","year":"1991","unstructured":"Hsu, W.L., Ma, T.H.: Substitution decomposition on chordal graphs and applications. In: Hsu, W.L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 52\u201360. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54945-5_49"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00493-010-2483-5","volume":"30","author":"HA Kierstead","year":"2010","unstructured":"Kierstead, H.A., Kostochka, A.V., Mydlarz, M., Szemer\u00e9di, E.: A fast algorithm for equitable coloring. Combinatorica 30(2), 217\u2013224 (2010)","journal-title":"Combinatorica"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2018.05.012","volume":"740","author":"AL Konstantinidis","year":"2018","unstructured":"Konstantinidis, A.L., Nikolopoulos, S.D., Papadopoulos, C.: Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. 740, 76\u201384 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1137\/16M1102690","volume":"32","author":"L Kowalik","year":"2018","unstructured":"Kowalik, L., Lauri, J., Socala, A.: On the fine-grained complexity of rainbow coloring. SIAM J. Discrete Math. 32, 1672\u20131705 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"9_CR13","unstructured":"Kowalik, L., Socala, A.: Tight lower bounds for list edge coloring. In: Proceedings of the 16th SWAT. LIPIcs, vol. 101, pp. 28:1\u201328:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00224-007-9032-7","volume":"44","author":"F Protti","year":"2009","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized cluster editing problems. Theory Comput. Syst. 44(1), 91\u2013104 (2009)","journal-title":"Theory Comput. Syst."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Tatti, N., Gionis, A.: Inferring the strength of social ties: a community-driven approach. In: Proceedings of the 23rd KDD, pp. 1017\u20131025. ACM (2017)","DOI":"10.1145\/3097983.3098199"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Sintos, S., Tsaparas, P.: Using strong triadic closure to characterize ties in social networks. In: Proceedings of the 20th KDD, pp. 1466\u20131475. ACM (2014)","DOI":"10.1145\/2623330.2623664"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Tang, J., Lou, T., Kleinberg, J.M.: Inferring social ties across heterogenous networks. In: Proceedings of the 5th WSDM, pp. 743\u2013752. ACM (2012)","DOI":"10.1145\/2124295.2124382"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:27:31Z","timestamp":1710347251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}