{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:42Z","timestamp":1742913942720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_36","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"428-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Complexity of Asynchronous Border Minimization"],"prefix":"10.1007","author":[{"given":"Robert","family":"Ganian","sequence":"first","affiliation":[]},{"given":"Martin","family":"Kronegger","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Pfandler","sequence":"additional","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"6","key":"36_CR1","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theor. Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theor. Comput. Syst."},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1158\/0008-5472.CAN-04-2962","volume":"66","author":"M Chatterjee","year":"2006","unstructured":"Chatterjee, M., Mohapatra, S., Ionan, A., Bawa, G., Ali-Fehmi, R., Wang, X., Nowak, J., Ye, B., Nahhas, F.A., Lu, K., Witkin, S.S., Fishman, D., Munkarah, A., Morris, R., Levin, N.K., Shirley, N.N., Tromp, G., Abrams, J., Draghici, S., Tainsky, M.A.: Diagnostic markers of ovarian cancer by high-throughput antigen cloning and detection on arrays. Cancer Res. 66(2), 1181\u20131190 (2006)","journal-title":"Cancer Res."},{"key":"36_CR3","series-title":"Methods in Molecular Biology","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-60327-394-7","volume-title":"Peptide Microarrays Methods and Protocols","author":"M Cretich","year":"2009","unstructured":"Cretich, M., Chiari, M.: Peptide Microarrays Methods and Protocols. Methods in Molecular Biology, vol. 570. Humana Press, New York (2009)"},{"key":"36_CR4","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"36_CR5","unstructured":"Feldmann, A. E.: Balanced partitions of grids and related graphs. Ph.D. thesis, ETH Z\u00fcrich (2012)"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2013.03.014","volume":"485","author":"AE Feldmann","year":"2013","unstructured":"Feldmann, A.E.: Fast balanced partitioning is hard even on grids and trees. Theor. Comput. Sci. 485, 61\u201368 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"issue":"2","key":"36_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0890-5401(03)00161-5","volume":"187","author":"J Flum","year":"2003","unstructured":"Flum, J., Grohe, M.: Describing parameterized complexity classes. Inf. Comput. 187(2), 291\u2013319 (2003)","journal-title":"Inf. Comput."},{"key":"36_CR9","series-title":"Texts in Theoretical Computer Science. An EATCS Series","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, vol. XIV. Springer, Berlin (2006)"},{"issue":"4995","key":"36_CR10","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1126\/science.1990438","volume":"251","author":"S Fodor","year":"1991","unstructured":"Fodor, S., Read, J.L., Pirrung, M.C., Stryer, L., Lu, A.T., Solas, D.: Light-directed, spatially addressable parallel chemical synthesis. Science 251(4995), 767\u2013773 (1991)","journal-title":"Science"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"issue":"5","key":"36_CR12","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S0968-0004(99)01382-1","volume":"24","author":"D Gerhold","year":"1999","unstructured":"Gerhold, D., Rushmore, T., Caskey, C.T.: DNA chips: promising toys have become powerful tools. Trends Biochem. Sci. 24(5), 168\u2013173 (1999)","journal-title":"Trends Biochem. Sci."},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra","year":"1983","unstructured":"Lenstra, H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-79228-4_36","volume-title":"Theory and Applications of Models of Computation","author":"CY Li","year":"2008","unstructured":"Li, C.Y., Wong, P.W.H., Xin, Q., Yung, F.C.C.: Approximating border length for DNA microarray synthesis. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 410\u2013422. Springer, Heidelberg (2008)"},{"issue":"12","key":"36_CR16","doi-asserted-by":"publisher","first-page":"4099","DOI":"10.1158\/0008-5472.CAN-03-3807","volume":"64","author":"C Melle","year":"2004","unstructured":"Melle, C., Ernst, G., Schimmel, B., Bleul, A., Koscielny, S., Wiesner, A., Bogumil, R., M\u00f6ller, U., Osterloh, D., Halbhuber, K.-J., von Eggeling, F.: A technical triade for proteomic identification and characterization of cancer biomarkers. Cancer Res. 64(12), 4099\u20134104 (2004)","journal-title":"Cancer Res."},{"key":"36_CR17","series-title":"LNCS","first-page":"164","volume-title":"TAMC 2012","author":"A Popa","year":"2012","unstructured":"Popa, A., Wong, P.W.H., Yung, F.C.C.: Hardness and approximation of the asynchronous border minimization problem. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 164\u2013176. Springer, Heidelberg (2012)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Slonim, D.K., Tamayo, P., Mesirov, J.P., Golub, T.R., Lander, E.S.: Class prediction and discovery using gene expression data. In: Proceedings of Fourth RECOMB, pp. 263\u2013272 (2000)","DOI":"10.1145\/332306.332564"},{"issue":"6","key":"36_CR19","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1073\/pnas.0530278100","volume":"100","author":"JB Welsh","year":"2003","unstructured":"Welsh, J.B., Sapinoso, L.M., Kern, S.G., Brown, D.A., Liu, T., Bauskin, A.R., Ward, R.L., Hawkins, N.J., Quinn, D.I., Russell, P.J., Sutherland, R.L., Breit, S.N., Moskaluk, C.A., Frierson Jr., H.F., Hampton, G.M.: Large-scale delineation of secreted protein biomarkers overexpressed in cancer tissue and serum. PNAS 100(6), 3410\u20133415 (2003)","journal-title":"PNAS"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:37:56Z","timestamp":1676939876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}