{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:03Z","timestamp":1740099063453,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319919379"},{"type":"electronic","value":"9783319919386"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91938-6_9","type":"book-chapter","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:04:12Z","timestamp":1526447052000},"page":"103-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem"],"prefix":"10.1007","author":[{"given":"Eugen","family":"Czeizler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Popescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"issue":"6264","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1126\/science.aac7557","volume":"350","author":"V. A. Blomen","year":"2015","unstructured":"Blomen, V.A., et al.: Gene essentiality and synthetic lethality in haploid human cells. Science 350(6264), 1092\u20131096 (2015). \nhttps:\/\/doi.org\/10.1126\/science.aac7557\n\n, \nhttp:\/\/science.sciencemag.org\/content\/350\/6264\/1092","journal-title":"Science"},{"key":"9_CR2","volume-title":"Graph Theory","author":"A Bondy","year":"2011","unstructured":"Bondy, A., Murty, U.: Graph Theory. Springer, Heidelberg (2011). \nhttps:\/\/books.google.ro\/books?id=HuDFMwZOwcsC"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Czeizler, E., et al.: Structural target controllability of linear networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. PP(99), 1 (2018). \nhttps:\/\/doi.org\/10.1109\/TCBB.2018.2797271","DOI":"10.1109\/TCBB.2018.2797271"},{"key":"9_CR4","volume-title":"Parameterized Complexity","author":"RG Downey","year":"2012","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (2012)"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). \nhttps:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"key":"9_CR6","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"5415","DOI":"10.1038\/ncomms6415","volume":"5","author":"J Gao","year":"2014","unstructured":"Gao, J., Liu, Y.Y., D\u2019Souza, R.M., Barab\u00e1si, A.L.: Target control of complex networks. Nat. Commun. 5, 5415 (2014). \nhttps:\/\/doi.org\/10.1038\/ncomms6415","journal-title":"Nat. Commun."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1186\/s12864-017-4332-z","volume":"19","author":"WF Guo","year":"2018","unstructured":"Guo, W.F., et al.: A novel algorithm for finding optimal driver nodes to target control complex networks and its applications for drug targets identification. BMC Genomics 19(1), 924 (2018). \nhttps:\/\/doi.org\/10.1186\/s12864-017-4332-z","journal-title":"BMC Genomics"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Hines, P., Blumsack, S., Sanchez, E.C., Barrows, C.: The topological and electrical structure of power grids. In: 2010 43rd Hawaii International Conference on System Sciences, pp. 1\u201310, January 2010. \nhttps:\/\/doi.org\/10.1109\/HICSS.2010.398","DOI":"10.1109\/HICSS.2010.398"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/0301010","volume":"1","author":"RE Kalman","year":"1963","unstructured":"Kalman, R.E.: Mathematical description of linear dynamical systems. J. Soc. Ind. Appl. Math. Ser. A Control 1(2), 152\u2013192 (1963). \nhttps:\/\/doi.org\/10.1137\/0301010","journal-title":"J. Soc. Ind. Appl. Math. Ser. A Control"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Kanhaiya, K., Czeizler, E., Gratie, C., Petre, I.: Controlling directed protein interaction networks in cancer. Sci. Rep. 7(1), 10327 (2017). \nhttps:\/\/doi.org\/10.1038\/s41598-017-10491-y","DOI":"10.1038\/s41598-017-10491-y"},{"issue":"6366","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.aai7488","volume":"358","author":"A. Li","year":"2017","unstructured":"Li, A., et al.: The fundamental advantages of temporal networks. Science 358(6366), 1042\u20131046 (2017). \nhttps:\/\/doi.org\/10.1126\/science.aai7488\n\n, \nhttp:\/\/science.sciencemag.org\/content\/358\/6366\/1042","journal-title":"Science"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TAC.1974.1100557","volume":"19","author":"C Lin","year":"1974","unstructured":"Lin, C.: Structural controllability. IEEE Trans. Autom. Control 19, 201\u2013208 (1974)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"7346","key":"9_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1038\/nature10011","volume":"473","author":"YY Liu","year":"2011","unstructured":"Liu, Y.Y., Slotine, J.J., Barab\u00e1si, A.L.: Controllability of complex networks. Nature 473(7346), 167\u2013173 (2011). \nhttps:\/\/doi.org\/10.1038\/nature10011","journal-title":"Nature"},{"key":"9_CR15","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61586-3","volume-title":"Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability","author":"K Murota","year":"1987","unstructured":"Murota, K.: Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability. Algorithms and Combinatorics. Springer, Heidelberg (1987). \nhttps:\/\/books.google.fi\/books?id=DkHvAAAAMAAJ"},{"key":"9_CR16","unstructured":"Murota, K., Poljak, S.: Note on a graph-theoretic criterion for structural output controllability. KAM series, discrete mathematics and combinatorics, operations research, mathematical linguistics, Department of Applied Mathematics, Charles University (1989). \nhttps:\/\/books.google.fi\/books?id=5RrPHAAACAAJ"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/9.50361","volume":"35","author":"S Poljak","year":"1990","unstructured":"Poljak, S.: On the generic dimension of controllable subspaces. IEEE Trans. Autom. Control 35(3), 367\u2013369 (1990). \nhttps:\/\/doi.org\/10.1109\/9.50361","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TAC.1976.1101198","volume":"21","author":"R Shields","year":"1976","unstructured":"Shields, R., Pearson, J.: Structural controllability of multiinput linear systems. IEEE Trans. Autom. Control 21(2), 203\u2013212 (1976). \nhttps:\/\/doi.org\/10.1109\/TAC.1976.1101198","journal-title":"IEEE Trans. Autom. Control"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-63890-3_11","volume-title":"Algorithms and Computation","author":"T Uno","year":"1997","unstructured":"Uno, T.: Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In: Leong, H.W., Imai, H., Jain, S. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 92\u2013101. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-63890-3_11"},{"key":"9_CR20","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York, Inc. (2001)"},{"issue":"18","key":"9_CR21","doi-asserted-by":"publisher","first-page":"4976","DOI":"10.1073\/pnas.1603992113","volume":"113","author":"A Vinayagam","year":"2016","unstructured":"Vinayagam, A., et al.: Controllability analysis of the directed human protein interaction network identifies disease genes and drug targets. Proc. Natl. Acad. Sci. 113(18), 4976\u20134981 (2016). \nhttps:\/\/doi.org\/10.1073\/pnas.1603992113","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"6264","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1126\/science.aac7041","volume":"350","author":"T Wang","year":"2015","unstructured":"Wang, T., et al.: Identification and characterization of essential genes in the human genome. Science 350(6264), 1096\u20131101 (2015). \nhttps:\/\/doi.org\/10.1126\/science.aac7041\n\n. \nhttp:\/\/science.sciencemag.org\/content\/350\/6264\/1096","journal-title":"Science"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"74","DOI":"10.3109\/10409238.2015.1117053","volume":"51","author":"Tianzuo Zhan","year":"2015","unstructured":"Zhan, T., Boutros, M.: Towards a compendium of essential genes - from model organisms to synthetic lethality in cancer cells. Crit. Rev. Biochem. Mol. Biol. 51(2), 74\u201385 (2016). \nhttps:\/\/doi.org\/10.3109\/10409238.2015.1117053\n\n, PMID: 26627871","journal-title":"Critical Reviews in Biochemistry and Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91938-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T05:05:52Z","timestamp":1526447152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91938-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319919379","9783319919386"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91938-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}