{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T03:27:42Z","timestamp":1771126062167,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9334-6","type":"journal-article","created":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T18:39:43Z","timestamp":1275676783000},"page":"857-872","source":"Crossref","is-referenced-by-count":23,"title":["Minimum d-blockers and d-transversals in graphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Marie-Christine","family":"Costa","sequence":"first","affiliation":[]},{"given":"Dominique","family":"de Werra","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Picouleau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"9334_CR1","volume-title":"Networks flows: theory, algorithm, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Networks flows: theory, algorithm, and applications. Prentice Hall, New York"},{"key":"9334_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511984068","volume-title":"Bipartite graphs and their applications","author":"AJ Asratian","year":"1998","unstructured":"Asratian AJ, Denley TMJ, H\u00e4ggkvist R (1998) Bipartite graphs and their applications. Cambridge University Press, Cambridge"},{"key":"9334_CR3","volume-title":"Graphes","author":"C Berge","year":"1983","unstructured":"Berge C (1983) Graphes. Gauthier-Villars, Paris"},{"key":"9334_CR4","unstructured":"Bonomo F, Dur\u00e1n G (2004) Computational complexity of classical problems for hereditary classes of graphs. Pesquisa operacional, vol\u00a024, pp\u00a0413\u2013434 or Electronic notes in discrete mathematics, vol\u00a018, pp\u00a041\u201346"},{"issue":"1","key":"9334_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(01)00327-4","volume":"124","author":"E Boros","year":"2002","unstructured":"Boros E, Golumbic MC, Levit VE (2002) On the number of vertices belonging to all maximum stable sets of a graph. Discrete Appl Math 124(1):17\u201325","journal-title":"Discrete Appl Math"},{"key":"9334_CR6","series-title":"SIAM monographs on discrete math and appl","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey","author":"A Branst\u00e4dt","year":"1999","unstructured":"Branst\u00e4dt A, Spinrad JP, Le VB (1999) Graph classes: a survey. SIAM monographs on discrete math and appl. SIAM, Philadelphia"},{"issue":"13","key":"9334_CR7","doi-asserted-by":"crossref","first-page":"1824-1844","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P Burzyn","year":"2006","unstructured":"Burzyn P, Bonomo F, Dur\u00e1n G (2006) $\\mathcal{NP}$ -completeness results for edge modification problems. Discrete Appl Math 154(13):1824-1844","journal-title":"Discrete Appl Math"},{"key":"9334_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann Oper Res 153:235\u2013256","journal-title":"Ann Oper Res"},{"key":"9334_CR9","volume-title":"Foundations of bilevel programming","author":"S Dempe","year":"2002","unstructured":"Dempe S (2002) Foundations of bilevel programming. Kluwer Academic, Amsterdam"},{"key":"9334_CR10","unstructured":"Frank A (1994) On the edge connectivity algorithm of Nagamochi and Ibaraki, Unpublished report"},{"key":"9334_CR11","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9334_CR12","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O Goldschmidt","year":"1994","unstructured":"Goldschmidt O, Hochbaum DS (1994) A polynomial algorithm for the k-cut problem for fixed k. Math Oper Res 19:24\u201337","journal-title":"Math Oper Res"},{"key":"9334_CR13","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","volume":"43","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Rudolf G, Zhav J (2008) On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput Syst 43:204\u2013233","journal-title":"Theory Comput Syst"},{"key":"9334_CR14","doi-asserted-by":"crossref","unstructured":"Lee C-M (2009) Variations of maximum-clique transversal sets on graphs. Ann Oper Res, to appear","DOI":"10.1007\/s10479-009-0673-6"},{"key":"9334_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis JM, Yannakakis M (1980) The node-deletion problem for hereditary properties is $\\mathcal{NP}$ -complete. J Comput Syst Sci 20:219\u2013230","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"9334_CR16","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.disc.2009.08.009","volume":"310","author":"B Ries","year":"2010","unstructured":"Ries B, Bentz C, Picouleau C, de Werra D, Costa M-C, Zenklusen R (2010) Blockers and Transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid. Discrete Math 310(1):132\u2013146","journal-title":"Discrete Math"},{"key":"9334_CR17","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, New York"},{"key":"9334_CR18","volume-title":"Alferd Packer\u2019s high protein gourmet cookbook","author":"W Spurr","year":"1995","unstructured":"Spurr W, Spurr K (1995) Alferd Packer\u2019s high protein gourmet cookbook. Centennial Publications, Grand Junction"},{"key":"9334_CR19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0095-8956(78)90009-6","volume":"25","author":"PJ Slater","year":"1978","unstructured":"Slater PJ (1978) A constructive characterization of trees with at least k disjoint maximum matchings. J\u00a0Comb Theory Ser B 25:326\u2013338","journal-title":"J\u00a0Comb Theory Ser B"},{"key":"9334_CR20","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF02275351","volume":"89","author":"LN Vicente","year":"1996","unstructured":"Vicente LN, Savard G, Judice JJ (1996) The discrete linear bilevel programming problem. J Optim Theory Appl 89:597\u2013614","journal-title":"J Optim Theory Appl"},{"key":"9334_CR21","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/net.3230200402","volume":"20","author":"D Wagner","year":"1990","unstructured":"Wagner D (1990) Disjoint st-cuts in a network. Networks 20:361\u2013371","journal-title":"Networks"},{"issue":"2","key":"9334_CR22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis M (1981a) Edge-deletion problems. SIAM J Comput 10(2):297\u2013309","journal-title":"SIAM J Comput"},{"issue":"2","key":"9334_CR23","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis M (1981b) Node-deletion problems on bipartite graphs. SIAM J Comput 10(2):310\u2013327","journal-title":"SIAM J Comput"},{"issue":"13","key":"9334_CR24","doi-asserted-by":"crossref","first-page":"4306","DOI":"10.1016\/j.disc.2009.01.006","volume":"309","author":"R Zenklusen","year":"2009","unstructured":"Zenklusen R, Ries B, Picouleau C, de Werra D, Costa M-C, Bentz C (2009) Blockers and Transversals. Discrete Mathematics 309(13):4306\u20134314","journal-title":"Discrete Mathematics"},{"key":"9334_CR25","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/jgt.3190150208","volume":"15","author":"J Zito","year":"1991","unstructured":"Zito J (1991) The structure and maximum number of maximum independent sets in trees. J Graph Theory 15:207\u2013221","journal-title":"J Graph Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9334-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9334-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9334-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9334-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9334"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9334-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,5]]}}}