{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:52:28Z","timestamp":1729669948949,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/iscas.2009.5118417","type":"proceedings-article","created":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T10:59:27Z","timestamp":1246445967000},"page":"2934-2937","source":"Crossref","is-referenced-by-count":0,"title":["Minimum augmentation to tri-connect a bi-connected graph with upper bounds on vertex-degree"],"prefix":"10.1109","author":[{"given":"Toshiya","family":"Mashima","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Taoka","sequence":"additional","affiliation":[]},{"given":"Toshimasa","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","author":"tutte","year":"1966","journal-title":"Connectivity in Graphs"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1002"},{"key":"11","first-page":"9","article-title":"a linear time algorithm for triconnectivity augmentation of bi-connected graphs with upper bounds on vertex-degree increase","author":"mashima","year":"2007","journal-title":"IPSJ SIG Technical Report 2007-AL-115(2)"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/0222056"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/0206003"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/0205044"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e89-d.2.751"},{"key":"7","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-45535-3_21","article-title":"independence free graphs and vertex connectivity augmentation","volume":"2081","author":"jackson","year":"2001","journal-title":"ser Lecture Notes in Computer Science"},{"key":"6","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BFb0015432","article-title":"undirected vertex-connectivity structure and smallest fourvertex-connectivity augmentation","volume":"1004","author":"hsu","year":"1995","journal-title":"ser Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185418"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90050-7"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1997.621905"},{"year":"0","key":"8"}],"event":{"name":"2009 IEEE International Symposium on Circuits and Systems - ISCAS 2009","start":{"date-parts":[[2009,5,24]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2009,5,27]]}},"container-title":["2009 IEEE International Symposium on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5076158\/5117665\/05118417.pdf?arnumber=5118417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T00:56:05Z","timestamp":1589936165000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5118417\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iscas.2009.5118417","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}