{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:04Z","timestamp":1780783144559,"version":"3.54.1"},"publisher-location":"Cham","reference-count":10,"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_31","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:30Z","timestamp":1780780470000},"page":"442-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for\u00a0Monitoring Edge-Geodetic Sets in\u00a0Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Clara","family":"Marcille","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nacim","family":"Oijid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.jcss.2014.06.003","volume":"81","author":"E Bampas","year":"2015","unstructured":"Bampas, E., Bil\u00f2, D., Drovandi, G., Gual\u00e0, L., Klasing, R., Proietti, G.: Network verification via routing table queries. J. Comput. Syst. Sci. 81(1), 234\u2013248 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Beerliova, Z., et al.: Network discovery and verification. IEEE J. Selected Areas Commun. 24, 2168\u20132181 (2005). https:\/\/api.semanticscholar.org\/CorpusID:424573","DOI":"10.1109\/JSAC.2006.884015"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bejerano, Y., Rastogi, R.: Robust monitoring of link delays and faults in IP networks. In: IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No. 03CH37428). vol. 1, pp. 134\u2013144. IEEE (2003)","DOI":"10.1109\/INFCOM.2003.1208666"},{"key":"31_CR4","unstructured":"Fomin, F.V., Golovach, P.A., Jedli\u010dkov\u00e1, N., Kratochv\u00edl, J., Sagunov, D., Simonov, K.: Path cover, hamiltonicity, and independence number: an FPT perspective (2025). https:\/\/arxiv.org\/abs\/2403.05943"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.dam.2021.07.002","volume":"319","author":"F Foucaud","year":"2022","unstructured":"Foucaud, F., Kao, S.S., Klasing, R., Miller, M., Ryan, J.: Monitoring the edges of a graph using distances. Discret. Appl. Math. 319, 424\u2013438 (2022)","journal-title":"Discret. Appl. Math."},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2024.12.032","volume":"366","author":"F Foucaud","year":"2025","unstructured":"Foucaud, F., Marcille, C., Myint, Z.M., Sandeep, R., Sen, S., Taruni, S.: Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. Discret. Appl. Math. 366, 106\u2013119 (2025)","journal-title":"Discret. Appl. Math."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Foucaud, F., Marcille, C., Sandeep, R., Sen, S., Taruni, S.: Algorithms and complexity for monitoring edge-geodetic sets in graphs. arXiv preprint arXiv:2409.19067 (2024)","DOI":"10.2139\/ssrn.5311874"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Foucaud, F., Narayanan, K., Ramasubramony Sulochana, L.: Monitoring edge-geodetic sets in graphs. In: Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, 9\u201311 February 2023, Proceedings, pp. 245\u2013256 (2023)","DOI":"10.1007\/978-3-031-25211-2_19"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.dam.2026.03.048","volume":"389","author":"F Foucaud","year":"2026","unstructured":"Foucaud, F., Pandey, A., Paul, K.: Characterizing optimal monitoring edge-geodetic sets for some structured graph classes. Discret. Appl. Math. 389, 92\u2013105 (2026)","journal-title":"Discret. Appl. Math."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2023.06.033","volume":"340","author":"J Haslegrave","year":"2023","unstructured":"Haslegrave, J.: Monitoring edge-geodetic sets: hardness and graph products. Discret. Appl. Math. 340, 79\u201384 (2023)","journal-title":"Discret. Appl. Math."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:32Z","timestamp":1780780472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_31","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":"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"}}]}}