{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:54:54Z","timestamp":1742925294823,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_22","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"287-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resolving Sets in\u00a0Temporal Graphs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Bok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Dailly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuomo","family":"Lehtil\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-031-23101-8_19","volume-title":"SOFSEM 2024","author":"E Arrighi","year":"2023","unstructured":"Arrighi, E., Gr\u00fcttemeier, N., Morawietz, N., Sommer, F., Wolf, P.: Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs. In: G\u0105sieniec, L. (ed.) SOFSEM 2023. LNCS, vol. 13878, pp. 283\u2013297. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-23101-8_19"},{"issue":"8","key":"22_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113410","volume":"346","author":"Z Bartha","year":"2023","unstructured":"Bartha, Z., Komj\u00e1thy, J., Raes, J.: Sharp bound on the truncated metric dimension of trees. Discrete Math. 346(8), 113410 (2023)","journal-title":"Discrete Math."},{"key":"22_CR3","unstructured":"Bellitto, T., Conchon-Kerjan, C., Escoffier, B.: Restless exploration of periodic temporal graphs. In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bok, J., Dailly, A., Lehtil\u00e4, T.: Resolving sets in temporal graphs. arXiv preprint arXiv:2403.13183 (2024)","DOI":"10.1007\/978-3-031-63021-7_22"},{"issue":"5","key":"22_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"1\u20133","key":"22_CR6","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. Discrete Appl. Math. 105(1\u20133), 99\u2013113 (2000)","journal-title":"Discrete Appl. Math."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-031-32733-9_17","volume-title":"Structural Information and Communication Complexity (SIROCCO 2023)","author":"JL De Carufel","year":"2023","unstructured":"De Carufel, J.L., Flocchini, P., Santoro, N., Simard, F.: Cops & robber on periodic temporal graphs: characterization and improved bounds. In: Rajsbaum, S., Balliu, A., Daymude, J.J., Olivetti, D. (eds.) SIROCCO 2023. LNCS, vol. 13892, pp. 386\u2013405. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32733-9_17"},{"issue":"1","key":"22_CR8","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., 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":"4","key":"22_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":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-38919-2_6","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"T Erlebach","year":"2020","unstructured":"Erlebach, T., Spooner, J.T.: A game of cops and robbers on graphs with periodic edge-connectivity. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 64\u201375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_6"},{"issue":"5","key":"22_CR11","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1093\/comjnl\/bxaa009","volume":"64","author":"A Estrada-Moreno","year":"2021","unstructured":"Estrada-Moreno, A., Yero, I.G., Rodr\u00edguez-Vel\u00e1zquez, J.A.: On the $$(k, t)$$-metric dimension of graphs. Comput. J. 64(5), 707\u2013720 (2021)","journal-title":"Comput. J."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2017.11.019","volume":"236","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A.: On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results. Discrete Appl. Math. 236, 183\u2013202 (2018)","journal-title":"Discrete Appl. Math."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00224-011-9341-8","volume":"50","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Kellett, M., Mason, P.C., Santoro, N.: Searching for black holes in subways. Theory Comput. Syst. 50, 158\u2013184 (2012)","journal-title":"Theory Comput. Syst."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2012.10.029","volume":"469","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theor. Comput. Sci. 469, 53\u201368 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR15","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, 914\u2013944 (2017)","journal-title":"Algorithmica"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2022.04.021","volume":"320","author":"RM Frongillo","year":"2022","unstructured":"Frongillo, R.M., Geneson, J., Lladser, M.E., Tillquist, R.C., Yi, E.: Truncated metric dimension for finite graphs. Discrete Appl. Math. 320, 150\u2013169 (2022)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"22_CR17","doi-asserted-by":"publisher","first-page":"2241","DOI":"10.1137\/22M1510911","volume":"37","author":"E Galby","year":"2023","unstructured":"Galby, E., Khazaliya, L., Mc Inerney, F., Sharma, R., Tale, P.: Metric dimension parameterized by feedback vertex set and other structural parameters. SIAM J. Discrete Math. 37(4), 2241\u20132264 (2023)","journal-title":"SIAM J. Discrete Math."},{"key":"22_CR18","unstructured":"Geneson, J., Yi, E.: The distance-$$k$$ dimension of graphs. arXiv preprint arXiv:2106.08303 (2021)"},{"key":"22_CR19","first-page":"243","volume":"83","author":"J Geneson","year":"2022","unstructured":"Geneson, J., Yi, E.: Broadcast dimension of graphs. Australas. J. Comb. 83, 243 (2022)","journal-title":"Australas. J. Comb."},{"key":"22_CR20","unstructured":"Gutkovich, P., Yeoh, Z.S.: Computing truncated metric dimension of trees. arXiv preprint arXiv:2302.05960 (2023)"},{"issue":"191\u2013195","key":"22_CR21","first-page":"1","volume":"2","author":"F Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Comb. 2(191\u2013195), 1 (1976)","journal-title":"Ars Comb."},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Hartung, S., Nichterlein, A.: On the parameterized and approximation hardness of metric dimension. In: 2013 IEEE Conference on Computational Complexity, pp. 266\u2013276. IEEE (2013)","DOI":"10.1109\/CCC.2013.36"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88, 1\u201330 (2015)","journal-title":"Eur. Phys. J. B"},{"key":"22_CR24","series-title":"Computational Social Sciences","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23495-9","volume-title":"Temporal Network Theory","author":"P Holme","year":"2019","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal Network Theory. Computational Social Sciences, Springer, Cham (2019)"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-25873-2_31","volume-title":"Principles of Distributed Systems","author":"D Ilcinkas","year":"2011","unstructured":"Ilcinkas, D., Wade, A.M.: On the power of waiting when exploring public transportation systems. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 451\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_31"},{"issue":"22","key":"22_CR26","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. Discrete Math. 312(22), 3349\u20133356 (2012)","journal-title":"Discrete Math."},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-68279-0_8","volume-title":"50 Years of Integer Programming 1958-2008","author":"RM Karp","year":"2010","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958-2008, pp. 219\u2013241. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_8"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"issue":"3","key":"22_CR29","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. Discrete Appl. Math. 70(3), 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Kunz, P., Molter, H., Zehavi, M.: In which graph structures can we efficiently find temporally disjoint paths and walks? In: Elkind, E. (ed.) Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-2023, pp. 180\u2013188. International Joint Conferences on Artificial Intelligence Organization (2023)","DOI":"10.24963\/ijcai.2023\/21"},{"key":"22_CR31","unstructured":"Kuziak, D., Yero, I.G.: Metric dimension related parameters in graphs: a survey on combinatorial, computational and applied results. arXiv preprint arXiv:2107.04877 (2021)"},{"issue":"9","key":"22_CR32","first-page":"1325","volume":"20","author":"C Liu","year":"2008","unstructured":"Liu, C., Wu, J.: Scalable routing in cyclic mobile networks. IEEE Trans. Parallel Distrib. Syst. 20(9), 1325\u20131338 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"22_CR33","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"key":"22_CR34","first-page":"549","volume":"14","author":"P Slater","year":"1975","unstructured":"Slater, P.: Leaves of trees. Congr. Numer. 14, 549\u2013559 (1975)","journal-title":"Congr. Numer."},{"issue":"4","key":"22_CR35","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)","journal-title":"SIAM Rev."},{"key":"22_CR36","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","volume":"107","author":"P Zschoche","year":"2020","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107, 72\u201392 (2020)","journal-title":"J. Comput. Syst. Sci."}],"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-031-63021-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T10:57:53Z","timestamp":1732273073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}