{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:18Z","timestamp":1759638378163,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_29","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"218-227","source":"Crossref","is-referenced-by-count":5,"title":["On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs"],"prefix":"10.1007","author":[{"given":"B. S.","family":"Panda","sequence":"first","affiliation":[]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"29_CR1","volume-title":"Computers and Interactability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Interactability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, New York (1979)"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00453-001-0004-z","volume":"31","author":"MC Golumbic","year":"2001","unstructured":"Golumbic, M.C., Hirst, T., Lewenstein, M.: Uniquely restricted matchings. Algorithmica 31, 139\u2013154 (2001)","journal-title":"Algorithmica"},{"key":"29_CR3","first-page":"1","volume":"3","author":"ST Hedetniemi","year":"2006","unstructured":"Hedetniemi, S.T.: Unsolved algorithmic problem on trees. AKCE J. Graphs. Combin. 3, 1\u201337 (2006)","journal-title":"AKCE J. Graphs. Combin."},{"issue":"6","key":"29_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0020-0190(98)00173-2","volume":"68","author":"T Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Bandwidth of chain graphs. Inform. Process. Lett. 68(6), 313\u2013315 (1998)","journal-title":"Inform. Process. Lett."},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0166-218X(03)00398-6","volume":"132","author":"VE Levit","year":"2003","unstructured":"Levit, V.E., Mandrescu, E.: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings, Stability in graphs and related topics. Discrete Appl. Math. 132, 163\u2013174 (2003)","journal-title":"Discrete Appl. Math."},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1007\/s00373-012-1230-7","volume":"29","author":"VE Levit","year":"2013","unstructured":"Levit, V.E., Mandrescu, E.: On unicyclic graphs with uniquely restricted maximum matchings. Graphs Comb. 29, 1867\u20131879 (2013)","journal-title":"Graphs Comb."},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"2414","DOI":"10.1016\/j.dam.2007.05.039","volume":"155","author":"VE Levit","year":"2007","unstructured":"Levit, V.E., Mandrescu, E.: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discrete Appl. Math. 155, 2414\u20132425 (2007)","journal-title":"Discrete Appl. Math."},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.endm.2011.05.059","volume":"37","author":"S Mishra","year":"2011","unstructured":"Mishra, S.: On the maximum uniquely restricted matching for bipartite graphs. Electron. Notes Discrete Math. 37, 345\u2013350 (2011)","journal-title":"Electron. Notes Discrete Math."},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-30551-4_74","volume-title":"Algorithms and Computation","author":"R Uehara","year":"2004","unstructured":"Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 871\u2013883. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-30551-4_74"},{"doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Conference Record of the Tenth Annual (ACM) Symposium on Theory of Computing (San Diego, Calif., 1978), pp. 253\u2013264. ACM, New York (1978)","key":"29_CR10","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T22:49:25Z","timestamp":1508885365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}