{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T08:55:14Z","timestamp":1776329714646,"version":"3.50.1"},"reference-count":6,"publisher":"Baskent University","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Exp Clin Transplant"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.6002\/ect.2021.0186","type":"journal-article","created":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T03:05:46Z","timestamp":1631243146000},"page":"737-741","source":"Crossref","is-referenced-by-count":4,"title":["Diagnosis and Treatment of Latent Tuberculosis Infection in Kidney and Liver Transplant Recipients in Iranian Candidates for Transplant"],"prefix":"10.6002","volume":"20","author":[{"given":"Maryam","family":"Pakfetrat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leila","family":"Malekmakan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anahid","family":"Hamidianjahromi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Moghadami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyyed Abdollah","family":"Khoramroz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"4021","reference":[{"key":"ref0","doi-asserted-by":"publisher","unstructured":"[1] Kaye, R. (2000). Minesweeper is NP-complete. The Mathematical Intelligencer, 22, 9-15. https:\/\/doi.org\/10.1007\/BF03025367","DOI":"10.1007\/BF03025367"},{"key":"ref1","unstructured":"[2] The authoritative minesweeper - Strategy & Cheats. https:\/\/minesweepergame.com\/ (El\u00e9rhet\u0151 volt: 2022.07.29.)"},{"key":"ref2","unstructured":"[3] Becerra, D. J. (2015). Algorithmic Approaches to Playing Minesweeper. Bachelor's thesis, Harvard College."},{"key":"ref3","unstructured":"[4] Pedersen, K. (2004). The complexity of minesweeper and strategies for game playing. Department of Computer Science, University of Warwick, pp. 30-62."},{"key":"ref4","unstructured":"[5] Studholme, C. (2001). Minesweeper as a constraint satisfaction problem. http:\/\/www.cs.toronto.edu\/~cvs\/minesweeper\/minesweeper.pdf (El\u00e9rhet\u0151 volt: 2022.07.27.)"},{"key":"ref5","unstructured":"[6] Hus\u00f3czki, D. (2022). Aknakeres\u0151 j\u00e1t\u00e9k algoritmusok vizsg\u00e1lata. Szakdolgozat, Miskolci Egyetem, G\u00c9IK, Alkalmazott Matematikai Int\u00e9zeti Tansz\u00e9k."}],"container-title":["Experimental and Clinical Transplantation"],"original-title":[],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T04:34:16Z","timestamp":1662006856000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.ectrx.org\/detail\/archive\/2022\/20\/8\/0\/737\/0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":6,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"URL":"https:\/\/doi.org\/10.6002\/ect.2021.0186","relation":{},"ISSN":["1304-0855","2146-8427"],"issn-type":[{"value":"1304-0855","type":"print"},{"value":"2146-8427","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}