{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:06Z","timestamp":1770972426624,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031433795","type":"print"},{"value":"9783031433801","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43380-1_17","type":"book-chapter","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:12Z","timestamp":1695414552000},"page":"232-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms and\u00a0Hardness for\u00a0Metric Dimension on\u00a0Digraphs"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Dailly","sequence":"first","affiliation":[]},{"given":"Florent","family":"Foucaud","sequence":"additional","affiliation":[]},{"given":"Anni","family":"Hakanen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Araujo, J., et al.: On finding the best and worst orientations for the metric dimension. Algorithmica 1\u201341 (2023)","DOI":"10.1007\/s00453-023-01132-0"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/16M1057383","volume":"31","author":"R Belmonte","year":"2017","unstructured":"Belmonte, R., Fomin, F.V., Golovach, P.A., Ramanujan, M.S.: Metric dimension of bounded tree-length graphs. SIAM J. Discret. Math. 31(2), 1217\u20131243 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR3","volume-title":"Theory and Applications of Distance Geometry","author":"LM Blumenthal","year":"1953","unstructured":"Blumenthal, L.M.: Theory and Applications of Distance Geometry. Oxford University Press, Oxford (1953)"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"G Chartrand","year":"2000","unstructured":"Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 105(1), 99\u2013113 (2000)","journal-title":"Discret. Appl. Math."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.21136\/MB.2000.125961","volume":"125","author":"G Chartrand","year":"2000","unstructured":"Chartrand, G., Raines, M., Zhang, P.: The directed distance dimension of oriented graphs. Math. Bohem. 125, 155\u2013168 (2000)","journal-title":"Math. Bohem."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Dailly, A., Foucaud, F., Hakanen, A.: Algorithms and hardness for metric dimension on digraphs. arXiv preprint arXiv:2307.09389 (2023)","DOI":"10.1007\/978-3-031-43380-1_17"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jcss.2016.06.006","volume":"83","author":"J D\u00edaz","year":"2017","unstructured":"D\u00edaz, J., Pottonen, O., Serna, M.J., van Leeuwen, E.J.: Complexity of metric dimension on planar graphs. J. Comput. Syst. Sci. 83(1), 132\u2013158 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.7155\/jgaa.00360","volume":"19","author":"D Eppstein","year":"2015","unstructured":"Eppstein, D.: Metric dimension parameterized by max leaf number. J. Graph Algorithms Appl. 19(1), 313\u2013323 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"17_CR9","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)","journal-title":"Algorithmica"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Fernau, H., Heggernes, P., van\u2019t Hof, P., Meister, D., Saei, R.: Computing the metric dimension for chain graphs. Inf. Process. Lett. 115(9), 671\u2013676 (2015)","DOI":"10.1016\/j.ipl.2015.04.006"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s00453-016-0184-1","volume":"78","author":"F Foucaud","year":"2017","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. Algorithmica 78(3), 914\u2013944 (2017)","journal-title":"Algorithmica"},{"key":"17_CR12","unstructured":"Galby, E., Khazaliya, L., Inerney, F.M., Sharma, R., Tale, P.: Metric dimension parameterized by feedback vertex set and other structural parameters. In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, 22\u201326 August 2022, Vienna, Austria. LIPIcs, vol. 241, pp. 51:1\u201351:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2022.03.021","volume":"918","author":"T Gima","year":"2022","unstructured":"Gima, T., Hanaka, T., Kiyomi, M., Kobayashi, Y., Otachi, Y.: Exploring the gap between treedepth and vertex cover through vertex integrity. Theoret. Comput. Sci. 918, 60\u201376 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR14","first-page":"191","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combin. 2, 191\u2013195 (1976)","journal-title":"Ars Combin."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Hartung, S., Nichterlein, A.: On the parameterized and approximation hardness of metric dimension. In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5\u20137 June 2013, pp. 266\u2013276. IEEE Computer Society (2013)","DOI":"10.1109\/CCC.2013.36"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2016.03.024","volume":"630","author":"S Hoffmann","year":"2016","unstructured":"Hoffmann, S., Elterman, A., Wanke, E.: A linear time algorithm for metric dimension of cactus block graphs. Theoret. Comput. Sci. 630, 43\u201362 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-36092-3_10","volume-title":"Algorithms for Sensor Systems","author":"S Hoffmann","year":"2013","unstructured":"Hoffmann, S., Wanke, E.: Metric Dimension for gabriel unit disk graphs Is NP-complete. In: Bar-Noy, A., Halld\u00f3rsson, M.M. (eds.) ALGOSENSORS 2012. LNCS, vol. 7718, pp. 90\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36092-3_10"},{"issue":"3","key":"17_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discret. Appl. Math. 70(3), 217\u2013229 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"17_CR19","doi-asserted-by":"publisher","first-page":"3110","DOI":"10.1007\/s00453-022-01005-y","volume":"84","author":"S Li","year":"2022","unstructured":"Li, S., Pilipczuk, M.: Hardness of metric dimension in graphs of constant treewidth. Algorithmica 84(11), 3110\u20133155 (2022)","journal-title":"Algorithmica"},{"key":"17_CR20","unstructured":"Lobstein, A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs: a bibliography (2022). https:\/\/www.lri.fr\/~lobstein\/debutBIBidetlocdom.pdf"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.dam.2004.02.017","volume":"145","author":"RM McConnell","year":"2005","unstructured":"McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. Discret. Appl. Math. 145(2), 198\u2013209 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0734-189X(84)90051-3","volume":"25","author":"RA Melter","year":"1984","unstructured":"Melter, R.A., Tomescu, I.: Metric bases in digital geometry. Comput. Vision Graph. Image Process. 25(1), 113\u2013121 (1984)","journal-title":"Comput. Vision Graph. Image Process."},{"issue":"1","key":"17_CR23","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2000.2026","volume":"82","author":"B Mohar","year":"2001","unstructured":"Mohar, B.: Face covers and the genus problem for apex graphs. J. Combin. Theory Ser. B 82(1), 102\u2013117 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tcs.2021.11.015","volume":"900","author":"M Moscarini","year":"2022","unstructured":"Moscarini, M.: Computing a metric basis of a bipartite distance-hereditary graph. Theoret. Comput. Sci. 900, 20\u201324 (2022)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"17_CR25","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.dam.2006.06.009","volume":"155","author":"OR Oellermann","year":"2007","unstructured":"Oellermann, O.R., Peters-Fransen, J.: The strong metric dimension of graphs and digraphs. Discret. Appl. Math. 155(3), 356\u2013364 (2007)","journal-title":"Discret. Appl. Math."},{"key":"17_CR26","first-page":"17","volume":"40","author":"C Poisson","year":"2002","unstructured":"Poisson, C., Zhang, P.: The metric dimension of unicyclic graphs. J. Combin. Math. Combin. Comput. 40, 17\u201332 (2002)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"7","key":"17_CR27","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1080\/00207160.2013.844335","volume":"91","author":"B Rajan","year":"2014","unstructured":"Rajan, B., Rajasingh, I., Cynthia, J.A., Manuel, P.: Metric dimension of directed graphs. Int. J. Comput. Math. 91(7), 1397\u20131406 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"17_CR28","first-page":"125908","volume":"396","author":"J Sedlar","year":"2021","unstructured":"Sedlar, J., \u0160krekovski, R.: Bounds on metric dimensions of graphs with edge disjoint cycles. Appl. Math. Comput. 396, 125908 (2021)","journal-title":"Appl. Math. Comput."},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2022.02.022","volume":"314","author":"J Sedlar","year":"2022","unstructured":"Sedlar, J., \u0160krekovski, R.: Vertex and edge metric dimensions of unicyclic graphs. Discret. Appl. Math. 314, 81\u201392 (2022)","journal-title":"Discret. Appl. Math."},{"key":"17_CR30","first-page":"549","volume":"14","author":"PJ Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congressius Numer. 14, 549\u2013559 (1975)","journal-title":"Congressius Numer."},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-39219-2_33","volume-title":"Algorithms and Discrete Applied Mathematics","author":"R Steiner","year":"2020","unstructured":"Steiner, R., Wiederrecht, S.: Parameterized algorithms for directed modular width. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 415\u2013426. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_33"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43380-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T11:57:46Z","timestamp":1703246266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43380-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433795","9783031433801"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43380-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fribourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.unifr.ch\/wg2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}