{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:16:50Z","timestamp":1725733010927},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390708"},{"type":"electronic","value":"9783642390715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39071-5_14","type":"book-chapter","created":{"date-parts":[[2013,6,23]],"date-time":"2013-06-23T21:23:17Z","timestamp":1372022597000},"page":"182-191","source":"Crossref","is-referenced-by-count":13,"title":["Community-Based Partitioning for MaxSAT Solving"],"prefix":"10.1007","author":[{"given":"Ruben","family":"Martins","sequence":"first","affiliation":[]},{"given":"Vasco","family":"Manquinho","sequence":"additional","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Coudert, O.: On Solving Covering Problems. In: Proceedings of the Design Automation Conference, pp. 197\u2013202 (June 1996)","DOI":"10.1145\/240518.240555"},{"key":"14_CR2","unstructured":"Martins, R., Manquinho, V., Lynce, I.: On Partitioning for Maximum Satisfiability. In: European Conference on Artificial Intelligence, pp. 913\u2013914 (2012)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z. Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On Solving the Partial MAX-SAT Problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 252\u2013265. Springer, Heidelberg (2006)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02777-2_39","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"C. Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 427\u2013440. Springer, Heidelberg (2009)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-02777-2_45","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"V. Manquinho","year":"2009","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for Weighted Boolean Optimization. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 495\u2013508. Springer, Heidelberg (2009)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M., Levy, J.: A New Algorithm for Weighted Partial MaxSAT. In: AAAI Conference on Artificial Intelligence, pp. 3\u20138 (2010)","DOI":"10.1609\/aaai.v24i1.7545"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Heras, F., Morgado, A., Marques-Silva, J.: Core-Guided Binary Search Algorithms for Maximum Satisfiability. In: AAAI Conference on Artificial Intelligence, pp. 36\u201341 (2011)","DOI":"10.1609\/aaai.v25i1.7822"},{"issue":"1\/2","key":"14_CR8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/SAT190090","volume":"8","author":"M. Janota","year":"2012","unstructured":"Janota, M., Lynce, I., Manquinho, V., Marques-Silva, J.: PackUp: Tools for Package Upgradability Solving. Journal on Satisfiability, Boolean Modeling and Computation\u00a08(1\/2), 89\u201394 (2012)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"14_CR9","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, Hard and Soft Constraints. In: Handbook of Satisfiability, pp. 613\u2013631. IOS Press (2009)"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/SAT190091","volume":"8","author":"M. Koshimura","year":"2012","unstructured":"Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: A Partial Max-SAT Solver. Journal on Satisfiability, Boolean Modeling and Computation\u00a08, 95\u2013100 (2012)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-33558-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"C. Ans\u00f3tegui","year":"2012","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Gab\u00e0s, J., Levy, J.: Improving SAT-Based Weighted MaxSAT Solvers. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 86\u2013101. Springer, Heidelberg (2012)"},{"issue":"1-2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1006\/inco.1999.2860","volume":"162","author":"T.J. Park","year":"2000","unstructured":"Park, T.J., Gelder, A.V.: Partitioning Methods for Satisfiability Testing on Large Formulas. Information and Computation\u00a0162(1-2), 179\u2013184 (2000)","journal-title":"Information and Computation"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: Application in VLSI domain. IEEE Transactions on VLSI Systems\u00a07, 69\u201379 (1999)","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-31612-8_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"C. Ans\u00f3tegui","year":"2012","unstructured":"Ans\u00f3tegui, C., Gir\u00e1ldez-Cru, J., Levy, J.: The Community Structure of SAT Formulas. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol.\u00a07317, pp. 410\u2013423. Springer, Heidelberg (2012)"},{"issue":"12","key":"14_CR15","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69(026113) (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"issue":"9","key":"14_CR17","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F. Radicchi","year":"2004","unstructured":"Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America\u00a0101(9), 2658\u20132663 (2004)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"14_CR18","unstructured":"Brandes, U., Delling, D., Gaertler, M., Goerke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: Maximizing modularity is hard. arXiv: physics, 0608255 (2006)"},{"issue":"6","key":"14_CR19","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70(6), 066111 (2004)","journal-title":"Physical Review E"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P. Pons","year":"2006","unstructured":"Pons, P., Latapy, M.: Computing Communities in Large Networks Using Random Walks. Journal of Graph Algorithms and Applications\u00a010(2), 191\u2013218 (2006)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Blondel, V., Guillaume, J., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics 2008(10), P10008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"issue":"3-4","key":"14_CR22","doi-asserted-by":"crossref","first-page":"363","DOI":"10.3233\/FI-2010-311","volume":"102","author":"A. Morgado","year":"2010","unstructured":"Morgado, A., Marques-Silva, J.: Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem. Fundamenta Informaticae\u00a0102(3-4), 363\u2013389 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"14_CR23","unstructured":"Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: PBS: A backtrack search pseudo Boolean solver. In: Symposium on the Theory and Applications of Satisfiability Testing, pp. 346\u2013353 (2002)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39071-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T10:45:29Z","timestamp":1688294729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39071-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390708","9783642390715"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39071-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}