{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:07Z","timestamp":1780783147551,"version":"3.54.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_23","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:26Z","timestamp":1780780466000},"page":"327-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solid-Resolving Sets on\u00a0Directed Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7473-2456","authenticated-orcid":false,"given":"Anni","family":"Hakanen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2601-4357","authenticated-orcid":false,"given":"P. D.","family":"Pavan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"10","key":"23_CR1","doi-asserted-by":"publisher","first-page":"2962","DOI":"10.1007\/S00453-023-01132-0","volume":"85","author":"J Ara\u00fajo","year":"2023","unstructured":"Ara\u00fajo, J., et al.: On finding the best and worst orientations for the metric dimension. Algorithmica 85(10), 2962\u20133002 (2023). https:\/\/doi.org\/10.1007\/S00453-023-01132-0","journal-title":"Algorithmica"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.dam.2020.09.013","volume":"323","author":"J Bensmail","year":"2022","unstructured":"Bensmail, J., Inerney, F.M., Nisse, N.: Metric dimension: from graphs to oriented graphs. Discret. Appl. Math. 323, 28\u201342 (2022). https:\/\/doi.org\/10.1016\/j.dam.2020.09.013","journal-title":"Discret. Appl. Math."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s40819-019-0604-4","volume":"5","author":"M Changat","year":"2019","unstructured":"Changat, M., Narasimha-Shenoi, P.G., Thottungal Joseph, M.S., Kumar, R.: Boundary vertices of cartesian product of directed graphs. Int. J. Appl. Comput. Math. 5, 19 (2019). https:\/\/doi.org\/10.1007\/s40819-019-0604-4","journal-title":"Int. J. Appl. Comput. Math."},{"issue":"1\u20133","key":"23_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0012-365X(02)00567-8","volume":"263","author":"G Chartrand","year":"2003","unstructured":"Chartrand, G., Erwin, D., Johns, G.L., Zhang, P.: Boundary vertices in graphs. Discret. Math. 263(1\u20133), 25\u201334 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(02)00567-8","journal-title":"Discret. Math."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chartrand, G., Raines, M., Zhang, P.: The directed distance dimension of oriented graphs. Mathematica Bohemica 125(2), 155\u2013168 (2000). http:\/\/eudml.org\/doc\/248478","DOI":"10.21136\/MB.2000.125961"},{"issue":"4","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1007\/s00453-014-9896-2","volume":"72","author":"L Epstein","year":"2015","unstructured":"Epstein, L., Levin, A., Woeginger, G.J.: The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72(4), 1130\u20131171 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9896-2","journal-title":"Algorithmica"},{"issue":"6","key":"23_CR7","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.dam.2012.10.018","volume":"161","author":"M Feng","year":"2013","unstructured":"Feng, M., Xu, M., Wang, K.: On the metric dimension of line graphs. Discret. Appl. Math. 161(6), 802\u2013805 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.10.018","journal-title":"Discret. Appl. Math."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.tcs.2019.02.013","volume":"806","author":"A Hakanen","year":"2020","unstructured":"Hakanen, A., Junnila, V., Laihonen, T.: The solid-metric dimension. Theoret. Comput. Sci. 806, 156\u2013170 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.013","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR9","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"issue":"22","key":"23_CR10","doi-asserted-by":"publisher","first-page":"3349","DOI":"10.1016\/j.disc.2012.07.025","volume":"312","author":"M Jannesari","year":"2012","unstructured":"Jannesari, M., Omoomi, B.: The metric dimension of the lexicographic product of graphs. Discret. Math. 312(22), 3349\u20133356 (2012). https:\/\/doi.org\/10.1016\/j.disc.2012.07.025","journal-title":"Discret. Math."},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Kelenc, A., Tratnik, N., Yero, I.G.: Uniquely identifying the edges of a graph: the edge metric dimension. Discrete Appl. Math. 251, 204\u2013220 (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.05.052","DOI":"10.1016\/j.dam.2018.05.052"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Kuziak, D., Yero, I.G.: Metric dimension related parameters in graphs: a survey on combinatorial, computational and applied results. ArXiV preprint abs\/2107.04877 (2021). https:\/\/doi.org\/10.48550\/arXiv.2107.04877","DOI":"10.48550\/arXiv.2107.04877"},{"key":"23_CR13","unstructured":"Pancahayani, S., Simanjuntak, R.: Directed metric dimension of oriented graphs with cyclic covering. J. Comb. Math. Comb. Comput. 94 (2014)"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Rajan, B., Rajasingh, I., Cynthia, J., Manuel, P.: Metric dimension of directed graphs. Int. J. Comput. Math. 91, 1397\u20131406 (2014). https:\/\/doi.org\/10.1080\/00207160.2013.844335","DOI":"10.1080\/00207160.2013.844335"},{"key":"23_CR15","first-page":"3","volume":"169","author":"V Saenpholphat","year":"2004","unstructured":"Saenpholphat, V., Zhang, P.: Detour resolvability of graphs. Congr. Numer. 169, 3\u201321 (2004)","journal-title":"Congr. Numer."},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Schmitz, Y., Wanke, E.: The directed metric dimension of directed co-graphs. ArXiV preprint abs\/2306.08594 (2023). https:\/\/doi.org\/10.48550\/arXiv.2306.08594","DOI":"10.48550\/arXiv.2306.08594"},{"key":"23_CR17","unstructured":"Slater, P.J.: Leaves of trees. In: Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1975), pp. 549\u2013559. Congressus Numerantium, No. XIV. Utilitas Math., Winnipeg, Man. (1975)"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/21M1409512","volume":"65","author":"RC Tillquist","year":"2023","unstructured":"Tillquist, R.C., Frongillo, R.M., Lladser, M.E.: Getting the lay of the land in discrete space: a survey of metric dimension and its applications. SIAM Rev. 65(4), 919\u2013962 (2023). https:\/\/doi.org\/10.1137\/21M1409512","journal-title":"SIAM Rev."},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7151\/dmgt.2110","volume":"40","author":"T Vetr\u00edk","year":"2020","unstructured":"Vetr\u00edk, T.: On the metric dimension of directed and undirected circulant graphs. Discussiones Mathematicae Graph Theory 40(1), 67\u201376 (2020). https:\/\/doi.org\/10.7151\/dmgt.2110","journal-title":"Discussiones Mathematicae Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:29Z","timestamp":1780780469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}