{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:52:10Z","timestamp":1780822330119,"version":"3.54.1"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE48-0004"],"award-info":[{"award-number":["ANR-21-CE48-0004"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["16-IDEX-0001"],"award-info":[{"award-number":["16-IDEX-0001"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","award":["SR\/FST\/MS-I\/2018\/22"],"award-info":[{"award-number":["SR\/FST\/MS-I\/2018\/22"]}],"id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","award":["CRG\/2022\/008333"],"award-info":[{"award-number":["CRG\/2022\/008333"]}],"id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","award":["Number-CRG\/2022\/008333"],"award-info":[{"award-number":["Number-CRG\/2022\/008333"]}],"id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.dam.2026.03.048","type":"journal-article","created":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T12:52:29Z","timestamp":1775307149000},"page":"92-105","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Characterizing optimal monitoring edge-geodetic sets for some structured graph classes"],"prefix":"10.1016","volume":"389","author":[{"given":"Florent","family":"Foucaud","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7996-6388","authenticated-orcid":false,"given":"Kaustav","family":"Paul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.03.048_b1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.03.048_b2","series-title":"Topics in algorithmic graph theory","author":"Beineke","year":"2021"},{"key":"10.1016\/j.dam.2026.03.048_b3","series-title":"Proceedings of the 25th Italian Conference on Theoretical Computer Science, Torino, Italy, September 11-13, 2024","first-page":"219","article-title":"On the inapproximability of finding minimum monitoring edge-geodetic sets (short paper)","volume":"Vol. 3811","author":"Bil\u00f2","year":"2024"},{"issue":"8","key":"10.1016\/j.dam.2026.03.048_b4","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1007\/s00453-021-00923-7","article-title":"Vertex deletion into bipartite permutation graphs","volume":"84","author":"Bozyk","year":"2022","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.03.048_b5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.dam.2018.08.021","article-title":"Broadcast domination and multipacking in strongly chordal graphs","volume":"261","author":"Brewster","year":"2019","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"10.1016\/j.dam.2026.03.048_b6","doi-asserted-by":"crossref","first-page":"114595","DOI":"10.1016\/j.disc.2025.114595","article-title":"Distance-based (and path-based) covering problems for graphs of given cyclomatic number","volume":"348","author":"Chakraborty","year":"2025","journal-title":"Discret. Math."},{"key":"10.1016\/j.dam.2026.03.048_b7","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.dam.2025.08.041","article-title":"Monitoring edge-geodetic sets in graphs","volume":"377","author":"Dev","year":"2025","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.03.048_b8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.048_b9","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.dam.2021.07.002","article-title":"Monitoring the edges of a graph using distances","volume":"319","author":"Foucaud","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.048_b10","series-title":"Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings","first-page":"29","article-title":"Monitoring edge-geodetic sets in graphs: Extremal graphs, bounds, complexity","volume":"Vol. 14508","author":"Foucaud","year":"2024"},{"key":"10.1016\/j.dam.2026.03.048_b11","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.dam.2024.12.032","article-title":"Bounds and extremal graphs for monitoring edge-geodetic sets in graphs","volume":"366","author":"Foucaud","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.048_b12","series-title":"Algorithms and complexity for monitoring edge-geodetic sets in graphs","author":"Foucaud","year":"2024"},{"key":"10.1016\/j.dam.2026.03.048_b13","series-title":"Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings","first-page":"245","article-title":"Monitoring edge-geodetic sets in graphs","volume":"Vol. 13947","author":"Foucaud","year":"2023"},{"key":"10.1016\/j.dam.2026.03.048_b14","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"2004"},{"issue":"1\u20132","key":"10.1016\/j.dam.2026.03.048_b15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"10.1016\/j.dam.2026.03.048_b16","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","article-title":"The geodetic number of a graph","volume":"17","author":"Harary","year":"1993","journal-title":"Math. Comput. Modelling"},{"key":"10.1016\/j.dam.2026.03.048_b17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.dam.2023.06.033","article-title":"Monitoring edge-geodetic sets: Hardness and graph products","volume":"340","author":"Haslegrave","year":"2023","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2026.03.048_b18","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1137\/110830514","article-title":"Computing the cutwidth of bipartite permutation graphs in linear time","volume":"26","author":"Heggernes","year":"2012","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.dam.2026.03.048_b19","series-title":"Information system on graph classes and their inclusions","author":"ISGCI","year":"2025"},{"issue":"2","key":"10.1016\/j.dam.2026.03.048_b20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.03.048_b21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0166-218X(96)00014-5","article-title":"Bipartite permutation graphs with application to the minimum buffer size problem","volume":"74","author":"Lai","year":"1997","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"10.1016\/j.dam.2026.03.048_b22","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1007\/s11590-018-1371-6","article-title":"A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs","volume":"13","author":"Lalou","year":"2019","journal-title":"Optim. Lett."},{"issue":"8","key":"10.1016\/j.dam.2026.03.048_b23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.3390\/a17080359","article-title":"Exploring clique transversal variants on distance-hereditary graphs: Computational insights and algorithmic approaches","volume":"17","author":"Lee","year":"2024","journal-title":"Algorithms"},{"issue":"2","key":"10.1016\/j.dam.2026.03.048_b24","doi-asserted-by":"crossref","first-page":"2450010:1","DOI":"10.1142\/S0219265924500105","article-title":"Monitoring edge-geodetic numbers of mycielskian graph classes","volume":"25","author":"Li","year":"2025","journal-title":"J. Interconnect. Networks"},{"issue":"3","key":"10.1016\/j.dam.2026.03.048_b25","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1080\/17445760.2023.2294369","article-title":"Monitoring-edge-geodetic numbers of radix triangular mesh and Sierpi\u0144ski graphs","volume":"39","author":"Ma","year":"2024","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"10.1016\/j.dam.2026.03.048_b26","series-title":"Optimal algorithm for paired-domination in distance-hereditary graphs","author":"Mu","year":"2024"},{"issue":"4","key":"10.1016\/j.dam.2026.03.048_b27","doi-asserted-by":"crossref","first-page":"947","DOI":"10.7151\/dmgt.2411","article-title":"Vertex-edge domination in interval and bipartite permutation graphs","volume":"43","author":"Paul","year":"2023","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.048_b28","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.dam.2024.12.017","article-title":"Exploring algorithmic solutions for the independent roman domination problem in graphs","volume":"364","author":"Paul","year":"2025","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2026.03.048_b29","doi-asserted-by":"crossref","first-page":"2115","DOI":"10.1137\/20M1369920","article-title":"Cycle extendability of Hamiltonian strongly chordal graphs","volume":"35","author":"Rong","year":"2021","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"10.1016\/j.dam.2026.03.048_b30","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2026.03.048_b31","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/17445760.2023.2220143","article-title":"Monitoring edge-geodetic numbers of convex polytopes and four networks","volume":"38","author":"Tan","year":"2023","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"10.1016\/j.dam.2026.03.048_b32","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.dam.2023.05.030","article-title":"A linear-time algorithm for semitotal domination in strongly chordal graphs","volume":"338","author":"Tripathi","year":"2023","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.03.048_b33","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1080\/17445760.2024.2301929","article-title":"Monitoring-edge-geodetic sets in product networks","volume":"39","author":"Xu","year":"2024","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"1","key":"10.1016\/j.dam.2026.03.048_b34","first-page":"2450001:1","article-title":"Monitoring edge-geodetic numbers of some networks","volume":"25","author":"Zhang","year":"2026","journal-title":"J. Interconnect. Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T08:37:50Z","timestamp":1778488670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":34,"alternative-id":["S0166218X26001988"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.048","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Characterizing optimal monitoring edge-geodetic sets for some structured graph classes","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.048","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}