{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:29:03Z","timestamp":1770902943355,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032171559","type":"print"},{"value":"9783032171566","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-17156-6_14","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:37Z","timestamp":1770899797000},"page":"179-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms and\u00a0Hardness for\u00a0Geodetic Set on\u00a0Tree-Like Digraphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8198-693X","authenticated-orcid":false,"given":"Florent","family":"Foucaud","sequence":"first","affiliation":[]},{"given":"Narges","family":"Ghareghani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5084-5118","authenticated-orcid":false,"given":"Lucas","family":"Lorieau","sequence":"additional","affiliation":[]},{"given":"Morteza","family":"Mohammad-Noori","sequence":"additional","affiliation":[]},{"given":"Rasa","family":"Parvini Oskuei","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9753-0523","authenticated-orcid":false,"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"10","key":"14_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112985","volume":"345","author":"J Ahn","year":"2022","unstructured":"Ahn, J., Jaffke, L., Kwon, O., Lima, P.T.: Well-partitioned chordal graphs. Discret. Math. 345(10), 112985 (2022)","journal-title":"Discret. Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2021.03.016","volume":"323","author":"J Ara\u00fajo","year":"2022","unstructured":"Ara\u00fajo, J., Arraes, P.S.M.: Hull and geodetic numbers for some classes of oriented graphs. Discret. Appl. Math. 323, 14\u201327 (2022)","journal-title":"Discret. Appl. Math."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bergougnoux, B., Defrain, O., Mc\u00a0Inerney, F.: Enumerating minimal solution sets for metric graph problems. In: Proc. of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2024). Lecture Notes in Computer Science, Springer (2024)","DOI":"10.1007\/978-3-031-75409-8_4"},{"key":"14_CR4","unstructured":"Chakraborty, D., Das, S., Foucaud, F., Gahlawat, H., Lajou, D., Roy, B.: Algorithms and complexity for geodetic Sets on planar and chordal graphs. In: 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0181, pp. 7:1\u20137:15. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Chakraborty, D., Foucaud, F., Gahlawat, H., Ghosh, S.K., Roy, B.: Hardness and approximation for the geodetic set problem in some graph classes. In: Proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020). Lecture Notes in Computer Science, vol. 12016, pp. 102\u2013115. Springer International Publishing, Cham (2020)","DOI":"10.1007\/978-3-030-39219-2_9"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114217","volume":"979","author":"D Chakraborty","year":"2023","unstructured":"Chakraborty, D., Gahlawat, H., Roy, B.: Algorithms and complexity for geodetic sets on partial grids. Theoretical Comput. Sci. 979, 114217 (2023)","journal-title":"Theoretical Comput. Sci."},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ejc.2003.09.010","volume":"25","author":"GJ Chang","year":"2004","unstructured":"Chang, G.J., Tong, L.D., Wang, H.T.: Geodetic spectra of graphs. Eur. J. Comb. 25(3), 383\u2013391 (2004)","journal-title":"Eur. J. Comb."},{"issue":"36","key":"14_CR8","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1155\/S0161171203210577","volume":"2003","author":"G Chartrand","year":"2003","unstructured":"Chartrand, G., Fink, J.F., Zhang, P.: The hull number of an oriented graph. Int. J. Math. Math. Sci. 2003(36), 2265\u20132275 (2003)","journal-title":"Int. J. Math. Math. Sci."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Chartrand, G., Zhang, P.: The geodetic number of an oriented graph. Eur. J. Comb. 21(2), 181\u2013189 (2000)","DOI":"10.1006\/eujc.1999.0301"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Dailly, A., Foucaud, F., Hakanen, A.: Algorithms and hardness for metric dimension on digraphs. In: Paulusma, D., Ries, B. (eds.) Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023. Lecture Notes in Computer Science, vol. 14093, pp. 232\u2013245. Springer (2023)","DOI":"10.1007\/978-3-031-43380-1_17"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Davot, T., Isenmann, L., Thiebaut, J.: On the approximation hardness of geodetic set and its variants. In: Chen, C.-Y., Hon, W.-K., Hung, L.-J., Lee, C.-W. (eds.) COCOON 2021. LNCS, vol. 13025, pp. 76\u201388. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89543-3_7","DOI":"10.1007\/978-3-030-89543-3_7"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.dam.2025.08.041","volume":"377","author":"SR Dev","year":"2025","unstructured":"Dev, S.R., Dey, S., Foucaud, F., Narayanan, K., Sulochana, L.R.: Monitoring edge-geodetic sets in graphs. Discret. Appl. Math. 377, 598\u2013610 (2025)","journal-title":"Discret. Appl. Math."},{"key":"14_CR14","first-page":"401","volume":"91","author":"L Dong","year":"2009","unstructured":"Dong, L., Lu, C., Wang, X.: The upper and lower geodetic numbers of graphs. Ars Combin. 91, 401\u2013409 (2009)","journal-title":"Ars Combin."},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.disc.2009.09.018","volume":"310","author":"MC Dourado","year":"2010","unstructured":"Dourado, M.C., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: Some remarks on the geodetic number of a graph. Discret. Math. 310(4), 832\u2013837 (2010)","journal-title":"Discret. Math."},{"key":"14_CR16","first-page":"67","volume":"22","author":"AL Douthat","year":"1996","unstructured":"Douthat, A.L., Kong, M.C.: Computing geodetic bases of chordal and split graph. J. Comb. Math. Comb. Comput. 22, 67\u201377 (1996)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-29344-3_24","volume-title":"LATIN 2012: Theoretical Informatics","author":"T Ekim","year":"2012","unstructured":"Ekim, T., Erey, A., Heggernes, P., van \u2019t Hof, P., Meister, D.: Computing minimum geodetic sets of proper interval graphs. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 279\u2013290. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29344-3_24"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/0607049","volume":"7","author":"M Farber","year":"1986","unstructured":"Farber, M., Jamison, R.E.: Convexity in graphs and hypergraphs. SIAM J. Algebraic Discrete Methods 7(3), 433\u2013444 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.dam.2005.03.002","volume":"148","author":"A Farrugia","year":"2005","unstructured":"Farrugia, A.: Orientable convexity, geodetic and hull numbers in graphs. Discret. Appl. Math. 148(3), 256\u2013262 (2005)","journal-title":"Discret. Appl. Math."},{"key":"14_CR20","unstructured":"Foucaud, F., Galby, E., Khazaliya, L., Li, S., Inerney, F.M., Sharma, R., Tale, P.: Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover. In: Bringmann, K., Grohe, M., Puppis, G., Svensson, O. (eds.) 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia. LIPIcs, vol.\u00a0297, pp. 66:1\u201366:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"14_CR21","unstructured":"Foucaud, F., Galby, E., Khazaliya, L., Li, S., Inerney, F.M., Sharma, R., Tale, P.: Metric dimension and geodetic set parameterized by vertex cover. In: Beyersdorff, O., Pilipczuk, M., Pimentel, E., Nguyen, K.T. (eds.) 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany. LIPIcs, vol.\u00a0327, pp. 33:1\u201333:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"14_CR22","unstructured":"Foucaud, F., et al.: Metric dimension and geodetic set parameterized by vertex cover. In: Beyersdorff, O., Pilipczuk, M., Pimentel, E., Nguyen, K.T. (eds.) 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany. LIPIcs, vol.\u00a0327, pp. 33:1\u201333:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2023.12.018","volume":"347","author":"F Foucaud","year":"2024","unstructured":"Foucaud, F., Ghareghani, N., Sharifani, P.: Extremal digraphs for open neighbourhood location-domination and identifying codes. Discret. Appl. Math. 347, 62\u201374 (2024)","journal-title":"Discret. Appl. Math."},{"key":"14_CR24","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"issue":"11","key":"14_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"F Harary","year":"1993","unstructured":"Harary, F., Loukakis, E., Tsouros, C.: The geodetic number of a graph. Math. Comput. Model. 17(11), 89\u201395 (1993)","journal-title":"Math. Comput. Model."},{"issue":"4","key":"14_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.7155\/jgaa.00601","volume":"26","author":"L Kellerhals","year":"2022","unstructured":"Kellerhals, L., Koana, T.: Parameterized complexity of geodetic set. J. Graph Algorithms Appl. 26(4), 401\u2013419 (2022)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Lu, C.h.: The geodetic numbers of graphs and digraphs. Sci. China Seri. A Math. 50(8), 1163\u20131172 (2007)","DOI":"10.1007\/s11425-007-0048-x"},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2018.05.032","volume":"745","author":"M Mezzini","year":"2018","unstructured":"Mezzini, M.: Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. Theoret. Comput. Sci. 745, 63\u201374 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Pelayo, I.M.: Geodesic Convexity in Graphs. Springer (2013)","DOI":"10.1007\/978-1-4614-8699-2"},{"key":"14_CR30","unstructured":"Tale, P.: Geodetic set on graphs of constant pathwidth and feedback vertex set number. In: Agrawal, A., van Leeuwen, E.J. (eds.) 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, September 17-19, 2025, University of Warsaw, Poland. LIPIcs, vol. to appear. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17156-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:45Z","timestamp":1770899805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17156-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032171559","9783032171566"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17156-6_14","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":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dharwad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"12 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2026.iitdh.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}