{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:06:46Z","timestamp":1725732406378},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40988-2_33","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T06:56:40Z","timestamp":1377673000000},"page":"509-524","source":"Crossref","is-referenced-by-count":2,"title":["Detecting Bicliques in GF[q]"],"prefix":"10.1007","author":[{"given":"Jan","family":"Ramon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pauli","family":"Miettinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-03685-9_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N. Alon","year":"2009","unstructured":"Alon, N., Panigrahy, R., Yekhanin, S.: Deterministic Approximation Algorithms for the Nearest Codeword Problem. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol.\u00a05687, pp. 339\u2013351. Springer, Heidelberg (2009)"},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-011-0459-x","volume":"129","author":"B.P.W. Ames","year":"2011","unstructured":"Ames, B.P.W., Vavasis, S.A.: Nuclear norm minimization for the planted clique and biclique problems. Math. Program. B\u00a0129(1), 69\u201389 (2011)","journal-title":"Math. Program. B"},{"key":"33_CR3","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. In: FOCS 1993, pp. 724\u2013733 (1993)"},{"key":"33_CR4","unstructured":"Berman, P., Karpinski, M.: Approximating minimum unsatisfiability of linear equations. In: SODA 2002, pp. 514\u2013516 (January 2002)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM, pp. 251\u2013262 (1999)","DOI":"10.1145\/316194.316229"},{"issue":"1","key":"33_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.1998.0964","volume":"29","author":"D.S. Hochbaum","year":"1998","unstructured":"Hochbaum, D.S.: Approximating clique and biclique problems. J. Algorithm\u00a029(1), 174\u2013200 (1998)","journal-title":"J. Algorithm"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Koyut\u00fcrk, M., Grama, A.: PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets. In: KDD 2003, pp. 147\u2013156 (2003)","DOI":"10.1145\/956755.956770"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-1-4419-6045-0_10","volume-title":"Managing and Mining Graph Data","author":"V.E. Lee","year":"2010","unstructured":"Lee, V.E., Ruan, N., Jin, R., Aggarwal, C.: A Survey of Algorithms for Dense Subgraph Discovery. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 303\u2013336. Springer, New York (2010)"},{"key":"33_CR9","first-page":"985","volume":"11","author":"J. Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J.M., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: An approach to modeling networks. J. Mach. Learn. Res.\u00a011, 985\u20131042 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"10","key":"33_CR10","first-page":"1348","volume":"20","author":"P. Miettinen","year":"2008","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE TKDE\u00a020(10), 1348\u20131362 (2008)","journal-title":"IEEE TKDE"},{"issue":"3","key":"33_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R. Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math.\u00a0131(3), 651\u2013654 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"33_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/sam.10051","volume":"2","author":"K. Sim","year":"2009","unstructured":"Sim, K., Li, J., Gopalkrishnan, V., Liu, G.: Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks. Statistical Analysis and Data Mining\u00a02(4), 255\u2013273 (2009)","journal-title":"Statistical Analysis and Data Mining"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.mbs.2011.02.003","volume":"231","author":"M.E. Wall","year":"2011","unstructured":"Wall, M.E.: Structure\u2013function relations are subtle in genetic regulatory networks. Math. Bioscience\u00a0231(1), 61\u201368 (2011)","journal-title":"Math. Bioscience"},{"issue":"16","key":"33_CR14","doi-asserted-by":"publisher","first-page":"5934","DOI":"10.1073\/pnas.0306752101","volume":"101","author":"E. Yeger-Lotem","year":"2004","unstructured":"Yeger-Lotem, E., Sattath, S., Kashtan, N., Itzkovitz, S., Milo, R., Pinter, R.Y., Alon, U., Margalit, H.: Network motifs in integrated cellular networks of transcriptionregulation and proteinprotein interaction. PNAS\u00a0101(16), 5934\u20135939 (2004)","journal-title":"PNAS"},{"issue":"1","key":"33_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s10618-009-0145-2","volume":"20","author":"Z.-Y. Zhang","year":"2010","unstructured":"Zhang, Z.-Y., Li, T., Ding, C., Ren, X.-W., Zhang, X.-S.: Binary matrix factorization for analyzing gene expression data. Data Min. Knowl. Disc.\u00a020(1), 28\u201352 (2010)","journal-title":"Data Min. Knowl. Disc."}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40988-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:25:57Z","timestamp":1558034757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40988-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40988-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}