{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:56:39Z","timestamp":1773392199723,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T00:00:00Z","timestamp":1299628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9391-5","type":"journal-article","created":{"date-parts":[[2011,3,8]],"date-time":"2011-03-08T18:21:25Z","timestamp":1299608485000},"page":"347-373","source":"Crossref","is-referenced-by-count":36,"title":["Exact combinatorial algorithms and experiments for\u00a0finding maximum k-plexes"],"prefix":"10.1007","volume":"24","author":[{"given":"Hannes","family":"Moser","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,9]]},"reference":[{"key":"9391_CR1","first-page":"62","volume-title":"Proc 6th ALENEX","author":"FN Abu-Khzam","year":"2004","unstructured":"Abu-Khzam FN, Collins RL, Fellows MR, Langston MA, Suters WH, Symons CT (2004) Kernelization algorithms for the Vertex Cover problem: Theory and experiments. In: Proc 6th ALENEX. ACM\/SIAM, New York\/Philadelphia, pp 62\u201369"},{"issue":"3","key":"9391_CR2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"FN Abu-Khzam","year":"2007","unstructured":"Abu-Khzam FN, Fellows MR, Langston MA, Suters WH (2007) Crown structures for vertex cover kernelization. Theory Comput Syst 41(3):411\u2013430","journal-title":"Theory Comput Syst"},{"issue":"1","key":"9391_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram B, Butenko S, Trukhanov S (2005) Novel approaches for analyzing biological networks. J\u00a0Comb Optim 10(1):23\u201339","journal-title":"J\u00a0Comb Optim"},{"key":"9391_CR4","author":"B Balasundaram","year":"2009","unstructured":"Balasundaram B, Butenko S, Hicks IV (2009) Clique relaxations in social network analysis: The maximum k-plex problem. Oper Res. doi: 10.1287\/opre.1100.0851 . Available electronically","journal-title":"Oper Res"},{"key":"9391_CR5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s11590-009-0146-5","volume":"4","author":"B Balasundaram","year":"2010","unstructured":"Balasundaram B, Chandramouli S, Trukhanov S (2010) Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes. Optim Lett 4:311\u2013320","journal-title":"Optim Lett"},{"key":"9391_CR6","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/ , accessed January 2009"},{"key":"9391_CR7","unstructured":"Beebe NH (2002) Nelson H.F. Beebe\u2019s bibliographies page. http:\/\/www.math.utah.edu\/~beebe\/bibliographies.html"},{"key":"9391_CR8","author":"R Bevern van","year":"2011","unstructured":"van Bevern R, Moser H, Niedermeier R (2011) Approximation and tidying\u2014a problem kernel for s-plex cluster vertex deletion. Algorithmica. doi: 10.1007\/s00453-011-9492-7 . Available electronically","journal-title":"Algorithmica"},{"key":"9391_CR9","series-title":"LNCS","first-page":"17","volume-title":"Proc 4th IWPEC","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender HL (2009) Kernelization: New upper and lower bound techniques. In: Proc 4th IWPEC. LNCS, vol 5917. Springer, Berlin, pp 17\u201337"},{"key":"9391_CR10","series-title":"LNCS","first-page":"90","volume-title":"Proc 6th AAIM","author":"ZZ Chen","year":"2010","unstructured":"Chen ZZ, Fellows M, Fu B, Jiang H, Liu Y, Wand L, Zhu B (2010) A linear kernel for co-path\/cycle packing. In: Proc 6th AAIM. LNCS, vol 6124. Springer, Berlin, pp 90\u2013102"},{"issue":"3","key":"9391_CR11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1038\/ng1518","volume":"37","author":"EJ Chesler","year":"2005","unstructured":"Chesler EJ, Lu L, Shou S, Qu Y, Gu J, Wang J, Hsu HC, Mountz JD, Baldwin NE, MA Langston, Threadgill DW, Manly KF, Williams RW (2005) Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nat Genet 37(3):233\u2013242","journal-title":"Nat Genet"},{"key":"9391_CR12","series-title":"LNCS","first-page":"88","volume-title":"Proc 4th ISAAC","author":"A Dessmark","year":"1993","unstructured":"Dessmark A, Jansen K, Lingas A (1993) The maximum k-dependent and f-dependent set problem. In: Proc 4th ISAAC. LNCS, vol 762. Springer, Berlin, pp 88\u201397"},{"key":"9391_CR13","unstructured":"DIMACS (1995) Maximum clique, graph coloring, and satisfiability. Second DIMACS implementation challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/ , accessed November 2008"},{"key":"9391_CR14","unstructured":"Djidev H, Garrido O, Levcopoulos C, Lingas A (1992) On the maximum k-dependent set problem. Tech Rep LU-CS-TR:92-91, Department of Computer Science, Lund University, Sweden"},{"key":"9391_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR (1999) Parameterized complexity. Springer, Berlin"},{"key":"9391_CR16","first-page":"409","volume-title":"Proc 26th STACS, IBFI Dagstuhl","author":"MR Fellows","year":"2009","unstructured":"Fellows MR, Guo J, Moser H, Niedermeier R (2009) A generalization of Nemhauser and Trotter\u2019s local optimization theorem. In: Proc 26th STACS, IBFI Dagstuhl, Germany. pp 409\u2013420"},{"key":"9391_CR17","author":"MR Fellows","year":"2010","unstructured":"Fellows MR, Guo J, Moser H, Niedermeier R (2010) A generalization of Nemhauser and Trotter\u2019s local optimization theorem. J Comput Syst Sci. doi: 10.1016\/j.jcss.2010.12.001 . Available electronically","journal-title":"J Comput Syst Sci"},{"key":"9391_CR18","volume-title":"Parameterized complexity theory","author":"J Flum","year":"2006","unstructured":"Flum J, Grohe M (2006) Parameterized complexity theory. Springer, Berlin"},{"key":"9391_CR19","unstructured":"Grossman J, Ion P, Castro RD (2007) The Erd\u0151s number project. http:\/\/www.oakland.edu\/enp\/ , accessed January 2009"},{"issue":"1","key":"9391_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J Guo","year":"2007","unstructured":"Guo J, Niedermeier R (2007) Invitation to data reduction and problem kernelization. SIGACT News 38(1):31\u201345","journal-title":"SIGACT News"},{"key":"9391_CR21","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-02094-0_4","volume-title":"Algorithmics of large and complex networks","author":"J Guo","year":"2009","unstructured":"Guo J, Moser H, Niedermeier R (2009) Iterative compression for exactly solving NP-hard minimization problems. In: Algorithmics of large and complex networks. LNCS, vol 5515. Springer, Berlin, pp 65\u201380"},{"issue":"4","key":"9391_CR22","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1137\/090767285","volume":"24","author":"J Guo","year":"2010","unstructured":"Guo J, Komusiewicz C, Niedermeier R, Uhlmann J (2010) A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM J Discrete Math 24(4):1662\u20131683","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"9391_CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1093\/comjnl\/bxm040","volume":"51","author":"F H\u00fcffner","year":"2008","unstructured":"H\u00fcffner F, Niedermeier R, Wernicke S (2008) Techniques for practical fixed-parameter algorithms. Comput J 51(1):7\u201325","journal-title":"Comput J"},{"issue":"52","key":"9391_CR24","doi-asserted-by":"crossref","first-page":"5384","DOI":"10.1016\/j.tcs.2009.05.008","volume":"410","author":"F H\u00fcffner","year":"2009","unstructured":"H\u00fcffner F, Komusiewicz C, Moser H, Niedermeier R (2009) Isolation concepts for clique enumeration: Comparison and computational experiments. Theor Comput Sci 410(52):5384\u20135397","journal-title":"Theor Comput Sci"},{"key":"9391_CR25","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner F, Komusiewicz C, Moser H, Niedermeier R (2010) Fixed-parameter algorithms for cluster vertex deletion. Theory Comput Syst 47:196\u2013217","journal-title":"Theory Comput Syst"},{"issue":"4","key":"9391_CR26","first-page":"40","volume":"5","author":"H Ito","year":"2009","unstructured":"Ito H, Iwama K (2009) Enumeration of isolated cliques and pseudo-cliques. ACM Trans Algorithms 5(4):40 :1\u201321","journal-title":"ACM Trans Algorithms"},{"key":"9391_CR27","unstructured":"Jones B (2002) Computational geometry database. http:\/\/compgeom.cs.uiuc.edu\/~jeffe\/compgeom\/biblios.html"},{"issue":"38-40","key":"9391_CR28","doi-asserted-by":"crossref","first-page":"3640","DOI":"10.1016\/j.tcs.2009.04.021","volume":"410","author":"C Komusiewicz","year":"2009","unstructured":"Komusiewicz C, H\u00fcffner F, Moser H, Niedermeier R (2009) Isolation concepts for efficiently enumerating dense subgraphs. Theor Comput Sci 410(38-40):3640\u20133654","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9391_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis JM, Yannakakis M (1980) The node-deletion problem for hereditary properties is NP-complete. J\u00a0Comput Syst Sci 20(2):219\u2013230","journal-title":"J\u00a0Comput Syst Sci"},{"key":"9391_CR30","author":"B McClosky","year":"2010","unstructured":"McClosky B, Hicks IV (2010) Combinatorial algorithms for the maximum k-plex problem. J Comb Optim. doi: 10.1007\/s10878-010-9338-2 . Available electronically","journal-title":"J Comb Optim"},{"key":"9391_CR31","unstructured":"Moser H (2009) Finding optimal solutions for covering and matching problems. PhD thesis, Institut f\u00fcr Informatik, Friedrich-Schiller Universit\u00e4t, Jena"},{"key":"9391_CR32","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser GL, Trotter LE (1975) Vertex packings: Structural properties and algorithms. Math Program 8:232\u2013248","journal-title":"Math Program"},{"key":"9391_CR33","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford University Press, London"},{"issue":"3\u20134","key":"9391_CR34","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R Niedermeier","year":"2000","unstructured":"Niedermeier R, Rossmanith P (2000) A general method to speed up fixed-parameter-tractable algorithms. Inf Process Lett 73(3\u20134):125\u2013129","journal-title":"Inf Process Lett"},{"issue":"1\u20133","key":"9391_CR35","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.dam.2005.02.029","volume":"152","author":"N Nishimura","year":"2005","unstructured":"Nishimura N, Ragde P, Thilikos DM (2005) Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. Discrete Appl Math 152(1\u20133):229\u2013245","journal-title":"Discrete Appl Math"},{"issue":"1\u20133","key":"9391_CR36","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd PRJ (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120(1\u20133):197\u2013207","journal-title":"Discrete Appl Math"},{"issue":"2","key":"9391_CR37","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/ijoc.8.2.103","volume":"8","author":"LA Sanchis","year":"1996","unstructured":"Sanchis LA, Jagota A (1996) Some experimental and theoretical results on test case generators for the maximum clique problem. INFORMS J Comput 8(2):103\u2013117","journal-title":"INFORMS J Comput"},{"key":"9391_CR38","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph-theoretic generalization of the clique concept. J Math Sociol 6:139\u2013154","journal-title":"J Math Sociol"},{"key":"9391_CR39","unstructured":"Trukhanov S (2008) Novel approaches for solving large-scale optimization problems on graphs. PhD thesis, A&M Universtity, Texas"},{"key":"9391_CR40","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","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 (2007) A parallel algorithm for enumerating all the maximal k-plexes. In: Emerging technologies in knowledge discovery and data mining. Lecture notes in artificial intelligence, vol 4819. Springer, Berlin, pp 476\u2013483"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9391-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9391-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9391-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9391-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,9]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9391"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9391-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,9]]}}}