{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:08:35Z","timestamp":1725826115393},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221762"},{"type":"electronic","value":"9783319221779"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_16","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"202-213","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Complexity of a Bi-objective Hypergraph Transversal Problem"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Etienne","family":"Birmel\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Mary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Picchetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"issue":"45","key":"16_CR1","doi-asserted-by":"publisher","first-page":"4534","DOI":"10.1016\/j.tcs.2009.08.017","volume":"410","author":"E Angel","year":"2009","unstructured":"Angel, E., Bampis, E., Gourv\u00e8s, L.: On the minimum hitting set of bundles problem. Theoret. Comput. Sci. 410(45), 4534\u20134542 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR2","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North-Holland, Amsterdam (1989)"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1093\/nar\/gku1290","volume":"43","author":"D Bertrand","year":"2015","unstructured":"Bertrand, D., Chng, K.R., Sherbaf, F.G., Kiesel, A., Chia, B.K.H., Sia, Y.Y., Huang, S.K., Hoon, D.S.B., Liu, T., Hillmer, A., Hillmer, A., Nagarajan, N.: Patient-specific driver gene prediction and risk assessment through integrated network analysis of cancer omics profiles. Nucleic Acids Res. 43(3), 1332\u20131344 (2015)","journal-title":"Nucleic Acids Res."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1142\/S0129626400000251","volume":"10","author":"E Boros","year":"2000","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Process. Lett. 10, 253\u2013266 (2000)","journal-title":"Parallel Process. Lett."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/3-540-45022-X_50","volume-title":"Automata, Languages and Programming","author":"E Boros","year":"2000","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: Generating partial and multiple transversals of a hypergraph. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 588\u2013599. Springer, Heidelberg (2000)"},{"issue":"2012","key":"16_CR6","first-page":"1","volume":"36","author":"P Damaschke","year":"2013","unstructured":"Damaschke, P.: Parameterizations of hitting set of bundles and inverse scope. J. Comb. Optim. 36(2012), 1\u201312 (2013)","journal-title":"J. Comb. Optim."},{"issue":"6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549\u2013564. Springer, Heidelberg (2002)"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32(2), 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"16_CR10","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","volume":"156","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: a brief survey. Discrete Appl. Math. 156(11), 2035\u20132049 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","volume":"96\u201397","author":"V Gurvich","year":"1999","unstructured":"Gurvich, V., Khachiyan, L.: On generating the irredundant conjunctive and disjunctive normal forms of monotone boolean functions. Discrete Appl. Math. 96\u201397, 363\u2013373 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ymben.2010.12.004","volume":"13","author":"O H\u00e4dicke","year":"2011","unstructured":"H\u00e4dicke, O., Klamt, S.: Computing complex metabolic intervention strategies using constrained minimal cut sets. Metab. Eng. 13(2), 204\u2013213 (2011)","journal-title":"Metab. Eng."},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1089\/cmb.2007.0229","volume":"15","author":"U-U Haus","year":"2008","unstructured":"Haus, U.-U., Klamt, S., Stephen, T.: Computing knock-out strategies in metabolic networks. J. Comput. Biol. 15(3), 259\u2013268 (2008)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-14-318","volume":"14","author":"C Jungreuthmayer","year":"2013","unstructured":"Jungreuthmayer, C., Nair, G., Klamt, S., Zanghellini, J.: Comparison and improvement of algorithms for computing minimal cut sets. BMC Bioinf. 14(1), 318 (2013)","journal-title":"BMC Bioinf."},{"issue":"16","key":"16_CR16","doi-asserted-by":"publisher","first-page":"2350","DOI":"10.1016\/j.dam.2006.04.012","volume":"154","author":"L Khachiyan","year":"2006","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V.: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discrete Appl. Math. 154(16), 2350\u20132372 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ipl.2006.09.006","volume":"101","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V.: A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4), 148\u2013155 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"02","key":"16_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1142\/S0129626407002934","volume":"17","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Gurvich, V., Elbassioni, K.: Computing many independent sets for hypergraphs in parallel. Parallel Process. Lett. 17(02), 141\u2013152 (2007)","journal-title":"Parallel Process. Lett."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.dam.2014.01.012","volume":"170","author":"K Murakami","year":"2014","unstructured":"Murakami, K., Uno, T.: Efficient algorithms for dualizing large-scale hypergraphs. Discrete Appl. Math. 170, 83\u201394 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"TK Sellis","year":"1988","unstructured":"Sellis, T.K.: Multiple-query optimization. ACM Trans. Database Sys. 13(1), 23\u201352 (1988)","journal-title":"ACM Trans. Database Sys."},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-38527-8_10","volume-title":"Experimental Algorithms","author":"T Toda","year":"2013","unstructured":"Toda, T.: Hypergraph transversal computation with binary decision diagrams. In: Demetrescu, C., Marchetti-Spaccamela, A., Bonifaci, V. (eds.) SEA 2013. LNCS, vol. 7933, pp. 91\u2013102. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:47:29Z","timestamp":1559227649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}