{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T14:47:34Z","timestamp":1764946054629,"version":"3.46.0"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.dam.2025.10.023","type":"journal-article","created":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T12:42:42Z","timestamp":1761050562000},"page":"326-347","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Weighted efficient domination for\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e259\" altimg=\"si15.svg\">\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>P<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:mn>8<\/mml:mn>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                    <\/mml:math>\n                    -free bipartite graphs in polynomial time"],"prefix":"10.1016","volume":"380","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.10.023_b1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ipl.2018.08.002","article-title":"Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs","volume":"140","author":"Abrishami","year":"2018","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10.1016\/j.dam.2025.10.023_b2","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/jgt.3190140409","article-title":"A characterization of graphs without long induced paths","volume":"14","author":"Bacs\u00f3","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2025.10.023_b3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00094-D","article-title":"Generalized domination and efficient domination in graphs","volume":"159","author":"Bange","year":"1996","journal-title":"Discret. Math."},{"key":"10.1016\/j.dam.2025.10.023_b4","series-title":"Applications of Discrete Math","first-page":"189","article-title":"Efficient dominating sets in graphs","author":"Bange","year":"1988"},{"key":"10.1016\/j.dam.2025.10.023_b5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","article-title":"Perfect codes in graphs","volume":"15","author":"Biggs","year":"1973","journal-title":"J. Comb. Theory (B)"},{"issue":"1\u20133","key":"10.1016\/j.dam.2025.10.023_b6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0304-3975(02)00586-8","article-title":"Independent domination in finitely defined classes of graphs","volume":"301","author":"Boliac","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2025.10.023_b7","first-page":"1","article-title":"Efficient domination and efficient edge domination: A brief survey","author":"Brandst\u00e4dt","year":"2018"},{"key":"10.1016\/j.dam.2025.10.023_b8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ipl.2014.09.024","article-title":"Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs","volume":"115","author":"Brandst\u00e4dt","year":"2015","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.dam.2025.10.023_b9","article-title":"Graph classes: A survey","volume":"vol. 3","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/j.dam.2025.10.023_b10","series-title":"Conference Proceedings of ISAAC 2012","first-page":"267","article-title":"Efficient dominating and edge dominating sets for graphs and hypergraphs, extended abstract","author":"Brandst\u00e4dt","year":"2012"},{"key":"10.1016\/j.dam.2025.10.023_b11","series-title":"Conference Proceedings of MFCS 2013","first-page":"195","article-title":"New polynomial cases of the weighted efficient domination problem, extended abstract","author":"Brandst\u00e4dt","year":"2013"},{"key":"10.1016\/j.dam.2025.10.023_b12","unstructured":"A. Brandst\u00e4dt, R. Mosca, Finding Efficient Domination for P8-Free Bipartite Graphs in Polynomial Time. arXiv:2101.01772v2."},{"key":"10.1016\/j.dam.2025.10.023_b13","series-title":"Proceedings of WG 2016","first-page":"38","article-title":"Weighted efficient domination for P5-free and P6-free graphs, extended abstract","author":"Brandst\u00e4dt","year":"2016"},{"key":"10.1016\/j.dam.2025.10.023_b14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.dam.2019.06.004","article-title":"On efficient domination for some classes of H-free bipartite graphs","volume":"270","author":"Brandst\u00e4dt","year":"2019","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.dam.2025.10.023_b15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2025.10.023_b16","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2025.10.023_b17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.dam.2013.08.011","article-title":"Algorithms for unipolar and generalized split graphs","volume":"162","author":"Eschen","year":"2014","journal-title":"Discret. Appl. Math."},{"year":"1979","series-title":"Computers and Intractability\u2013A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.dam.2025.10.023_b18"},{"key":"10.1016\/j.dam.2025.10.023_b19","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","article-title":"Trivially perfect graphs","volume":"24","author":"Golumbic","year":"1978","journal-title":"Discret. Math."},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/j.dam.2025.10.023_b20"},{"key":"10.1016\/j.dam.2025.10.023_b21","series-title":"Domination in Graphs: Core Concepts","article-title":"Efficient domination in graphs","author":"Haynes","year":"2023"},{"key":"10.1016\/j.dam.2025.10.023_b22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.61091\/jcmcc122-27","article-title":"Efficient domination in grid graphs","volume":"122","author":"Hutson","year":"2024","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/j.dam.2025.10.023_b23","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"year":"1999","series-title":"Graphs Without Asteroidal Triples","author":"K\u00f6hler","key":"10.1016\/j.dam.2025.10.023_b24"},{"issue":"2","key":"10.1016\/j.dam.2025.10.023_b25","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1142\/S0129054108005772","article-title":"The clique-width of bipartite graphs in monogenic classes","volume":"19","author":"Lozin","year":"2008","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.dam.2025.10.023_b26","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.endm.2017.07.042","article-title":"The structure and the number of P7-free bipartite graphs","volume":"61","author":"Lozin","year":"2017","journal-title":"Electron. Notes Discret. Math."},{"key":"10.1016\/j.dam.2025.10.023_b27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ejc.2017.05.008","article-title":"The structure and the number of P7-free bipartite graphs","volume":"65","author":"Lozin","year":"2017","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.dam.2025.10.023_b28","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0166-218X(01)00184-6","article-title":"Weighted efficient domination problem on some perfect graphs","volume":"117","author":"Lu","year":"2002","journal-title":"Discret. Appl. Math."},{"year":"2014","series-title":"Efficient Domination and Polarity","author":"Nevries","key":"10.1016\/j.dam.2025.10.023_b29"},{"key":"10.1016\/j.dam.2025.10.023_b30","first-page":"83","article-title":"Complexity results for closed neighborhood order parameters","volume":"112","author":"Smart","year":"1995","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2025.10.023_b31","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1090\/S0002-9939-1962-0172273-0","article-title":"The comparability graph of a tree","volume":"13","author":"Wolk","year":"1962","journal-title":"Proc. AMS"},{"key":"10.1016\/j.dam.2025.10.023_b32","first-page":"17","article-title":"A note on the comparability graph of a tree","volume":"16","author":"Wolk","year":"1965","journal-title":"Proc. AMS"},{"key":"10.1016\/j.dam.2025.10.023_b33","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(94)00138-4","article-title":"The weighted perfect domination problem and its variants","volume":"66","author":"Yen","year":"1996","journal-title":"Discret. Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25005864?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25005864?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T14:44:14Z","timestamp":1764945854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25005864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":33,"alternative-id":["S0166218X25005864"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.10.023","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Weighted efficient domination for -free bipartite graphs in polynomial time","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.10.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}