{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:14:37Z","timestamp":1730297677451,"version":"3.28.0"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T00:00:00Z","timestamp":1638748800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T00:00:00Z","timestamp":1638748800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,6]]},"DOI":"10.1109\/snams53716.2021.9732127","type":"proceedings-article","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T16:03:13Z","timestamp":1647446593000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Vertex Separation in Networks"],"prefix":"10.1109","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[{"name":"University of Campania “L.Vanvitelli”,Department of Psychology,Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[{"name":"University of Salerno,Department of Computer Science,Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[{"name":"University of Salerno,Department of Computer Science,Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1","article-title":"Efficient Link Cuts in Online Social Networks","author":"ruan","year":"0","journal-title":"2015 IEEE Global Communications Conference (GLOBECOM)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.007"},{"journal-title":"Parameterized integer quadratic programming Variables and coefficients","year":"2015","author":"lokshtanov","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_19"},{"key":"ref30","article-title":"Integer Programming in Parameterized Complexity: Three Miniatures","author":"gavenciak","year":"0","journal-title":"Proc of 13th Int Symp on Parameterized and Exact Computation (IPEC'18)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.03.043"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00124-y"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9554-x"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2500119"},{"key":"ref10","article-title":"Speeding up networks mining via neighborhood diversity","volume":"157","author":"cordasco","year":"2021","journal-title":"10th FUN'21 LIPIcs"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0418-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/net.21756"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-48966-3_15"},{"key":"ref13","first-page":"2765","article-title":"Fully polynomial FPT algorithms for some classes of bounded clique-width graphs","author":"coudert","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)81014-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00394-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42634-1_6"},{"key":"ref18","article-title":"Treewidth Computations and Approximations","author":"kloks","year":"1994","journal-title":"LNCS 842"},{"key":"ref19","article-title":"Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity","volume":"15","author":"knop","year":"2019","journal-title":"Logical Methods in Computer Science"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.029"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807370"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03898-8_7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/140988553"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2020.100596"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm086"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00184-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3_8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s002249910009"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.09.007"},{"key":"ref20","first-page":"468","article-title":"Polynomial algorithms for partitioning prob-lems on graphs with fixed clique-width (extended abstract)","author":"kobler","year":"0","journal-title":"Proc of ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45477-2_12"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00198-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_38"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9706-0"},{"journal-title":"Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems","year":"2015","author":"fiala","key":"ref23"},{"journal-title":"Using neighborhood diversity to solve hard problems","year":"2012","author":"ganian","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.42"}],"event":{"name":"2021 Eighth International Conference on Social Network Analysis, Management and Security (SNAMS)","start":{"date-parts":[[2021,12,6]]},"location":"Gandia, Spain","end":{"date-parts":[[2021,12,9]]}},"container-title":["2021 Eighth International Conference on Social Network Analysis, Management and Security (SNAMS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9732060\/9731845\/09732127.pdf?arnumber=9732127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T14:28:32Z","timestamp":1682951312000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9732127\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,6]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/snams53716.2021.9732127","relation":{},"subject":[],"published":{"date-parts":[[2021,12,6]]}}}