{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:21:57Z","timestamp":1761675717656,"version":"3.28.0"},"reference-count":6,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/mascot.2009.5366808","type":"proceedings-article","created":{"date-parts":[[2010,1,7]],"date-time":"2010-01-07T16:43:14Z","timestamp":1262882594000},"page":"1-3","source":"Crossref","is-referenced-by-count":11,"title":["Finding a simple path with multiple must-include nodes"],"prefix":"10.1109","author":[{"given":"H.","family":"Vardhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Billenahalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Wanjun Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Razo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Sivasankaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Limin Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Monti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Tacca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Fumagalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"3"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.17487\/rfc2702"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.17487\/rfc3209"},{"year":"2001","author":"cormen","journal-title":"Introduction to Algorithms","key":"6"},{"key":"5","first-page":"121","volume":"4 or","author":"de queirs","year":"2003","journal-title":"A new implementation of yen's ranking loopless paths algorithm"},{"year":"1972","author":"edmonds","journal-title":"Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems","key":"4"}],"event":{"name":"amp; Simulation of Computer and Telecommunication Systems (MASCOTS)","start":{"date-parts":[[2009,9,21]]},"location":"London","end":{"date-parts":[[2009,9,23]]}},"container-title":["2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5353818\/5362673\/05366808.pdf?arnumber=5366808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T22:04:00Z","timestamp":1489874640000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5366808\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1109\/mascot.2009.5366808","relation":{},"subject":[],"published":{"date-parts":[[2009,9]]}}}