{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:44:27Z","timestamp":1787319867432,"version":"build-2736575974"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"name":"DST-INSPIRE","award":["IFA12-ENG-21"],"award-info":[{"award-number":["IFA12-ENG-21"]}]},{"DOI":"10.13039\/100005920","name":"Intercollegiate Studies Institute","doi-asserted-by":"publisher","award":["CSRU2"],"award-info":[{"award-number":["CSRU2"]}],"id":[{"id":"10.13039\/100005920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>A matching $M$ in a graph $G$ is said to be uniquely restricted if there is no other matching in $G$ that matches the same set of vertices as $M$. We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic, Hirst, and Lewenstein [ Algorithmica, 31 (2001), pp. 139--154]. Our algorithm actually solves the more general problem of computing a maximum cardinality \u201cweak independent set\u201d in an interval nest digraph, which may be of independent interest. Further, we give linear-time algorithms for computing maximum cardinality uniquely restricted matchings in proper interval graphs and bipartite permutation graphs.<\/jats:p>","DOI":"10.1137\/16m1074631","type":"journal-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T13:31:12Z","timestamp":1515677472000},"page":"148-172","source":"Crossref","is-referenced-by-count":11,"title":["Uniquely Restricted Matchings in Interval Graphs"],"prefix":"10.1137","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0498-7856","authenticated-orcid":true,"given":"Mathew C.","family":"Francis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dalu","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satyabrata","family":"Jana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,1,11]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.07.001"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100373455"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.2307\/2371374"},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic,\n                      Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol. 57)\n                      , North-Holland Publishing Co., Amsterdam, 2004.","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0004-z"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00241-7"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103430259"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703437855"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2011.05.059"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00027-9"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90104-X"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130206"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(87)80003-3"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1074631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:53:44Z","timestamp":1787316824000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1074631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1074631"],"URL":"https:\/\/doi.org\/10.1137\/16m1074631","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}