{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:04Z","timestamp":1748461204065,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_6","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"68-81","source":"Crossref","is-referenced-by-count":7,"title":["Graph Partitioning for Independent Sets"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Lamm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast Local Search for the Maximum Independent Set Problem. J. Heuristics 18(4), 525\u2013547 (2012)","journal-title":"J. Heuristics"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Ph.D thesis (1996)","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T., Khuri, S.: An evolutionary heuristic for the maximum independent set problem. In: Proc. 1st IEEE Conf. on Evolutionary Computation, pp. 531\u2013535. IEEE (1994)","DOI":"10.1109\/ICEC.1994.350004"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bader, D., Kappes, A., Meyerhenke, H., Sanders, P., Schulz, C., Wagner, D.: Benchmarking for graph clustering and partitioning. In: Encyclopedia of Social Network Analysis and Mining. Springer (2014)","DOI":"10.1007\/978-1-4614-6170-8_23"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R Battiti","year":"2001","unstructured":"Battiti, R., Protasi, M.: Reactive Local Search for the Maximum Clique Problem. Algorithmica 29(4), 610\u2013637 (2001)","journal-title":"Algorithmica"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-36605-9_15","volume-title":"Applications of Evolutionary Computing","author":"PA Borisovsky","year":"2003","unstructured":"Borisovsky, P.A., Zavolovskaya, M.S.: Experimental comparison of two evolutionary algorithms for the independent set problem. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 154\u2013164. Springer, Heidelberg (2003)"},{"key":"6_CR7","unstructured":"Davis, T.: The University of Florida Sparse Matrix Collection"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"De Jong, K.A.: Evolutionary Computation: A Unified Approach. MIT Press (2006)","DOI":"10.1145\/1274000.1274109"},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research 42(5), 860\u2013878 (1994)","journal-title":"Operations Research"},{"key":"6_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-45030-3_39","volume-title":"Algorithms and Computation","author":"A Gemsa","year":"2013","unstructured":"Gemsa, A., Niedermann, B., N\u00f6llenburg, M.: Trajectory-based dynamic map labeling. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 413\u2013423. Springer, Heidelberg (2013)"},{"key":"6_CR12","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley (1989)"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/B:HEUR.0000026264.51747.7f","volume":"10","author":"A Grosso","year":"2004","unstructured":"Grosso, A., Locatelli, M., Della Croce, F.: Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. J. Heuristics 10(2), 135\u2013152 (2004)","journal-title":"J. Heuristics"},{"issue":"6","key":"6_CR14","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A Grosso","year":"2008","unstructured":"Grosso, A., Locatelli, M., Pullan, W.: Simple Ingredients Leading to Very Efficient Heuristics for the Maximum Clique Problem. J. Heuristics 14(6), 587\u2013612 (2008)","journal-title":"J. Heuristics"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.dam.2003.09.012","volume":"145","author":"P Hansen","year":"2004","unstructured":"Hansen, P., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable Neighborhood Search for the Maximum Clique. Discrete Applied Mathematics 145(1), 117\u2013125 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"6_CR16","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ipl.2005.05.010","volume":"95","author":"K Katayama","year":"2005","unstructured":"Katayama, K., Hamamoto, A., Narihisa, H.: An Effective Local Search for the Maximum Clique Problem. Inf. Proc. Letters 95(5), 503\u2013511 (2005)","journal-title":"Inf. Proc. Letters"},{"key":"6_CR17","unstructured":"Lamm, S.: Evolutionary Algorithms for Independent Sets. Bachelor\u2019s Thesis, KIT (2014)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Lamm, S., Sanders, P., Schulz, C.: Graph Partitioning for Independent Sets. Technical Report arxiv:1502.01687 (2015)","DOI":"10.1007\/978-3-319-20086-6_6"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-3-319-07959-2_30","volume-title":"Experimental Algorithms","author":"H Meyerhenke","year":"2014","unstructured":"Meyerhenke, H., Sanders, P., Schulz, C.: Partitioning complex networks via size-constrained clustering. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 351\u2013363. Springer, Heidelberg (2014)"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/evco.1996.4.2.113","volume":"4","author":"BL Miller","year":"1996","unstructured":"Miller, B.L., Goldberg, D.E.: Genetic Algorithms, Tournament Selection, and the Effects of Noise. Evolutionary Computation 4(2), 113\u2013131 (1996)","journal-title":"Evolutionary Computation"},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"WJ Pullan","year":"2006","unstructured":"Pullan, W.J., Hoos, H.H.: Dynamic Local Search for the Maximum Clique Problem. J. Artif. Intell. Res. (JAIR) 25, 159\u2013185 (2006)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"6_CR22","unstructured":"Sanders, P., Schulz, C.: KaHIP - Karlsruhe High Qualtity Partitioning Homepage. http:\/\/algo2.iti.kit.edu\/documents\/kahip\/index.html"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-38527-8_16","volume-title":"Experimental Algorithms","author":"P Sanders","year":"2013","unstructured":"Sanders, P., Schulz, C.: Think locally, act globally: highly balanced graph partitioning. In: Demetrescu, C., Marchetti-Spaccamela, A., Bonifaci, V. (eds.) SEA 2013. LNCS, vol. 7933, pp. 164\u2013175. Springer, Heidelberg (2013)"},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"AJ Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning. J. of Global Optimization 29(2), 225\u2013241 (2004)","journal-title":"J. of Global Optimization"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:05:48Z","timestamp":1748459148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}