{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:40:39Z","timestamp":1725532839885},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020100"},{"type":"electronic","value":"9783642020117"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02011-7_22","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T05:12:20Z","timestamp":1243919540000},"page":"233-244","source":"Crossref","is-referenced-by-count":10,"title":["Algorithms and Experiments for Clique Relaxations\u2014Finding Maximum s-Plexes"],"prefix":"10.1007","author":[{"given":"Hannes","family":"Moser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"F.N. Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theory Comput. Syst.\u00a041(3), 411\u2013430 (2007)","journal-title":"Theory Comput. Syst."},{"key":"22_CR2","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V., Sachdeva, S.: Clique relaxations in social network analysis: The maximum k-plex problem (February 2008) (manuscript), \n                  \n                    http:\/\/iem.okstate.edu\/baski\/files\/kplex4web.pdf"},{"key":"22_CR3","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets (2006), \n                  \n                    http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/\n                  \n                  \n                 (accessed, January 2009)"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1038\/ng1518","volume":"37","author":"E.J. Chesler","year":"2005","unstructured":"Chesler, E.J., et al.: Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nat. Genet.\u00a037(3), 233\u2013242 (2005)","journal-title":"Nat. Genet."},{"key":"22_CR5","unstructured":"DIMACS. Maximum clique, graph coloring, and satisfiability. Second DIMACS implementation challenge (1995), \n                  \n                    http:\/\/dimacs.rutgers.edu\/Challenges\/\n                  \n                  \n                 (accessed, November 2008)"},{"key":"22_CR6","first-page":"409","volume-title":"Proc. 26th STACS","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhauser and Trotter\u2019s local optimization theorem. In: Proc. 26th STACS, Germany, pp. 409\u2013420. IBFI Dagstuhl, Germany (2009)"},{"key":"22_CR7","unstructured":"Grossman, J., Ion, P., Castro, R.D.: The Erd\u0151s number project (2007), \n                  \n                    http:\/\/www.oakland.edu\/enp\/\n                  \n                  \n                 (accessed, January 2009)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-73545-8_16","volume-title":"Computing and Combinatorics","author":"C. Komusiewicz","year":"2007","unstructured":"Komusiewicz, C., H\u00fcffner, F., Moser, H., Niedermeier, R.: Isolation concepts for enumerating dense subgraphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 140\u2013150. Springer, Heidelberg (2007)"},{"key":"22_CR9","unstructured":"McClosky, B., Hicks, I.V.: Combinatorial algorithms for the maximum k-plex problem (January 2009) (manuscript), \n                  \n                    http:\/\/www.caam.rice.edu\/~bjm4\/CombiOptPaper.pdf"},{"key":"22_CR10","doi-asserted-by":"publisher","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)"},{"issue":"1-3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.dam.2005.02.029","volume":"152","author":"N. Nishimura","year":"2005","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. Discrete Appl. Math.\u00a0152(1-3), 229\u2013245 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"1-3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math.\u00a0120(1-3), 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/ijoc.8.2.87","volume":"8","author":"L.A. Sanchis","year":"1996","unstructured":"Sanchis, L.A., Jagota, A.: Some experimental and theoretical results on test case generators for the maximum clique problem. INFORMS J. Comput.\u00a08(2), 103\u2013117 (1996)","journal-title":"INFORMS J. Comput."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S.B. Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. Journal of Mathematical Sociology\u00a06, 139\u2013154 (1978)","journal-title":"Journal of Mathematical Sociology"},{"key":"22_CR15","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-77018-3_47","volume-title":"Emerging Technologies in Knowledge Discovery and Data Mining","author":"B. Wu","year":"2007","unstructured":"Wu, B., Pei, X.: A parallel algorithm for enumerating all the maximal k-plexes. In: Washio, T., Zhou, Z.-H., Huang, J.Z., Hu, X., Li, J., Xie, C., He, J., Zou, D., Li, K.-C., Freire, M.M. (eds.) PAKDD 2007. LNCS (LNAI), vol.\u00a04819, pp. 476\u2013483. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02011-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T07:48:26Z","timestamp":1552031306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02011-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020100","9783642020117"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02011-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}