{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:41:46Z","timestamp":1771980106400,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea Grant funded by the Korean Government (MSIT)","doi-asserted-by":"publisher","award":["NRF-2017R1A2B4005020"],"award-info":[{"award-number":["NRF-2017R1A2B4005020"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tit.2017.2740283","type":"journal-article","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T14:22:16Z","timestamp":1502806936000},"page":"7178-7205","source":"Crossref","is-referenced-by-count":13,"title":["The \u201cArt of Trellis Decoding\u201d Is Fixed-Parameter Tractable"],"prefix":"10.1109","volume":"63","author":[{"given":"Jisu","family":"Jeong","sequence":"first","affiliation":[]},{"given":"Eun Jung","family":"Kim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6889-7286","authenticated-orcid":false,"given":"Sang-il","family":"Oum","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0164-5"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/050629616"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.03.003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.10.006"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.12.003"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/070687256"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00184-5"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2014.04.010"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.04.003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00175-X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9131-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.12.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch116"},{"key":"ref20","first-page":"224","article-title":"Graph separation and search number","author":"ellis","year":"1983","journal-title":"Proc 21st Annu Allerton Conf Commun Control Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80079-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0049"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/070685920"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28639-4_4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.10.003"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1009"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/3.1.55"},{"key":"ref54","author":"kant\u00e9","year":"2015","journal-title":"An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2528404"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579179"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35261-4_50"},{"key":"ref11","author":"van bevern","year":"2012","journal-title":"How applying Myhill–Nerode methods to hypergraphs helps mastering the art of trellis decoding"},{"key":"ref40","article-title":"An unified FPT algorithm for width of partition functions","author":"berthom\u00e9","year":"2013"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9977-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2082"},{"key":"ref15","author":"geelen","year":"2006","journal-title":"A Correction to Our Paper ‘Branch-Width and Well-Quasi-Ordering in Matroids and Graphs’"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/noti1139"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.08.005"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.10.007"},{"key":"ref19","author":"hlin\u00e8n\u00fd","year":"2016","journal-title":"Simpler self-reduction algorithm for matroid pathwidth"},{"key":"ref4","first-page":"1989","article-title":"Trellis structure of codes","volume":"1","author":"vardy","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref3","first-page":"148","article-title":"Foundation and methods of channel encoding","volume":"65","author":"massey","year":"1978","journal-title":"Proc Internat Conf Inform Theory Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.669287"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.556701"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/070691152"},{"key":"ref49","article-title":"On the structural and algorithmic properties of linear rank-width","author":"kwon","year":"2015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2005.10.005"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702418589"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(82)80039-5"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1435375.1435385"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.06.006"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(02)00046-1"},{"key":"ref41","article-title":"Pursuit-Evasion, decompositions and convexity on graphs","author":"soares","year":"2013"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-23.2.193"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8071168\/08010907.pdf?arnumber=8010907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:40Z","timestamp":1641987580000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8010907\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":54,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2740283","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}