{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:48:20Z","timestamp":1772714900252,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T00:00:00Z","timestamp":1349913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00453-012-9695-6","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T02:45:00Z","timestamp":1349923500000},"page":"715-738","source":"Crossref","is-referenced-by-count":6,"title":["On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion"],"prefix":"10.1007","volume":"68","author":[{"given":"Nadja","family":"Betzler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Uhlmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,11]]},"reference":[{"issue":"3","key":"9695_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A\u00a02-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"9695_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B. Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59(1), 133\u2013142 (2011)","journal-title":"Oper. Res."},{"key":"9695_CR3","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R. Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Geiger, D.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. 27, 942\u2013959 (1998)","journal-title":"SIAM J. Comput."},{"key":"9695_CR4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A. Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of pearl\u2019s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83, 167\u2013188 (1996)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"9695_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N. Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On bounded-degree vertex deletion parameterized by treewidth. Discrete Appl. Math. 160(1\u20132), 53\u201360 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"52","key":"9695_CR6","doi-asserted-by":"crossref","first-page":"5425","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N. Betzler","year":"2009","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 5425\u20135442 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"9695_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H. Bodlaender","year":"2009","unstructured":"Bodlaender, H., Downey, R., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"9695_CR8","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A\u00a0linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"9695_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A\u00a0partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9695_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC\u201909)","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: new upper and lower bound techniques. In: Proceedings of the 4th International Workshop on Parameterized and Exact Computation (IWPEC\u201909). Lecture Notes in Computer Science, vol.\u00a05917, pp.\u00a017\u201337. Springer, Berlin (2009)"},{"issue":"7","key":"9695_CR11","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1016\/j.ic.2011.04.003","volume":"209","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations II. Lower bounds. Inf. Comput. 209(7), 1103\u20131119 (2011)","journal-title":"Inf. Comput."},{"issue":"35","key":"9695_CR12","doi-asserted-by":"crossref","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9695_CR13","series-title":"Lecture Notes in Computer Science","first-page":"93","volume-title":"Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT\u201910)","author":"Y. Cao","year":"2010","unstructured":"Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT\u201910). Lecture Notes in Computer Science, vol.\u00a06139, pp.\u00a093\u2013104. Springer, Berlin (2010)"},{"key":"9695_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP\u201909)","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP\u201909). Lecture Notes in Computer Science, vol.\u00a05555, pp.\u00a0378\u2013389. Springer, Berlin (2009)"},{"key":"9695_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"issue":"1","key":"9695_CR16","first-page":"275","volume":"35","author":"P. Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. Artif. Intell. 35(1), 275\u2013341 (2009)","journal-title":"Artif. Intell."},{"key":"9695_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-642-10217-2_2","volume-title":"Proceedings of the 20th International Workshop (IWOCA\u201909)","author":"M. Fellows","year":"2009","unstructured":"Fellows, M.: Towards fully multivariate algorithmics: some new results and directions in parameter ecology. In: Proceedings of the 20th International Workshop (IWOCA\u201909). Lecture Notes in Computer Science, vol.\u00a05874, pp.\u00a02\u201310. Springer, Berlin (2009)"},{"issue":"6","key":"9695_CR18","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1016\/j.jcss.2010.12.001","volume":"77","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A\u00a0generalization of Nemhauser and Trotter\u2019s local optimization theorem. J. Comput. Syst. Sci. 77(6), 1141\u20131158 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"9695_CR19","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)"},{"issue":"1","key":"9695_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"9695_CR21","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"1","key":"9695_CR22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"9695_CR23","doi-asserted-by":"crossref","unstructured":"Huberman, B.A., Romero, D.M., Wu, F.: Social networks that matter: twitter under the microscope. First Monday 14(1) (2009)","DOI":"10.5210\/fm.v14i1.2317"},{"key":"9695_CR24","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. Lecture Notes in Computer Science, vol.\u00a0842. Springer, Berlin (1994)"},{"key":"9695_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-32589-2_2","volume-title":"Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201912)","author":"C. Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Niedermeier, R.: New races in parameterized algorithmics. In: Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201912). Lecture Notes in Computer Science, vol.\u00a07464, pp.\u00a019\u201330. Springer, Berlin (2012)"},{"key":"9695_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-30891-8_10","volume-title":"The Multivariate Algorithmic Revolution and Beyond\u2014Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday","author":"D. Lokshtanov","year":"2012","unstructured":"Lokshtanov, D., Misra, N., Saurabh, S.: Kernelization\u2014preprocessing with a guarantee. In: The Multivariate Algorithmic Revolution and Beyond\u2014Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol.\u00a07370, pp.\u00a0129\u2013161. Springer, Berlin (2012)"},{"issue":"3","key":"9695_CR27","first-page":"343","volume":"24","author":"H. Moser","year":"2012","unstructured":"Moser, H., Niedermeier, R., Sorge, M.: Exact combinatorial algorithms and experiments for finding maximum k-plexes. J.\u00a0Comb. Optim. 24(3), 343\u2013373 (2012)","journal-title":"J.\u00a0Comb. Optim."},{"key":"9695_CR28","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"9695_CR29","series-title":"Leibniz International Proceedings in Informatics","first-page":"17","volume-title":"Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS\u201910)","author":"R. Niedermeier","year":"2010","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS\u201910), Leibniz International Proceedings in Informatics, vol.\u00a05, pp.\u00a017\u201332. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik, Wadern (2010)"},{"issue":"Supplement\u00a01","key":"9695_CR30","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1136\/sti.78.suppl_1.i159","volume":"78","author":"J. Potterat","year":"2002","unstructured":"Potterat, J., Phillips-Plummer, L., Muth, S., Rothenberg, R., Woodhouse, D., Maldonado-Long, T., Zimmerman, H., Muth, J.: Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs. Sex. Transm. Infect. 78(Supplement\u00a01), 159\u2013163 (2002)","journal-title":"Sex. Transm. Infect."},{"key":"9695_CR31","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/S0895480195280010","volume":"10","author":"S. Ramachandramurthi","year":"1997","unstructured":"Ramachandramurthi, S.: The structure and number of obstructions to treewidth. SIAM J. Discrete Math. 10, 146\u2013157 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"9695_CR32","doi-asserted-by":"crossref","unstructured":"Romm-Livermore, C., Setzekorn, K.: Social networking communities and e-dating services: concepts and implications. Information Science Reference (2008)","DOI":"10.4018\/978-1-60566-104-9"},{"issue":"1","key":"9695_CR33","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S. Seidman","year":"1978","unstructured":"Seidman, S., Foster, B.: A\u00a0graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"issue":"2","key":"9695_CR34","doi-asserted-by":"crossref","first-page":"32:1","DOI":"10.1145\/1721837.1721848","volume":"6","author":"S. Thomass\u00e9","year":"2010","unstructured":"Thomass\u00e9, S.: A\u00a04k 2 kernel for feedback vertex set. ACM Trans. Algorithms 6(2), 32:1\u201332:8 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"9695_CR35","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9695-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9695-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9695-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T15:34:36Z","timestamp":1562254476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9695-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,11]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9695"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9695-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,11]]}}}