{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:44:05Z","timestamp":1760013845508},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_17","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"154-166","source":"Crossref","is-referenced-by-count":4,"title":["Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[]},{"given":"Sonia","family":"Toubaline","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes, Technical Report CS-TR-3539, Department of Computer Science, University of Maryland (1995)"},{"key":"17_CR2","unstructured":"Bazgan, C., Toubaline, S., VanderPoten, D.: D\u00e9termination des \u00e9l\u00e9ments les plus vitaux pour le probl\u00e8me d\u2019affectation. In: Actes de la 10\u00e8me Conf\u00e9rence de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationelle et d\u2019Aide \u00e0 la D\u00e9cision, ROADEF 2010 (2010)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR5","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), pp. 539\u2013546 (1996)"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2004.01.011","volume":"145","author":"M. Habib","year":"2005","unstructured":"Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics\u00a0145(2), 183\u2013197 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path. Mathematics of Operations Research\u00a017(1), 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","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., Zhao, J.: On short paths interdiction problems: total and node-wise limited interdiction. Theory of Computing Systems\u00a043(2), 204\u2013233 (2008)","journal-title":"Theory of Computing Systems"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth, computations and approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth, computations and approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"17_CR10","first-page":"116","volume":"38","author":"D. K\u0151nig","year":"1931","unstructured":"K\u0151nig, D.: Graphs and matrices. Math. Fiz. Lapok\u00a038, 116\u2013119 (1931) (in Hungarian)","journal-title":"Math. Fiz. Lapok"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packing: structural properties and algorithms. Mathematical Programming\u00a08, 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation and complexity classes. Journal of Computer and System Science\u00a043(3), 425\u2013440 (1991)","journal-title":"Journal of Computer and System Science"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Computational Complexity\u00a04, 133\u2013157 (1994)","journal-title":"Computational Complexity"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","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., Zenklusen, R.: Blockers and Transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discrete Mathematics\u00a0310(1), 132\u2013146 (2010)","journal-title":"Discrete Mathematics"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s002360050166","volume":"36","author":"H. Shen","year":"1999","unstructured":"Shen, H.: Finding the k most vital edges with respect to minimum spanning tree. Acta Informatica\u00a036, 405\u2013424 (1999)","journal-title":"Acta Informatica"},{"issue":"13","key":"17_CR16","doi-asserted-by":"publisher","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., Bentz, C.: Blockers and Transversals. Discrete Mathematics\u00a0309(13), 4306\u20134314 (2009)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R.K. Wood","year":"1993","unstructured":"Wood, R.K.: Deterministic network interdiction. Mathematical and Computer Modeling\u00a017(2), 1\u201318 (1993)","journal-title":"Mathematical and Computer Modeling"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:52:28Z","timestamp":1558421548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}