{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:15:16Z","timestamp":1743052516533,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030106911"},{"type":"electronic","value":"9783030106928"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10692-8_14","type":"book-chapter","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T13:53:20Z","timestamp":1547733200000},"page":"125-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Application of Parallel and Hybrid Metaheuristics for Graph Partitioning Problem"],"prefix":"10.1007","author":[{"given":"Zbigniew","family":"Kokosi\u0144ski","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Pijanowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"volume-title":"Parallel Metaheuristics: A new Class of Algorithms","year":"2005","key":"14_CR1","unstructured":"Alba, E. (ed.): Parallel Metaheuristics: A new Class of Algorithms. Wiley-Interscience, New Jersey (2005)"},{"key":"14_CR2","unstructured":"Chadha, A.: Benchmark Creation for Circuit Partitioning Algorithms. Gauging the Performance of Circuit Partitioning Algorithms. Lambert Academic Publishing (2015)"},{"key":"14_CR3","unstructured":"Chv\u00e1tal, V.: Colouring the queen graphs. \n                      http:\/\/users.encs.concordia.ca\/chvatal\/queengraphs.html"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-81-322-1958-3_3","volume-title":"Application of Evolutionary Algorithms for Multi-objective Optimization in VLSI and Embedded Systems","author":"MC Bhuvaneswari","year":"2015","unstructured":"Bhuvaneswari, M.C., Jagadeeswari, M.: Circuit partitioning for VLSI layout. In: Bhuvaneswari, M.C. (ed.) Application of Evolutionary Algorithms for Multi-objective Optimization in VLSI and Embedded Systems, pp. 37\u201346. Springer, New Delhi (2015). \n                      https:\/\/doi.org\/10.1007\/978-81-322-1958-3_3"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: Proceedings of 2004 SIAM International Conference Data Mining, 2004 (2004). \n                      https:\/\/doi.org\/10.1137\/1.9781611972740_43","DOI":"10.1137\/1.9781611972740_43"},{"key":"14_CR6","unstructured":"COLOR web site. \n                      http:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1020551011615","volume":"23","author":"C Gil","year":"2002","unstructured":"Gil, C., Ortega, J., Montoya, M.G., Banos, R.: A Mixed Heuristic for Circuit Partitioning. Comput. Optim. Appl. 23, 321\u2013340 (2002). \n                      https:\/\/doi.org\/10.1023\/A:1020551011615","journal-title":"Comput. Optim. Appl."},{"key":"14_CR8","series-title":"Contemporary Mathematics","volume-title":"Graph Partitioning and Graph Clustering","year":"2013","unstructured":"Bader, A., et al. (ed.): Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge, Atlanta, 12\u201313 February 2012, vol. 588. AMS, Contemporary Mathematics (2013)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-90-481-9591-6","volume-title":"VLSI Physical Design: From Graph Partitioning to Timing Closure","author":"A Khang","year":"2011","unstructured":"Khang, A., Liening, J., Markov, I., Hu, J.: VLSI Physical Design: From Graph Partitioning to Timing Closure, pp. 33\u201354. Springer, Dordrecht (2011). \n                      https:\/\/doi.org\/10.1007\/978-90-481-9591-6"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristics procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"14_CR11","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-59861-1_6","volume-title":"Recent Advances in Computational Optimization","author":"Z Kokosi\u0144ski","year":"2018","unstructured":"Kokosi\u0144ski, Z., Ba\u0142a, M.: Solving graph partitioning problems with parallel metaheuristics. In: Fidanova, S. (ed.) Recent Advances in Computational Optimization. SCI, vol. 717, pp. 89\u2013105. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-59861-1_6"},{"key":"14_CR12","unstructured":"Kozie\u0142, S., Szcz\u0229\u015bniak, W.: Evolutionary algorithm for electronic system partitioning and its applications in VLSI design. In: Proceedings of 6th IEEE International Conference on Electronics, Circuits and Systems, ICECS 1999, Pafos, Cyprus, 5\u20138 September 1999, vol. 3, pp. 1412\u20131414 (1999)"},{"key":"14_CR13","unstructured":"Sadiq, S., Habib, Y.: Iterative Computer Algorithms with Applications in Engineering. Solving Combinatorial Optimization Problems. Wiley - IEEE Computer Society Press (2000)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.procs.2015.04.203","volume":"48","author":"RR Swethaa","year":"2015","unstructured":"Swethaa, R.R., Devi, K.A.S., Yousef, S.: Hybrid partitioning algorithm for area minimization in circuits. Procedia Comput. Sci. 48, 692\u2013698 (2015). \n                      https:\/\/doi.org\/10.1016\/j.procs.2015.04.203","journal-title":"Procedia Comput. Sci."},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Szcz\u0229\u015bniak, W.: Application of adaptive circuit partitioning algorithms to reductions of interconnections length between elements of VLSI circuit. In: Proceedings of 9th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2002, Dubrownik, Croatia, 15\u201318 September 2002. \n                      https:\/\/doi.org\/10.1109\/ICECS.2002.1046259","DOI":"10.1109\/ICECS.2002.1046259"},{"key":"14_CR16","unstructured":"Pseudocodes of algorithms from section 2.3. \n                      http:\/\/www.pk.edu.pl\/~zk\/pubs\/NMA18.zip"}],"container-title":["Lecture Notes in Computer Science","Numerical Methods and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10692-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T05:26:35Z","timestamp":1558329995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-10692-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030106911","9783030106928"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10692-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Methods and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Borovets","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nma2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nma18.fmi.uni-sofia.bg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}