{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:13:58Z","timestamp":1768518838526,"version":"3.49.0"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"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":[[2025,7,15]]},"DOI":"10.1109\/codit66093.2025.11321231","type":"proceedings-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:36:48Z","timestamp":1768423008000},"page":"811-816","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Topological s\u2013t Cut Problems"],"prefix":"10.1109","author":[{"given":"Javad","family":"Tayyebi","sequence":"first","affiliation":[{"name":"Birjand University of Technology,Faculty of Industrial and Computer Engineering,Department of Industrial Engineering,Birjand,Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian Marius","family":"Deaconu","sequence":"additional","affiliation":[{"name":"Transilvania University of Brasov,Department of Mathematics and Computer Science,Brasov,Romania,500091"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malihe","family":"Niksirat","sequence":"additional","affiliation":[{"name":"Birjand University of Technology,Faculty of Industrial and Computer Engineering,Department of Computer Science,Birjand,Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106708"},{"key":"ref2","volume-title":"Network flows: Theory, applications and algorithms","author":"Ahuja","year":"1993"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01987-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/15M1042929"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/RBME.2018.2798701"},{"issue":"1","key":"ref6","first-page":"51","article-title":"New interior point algorithms in linear programming","volume":"5","author":"Darvay","year":"2003","journal-title":"Advances in Modeling and Optimization"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1515\/9781400881987-013"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6737016"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0214045"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1043"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0208012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/31846.31849"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0406038"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430720306"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539789162997"},{"key":"ref17","article-title":"Minimum s-t cut in undirected planar graphs when the source and the sink are close","volume-title":"28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)","author":"Kaplan"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0212005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.52547\/ijmsi.17.2.253"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1538"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993679"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104543"}],"event":{"name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","location":"Split, Croatia","start":{"date-parts":[[2025,7,15]]},"end":{"date-parts":[[2025,7,18]]}},"container-title":["2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11321217\/11321218\/11321231.pdf?arnumber=11321231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T07:47:11Z","timestamp":1768463231000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11321231\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,15]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/codit66093.2025.11321231","relation":{},"subject":[],"published":{"date-parts":[[2025,7,15]]}}}