{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T11:18:41Z","timestamp":1753183121416,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,23]],"date-time":"2017-07-23T00:00:00Z","timestamp":1500768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L000687,EP\/M022641,EP\/K503058,EP\/P006434,EP\/K009931"],"award-info":[{"award-number":["EP\/L000687,EP\/M022641,EP\/K503058,EP\/P006434,EP\/K009931"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["1504514N"],"award-info":[{"award-number":["1504514N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,23]]},"DOI":"10.1145\/3115936.3115942","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T12:12:36Z","timestamp":1502367156000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Towards Generic Scalable Parallel Combinatorial Search"],"prefix":"10.1145","author":[{"given":"Blair","family":"Archibald","sequence":"first","affiliation":[{"name":"University of Glasgow"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Maier","sequence":"additional","affiliation":[{"name":"University of Glasgow"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Stewart","sequence":"additional","affiliation":[{"name":"Heriot-Watt University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phil","family":"Trinder","sequence":"additional","affiliation":[{"name":"University of Glasgow"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"De Beule","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Brussel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Enrique Alba Francisco Almeida Maria J. Blesa J. Cabeza Carlos Cotta Manuel D\u00edaz Isabel Dorta Joaquim Gabarr\u00f3 Coromoto Le\u00f3n J. Luna Luz Marina Moreno C. Pablos Jordi Petit Ang\u00e9lica Rojas and Fatos Xhafa. 2002. MALLBA: A Library of Skeletons for Combinatorial Optimisation. In Euro-Par 2002 Paderborn Germany (LNCS 2400). Springer 927--932. Enrique Alba Francisco Almeida Maria J. Blesa J. Cabeza Carlos Cotta Manuel D\u00edaz Isabel Dorta Joaquim Gabarr\u00f3 Coromoto Le\u00f3n J. Luna Luz Marina Moreno C. Pablos Jordi Petit Ang\u00e9lica Rojas and Fatos Xhafa. 2002. MALLBA: A Library of Skeletons for Combinatorial Optimisation. In Euro-Par 2002 Paderborn Germany (LNCS 2400). Springer 927--932.","DOI":"10.1007\/3-540-45706-2_132"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Blair Archibald Patrick Maier Robert Stewart Phil Trinder and Jan De Beule. 2017. Towards Generic Scalable Parallel Combinatorial Search {Data Collection}. (2017). Blair Archibald Patrick Maier Robert Stewart Phil Trinder and Jan De Beule. 2017. Towards Generic Scalable Parallel Combinatorial Search {Data Collection}. (2017).","DOI":"10.1145\/3115936.3115942"},{"key":"e_1_3_2_1_3_1","unstructured":"Blair Archibald Ciaran McCreesh Patrick Maier Robert Stewart and Phil Trinder. 2017. Replicable Parallel Branch and Bound Search. (2017). arXiv:1703.05647 Blair Archibald Ciaran McCreesh Patrick Maier Robert Stewart and Phil Trinder. 2017. Replicable Parallel Branch and Bound Search. (2017). arXiv:1703.05647"},{"key":"e_1_3_2_1_4_1","unstructured":"John Bamberg Anton Betten Philippe Cara Jan De Beule Michel Lavrauw and Max Neunh\u00f6ffer. 2015. FinInG -- Finite Incidence Geometry Version 1.3. http:\/\/cage.ugent.be\/fining John Bamberg Anton Betten Philippe Cara Jan De Beule Michel Lavrauw and Max Neunh\u00f6ffer. 2015. FinInG -- Finite Incidence Geometry Version 1.3. http:\/\/cage.ugent.be\/fining"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"F. Buekenhout (Ed.). 1995. Handbook of Incidence Geometry. North-Holland Amsterdam. F. Buekenhout (Ed.). 1995. Handbook of Incidence Geometry. North-Holland Amsterdam.","DOI":"10.1016\/B978-044488355-1\/50005-0"},{"volume-title":"Algorithmic Skeletons: Structured Management of Parallel Computation","year":"1991","author":"Cole Murray","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci4002525"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"A. Djerrah Bertrand Le Cun Van-Dat Cung and Catherine Roucairol. 2006. Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods. In High Performance Distributed Computing HPDC-15 Paris France. IEEE 369--370. A. Djerrah Bertrand Le Cun Van-Dat Cung and Catherine Roucairol. 2006. Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods. In High Performance Distributed Computing HPDC-15 Paris France. IEEE 369--370.","DOI":"10.1109\/HPDC.2006.1652188"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.06.001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278177.1278182"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693504"},{"volume-title":"Workshop","year":"1993","author":"David","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676870.2676883"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837216"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633357.2633363"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3390\/a6040618"},{"volume-title":"LCPC","year":"2007","author":"Olivier Stephen","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0273-x"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Stanley E. Payne and Joseph A. Thas. 2009. Finite Generalized Quadrangles (second ed.). European Mathematical Society Z\u00fcrich. Stanley E. Payne and Joseph A. Thas. 2009. Finite Generalized Quadrangles (second ed.). European Mathematical Society Z\u00fcrich.","DOI":"10.4171\/066"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70621-2_17"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3390\/a5040545"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-011-0431-y"},{"key":"e_1_3_2_1_24_1","unstructured":"Leonard Soicher. 2016. The GRAPE package for GAP Version 4.7. http:\/\/www.maths.qmul.ac.uk\/~leonard\/grape\/ Leonard Soicher. 2016. The GRAPE package for GAP Version 4.7. http:\/\/www.maths.qmul.ac.uk\/~leonard\/grape\/"},{"issue":"8","key":"e_1_3_2_1_25_1","first-page":"7","article-title":"GAP -- Groups, Algorithms, and Programming","volume":"4","author":"The GAP Group","year":"2017","journal-title":"Version"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"}],"event":{"name":"PASCO 2017: International Workshop on Parallel Symbolic Computation","sponsor":["Heriot-Watt University Heriot-Watt University"],"location":"Kaiserslautern Germany","acronym":"PASCO 2017"},"container-title":["Proceedings of the International Workshop on Parallel Symbolic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3115936.3115942","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3115936.3115942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T21:44:01Z","timestamp":1750801441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3115936.3115942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,23]]},"references-count":26,"alternative-id":["10.1145\/3115936.3115942","10.1145\/3115936"],"URL":"https:\/\/doi.org\/10.1145\/3115936.3115942","relation":{},"subject":[],"published":{"date-parts":[[2017,7,23]]},"assertion":[{"value":"2017-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}