{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:06Z","timestamp":1759638486489},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_22","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T10:50:58Z","timestamp":1346237458000},"page":"231-241","source":"Crossref","is-referenced-by-count":11,"title":["Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs"],"prefix":"10.1007","author":[{"given":"Sepp","family":"Hartung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"R. Alba","year":"1973","unstructured":"Alba, R.: A graph-theoretic definition of a sociometric clique. J. Math. Sociol.\u00a03(1), 113\u2013126 (1973)","journal-title":"J. Math. Sociol."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-642-12200-2_53","volume-title":"LATIN 2010: Theoretical Informatics","author":"Y. Asahiro","year":"2010","unstructured":"Asahiro, Y., Miyano, E., Samizo, K.: Approximating Maximum Diameter-Bounded Subgraphs. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 615\u2013626. Springer, Heidelberg (2010)"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B. Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., Trukhanovzu, S.: Novel approaches for analyzing biological networks. J. Comb. Optim.\u00a010(1), 23\u201339 (2005)","journal-title":"J. Comb. Optim."},{"issue":"35","key":"22_CR4","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci.\u00a0412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J.-M. Bourjolly","year":"2002","unstructured":"Bourjolly, J.-M., Laporte, G., Pesant, G.: An exact algorithm for the maximum k-club problem in an undirected graph. European J. Oper. Res.\u00a0138(1), 21\u201328 (2002)","journal-title":"European J. Oper. Res."},{"key":"22_CR6","unstructured":"Chang, M.S., Hung, L.J., Lin, C.R., Su, P.C.: Finding large k-clubs in undirected graphs. In: Proc. 28th Workshop on Combinatorial Mathematics and Computation Theory (2011)"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00224-010-9270-y","volume":"48","author":"Y. Chen","year":"2011","unstructured":"Chen, Y., Flum, J., M\u00fcller, M.: Lower bounds for kernelizations and other preprocessing procedures. Theory Comput. Syst.\u00a048(4), 803\u2013839 (2011)","journal-title":"Theory Comput. Syst."},{"key":"22_CR8","unstructured":"DIMACS. Graph partitioning and graph clustering (2012), \n                  \n                    http:\/\/www.cc.gatech.edu\/dimacs10\/\n                  \n                  \n                 (accessed April 2012)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"22_CR10","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"M. Gendreau","year":"1993","unstructured":"Gendreau, M., Soriano, P., Salvail, L.: Solving the maximum clique problem using a tabu search approach. Ann. Oper. Res.\u00a041(4), 385\u2013403 (1993)","journal-title":"Ann. Oper. Res."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A.: On structural parameterizations for the 2-club problem (manuscript, June 2012)","DOI":"10.1007\/978-3-642-35843-2_21"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J.\u00a0Comput. System Sci.\u00a063(4), 512\u2013530 (2001)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"22_CR14","first-page":"41","volume":"105","author":"D. Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bulletin of the EATCS\u00a0105, 41\u201372 (2011)","journal-title":"Bulletin of the EATCS"},{"key":"22_CR15","unstructured":"Mahdavi, F., Balasundaram, B.: On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discrete Optim. (to appear, 2012)"},{"key":"22_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/11811305_113","volume-title":"Advanced Data Mining and Applications","author":"N. Memon","year":"2006","unstructured":"Memon, N., Larsen, H.L.: Structural Analysis and Mathematical Methods for Destabilizing Terrorist Networks Using Investigative Data Mining. In: Li, X., Za\u00efane, O.R., Li, Z.-h. (eds.) ADMA 2006. LNCS (LNAI), vol.\u00a04093, pp. 1037\u20131048. Springer, Heidelberg (2006)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R.J. Mokken","year":"1979","unstructured":"Mokken, R.J.: Cliques, Clubs and Clans. Quality and Quantity\u00a013, 161\u2013173 (1979)","journal-title":"Quality and Quantity"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-78757-0_14","volume-title":"Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics","author":"S. Pasupuleti","year":"2008","unstructured":"Pasupuleti, S.: Detection of Protein Complexes in Protein Interaction Networks Using n-Clubs. In: Marchiori, E., Moore, J.H. (eds.) EvoBIO 2008. LNCS, vol.\u00a04973, pp. 153\u2013164. Springer, Heidelberg (2008)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett.\u00a06(5) (2012)","DOI":"10.1007\/s11590-011-0311-5"},{"key":"22_CR21","unstructured":"Sch\u00e4fer, A.: Exact algorithms for s-club finding and related problems. Diploma thesis, Friedrich-Schiller-Universit\u00e4t Jena (2009)"},{"key":"22_CR22","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. J.\u00a0Math. Sociol.\u00a06, 139\u2013154 (1978)","journal-title":"J.\u00a0Math. Sociol."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33293-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:03:27Z","timestamp":1620129807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}