{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:17:07Z","timestamp":1740122227604,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,16]],"date-time":"2015-08-16T00:00:00Z","timestamp":1439683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,8,16]],"date-time":"2015-08-16T00:00:00Z","timestamp":1439683200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP140100058"],"award-info":[{"award-number":["DP140100058"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10601-015-9202-1","type":"journal-article","created":{"date-parts":[[2015,8,15]],"date-time":"2015-08-15T05:59:35Z","timestamp":1439618375000},"page":"77-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Visual search tree profiling"],"prefix":"10.1007","volume":"21","author":[{"given":"Maxim","family":"Shishmarev","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Mears","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Tack","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Garcia de la Banda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,16]]},"reference":[{"key":"9202_CR1","unstructured":"Bauer, A., Botea, V., Brown, M., Gray, M., Harabor, D., & Slaney, J. (2010). An integrated modelling, debugging, and visualisation environment for G12. In CP 2010. LNCS, (Vol. 6308 pp. 522\u2013536): Springer."},{"key":"9202_CR2","unstructured":"Burch, M., Raschke, M., & Weiskopf, D. (2010). Indented pixel tree plots. In Advances in Visual Computing (pp. 338\u2013349): Springer."},{"key":"9202_CR3","doi-asserted-by":"crossref","unstructured":"Carro, M., & Hermenegildo, M. Tools for constraint visualisation: The VIFID\/TRIFID tool. In: Deransart et al. [6], pp. 253\u2013272.","DOI":"10.1007\/10722311_11"},{"key":"9202_CR4","doi-asserted-by":"publisher","unstructured":"Choi, C.W., Lee, J.H.M., & Stuckey, P.J. (2007). Removing propagation redundant constraints in redundant modeling. ACM Transactions on Computational Logic, 8(4). doi:\n                    10.1145\/1276920.1276925\n                    \n                  .","DOI":"10.1145\/1276920.1276925"},{"key":"9202_CR5","unstructured":"Chu, G.G. (2011). Improving combinatorial optimization. Ph.D. thesis: University of Melbourne."},{"key":"9202_CR6","doi-asserted-by":"crossref","unstructured":"Deransart, P.,  Hermenegildo,  M.V., & Maluszynski, J. (Eds.) (2000). Analysis and visualization tools for constraint programming, constraint debugging (DiSCiPl project), LNCS, Vol. 1870: Springer.","DOI":"10.1007\/10722311"},{"key":"9202_CR7","unstructured":"Deransart, P. (2004). Main results of the OADymPPaC project. In B. Demoen, & V. Lifschitz (Eds.), ICLP, LNCS, (Vol. 3132 pp. 456\u2013457): Springer."},{"key":"9202_CR8","unstructured":"Dooms, G., Van Hentenryck, P., & Michel, L. (2007). Model-driven visualizations of constraint-based local search. In CP 2007, LNCS, (Vol. 4741 pp. 271\u2013285): Springer."},{"key":"9202_CR9","unstructured":"Feydy, T., & Stuckey, P.J. (2009). Lazy clause generation reengineered. In I.P. Gent (Ed.), CP, Lecture Notes in Computer Science, (Vol. 5732 pp. 352\u2013366): Springer."},{"key":"9202_CR10","unstructured":"Google (2015). Protocol buffers. \n                    https:\/\/developers.google.com\/protocol-buffers\/\n                    \n                  ."},{"key":"9202_CR11","doi-asserted-by":"crossref","unstructured":"Goualard, F., & Benhamou, F. Debugging constraint programs by store inspection. In: Deransart et al. [6], pp. 273\u2013297.","DOI":"10.1007\/10722311_12"},{"key":"9202_CR12","unstructured":"iMatix (2015). ZeroMQ. \n                    http:\/\/zeromq.org\n                    \n                  ."},{"key":"9202_CR13","unstructured":"Jussien, N., Rochart, G., & Lorca, X. (2008). Choco: an open source Java constraint programming library. In CPAIOR\u201908 Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP\u201908) (pp. 1\u201310)."},{"key":"9202_CR14","unstructured":"Meier, M. (1995). Debugging constraint programs. In CP\u201995, LNCS, (Vol. 976 pp. 204\u2013221): Springer."},{"key":"9202_CR15","unstructured":"MinisatID team (2015). MinisatID solver. \n                    https:\/\/dtai.cs.kuleuven.be\/software\/minisatid\n                    \n                  ."},{"key":"9202_CR16","unstructured":"M\u00fcller, T. (1999). Practical investigation of constraints with graph views. In K. Sagonas, & P. Tarau (Eds.) Proceedings of the International Workshop on Implementation of Declarative Languages (IDL\u201999)."},{"key":"9202_CR17","unstructured":"Newsham, Z., Lindsay, W., Liang, J.H., Czarnecki, K., Fischmeister, S., & Ganesh, V. (2014). SATGraf: Visualizing community structure in boolean SAT instances. \n                    https:\/\/ece.uwaterloo.ca\/vganesh\/EvoGraph\/Home.html\n                    \n                  ."},{"key":"9202_CR18","unstructured":"Schulte, C. (1997). Oz explorer: a visual constraint programming tool. In L. Naish (Ed.), ICLP (pp. 286\u2013300): MIT Press."},{"key":"9202_CR19","unstructured":"Schulte, C., Lagerkvist, M.Z., & Tack, G. (2006). Gecode: Generic constraint development environment. \n                    http:\/\/www.gecode.org\n                    \n                  ."},{"key":"9202_CR20","unstructured":"Schulte, C., Tack, G., & Lagerkvist, M.Z. (2015). Modeling and programming with Gecode. \n                    http:\/\/www.gecode.org\/doc-latest\/MPG.pdf\n                    \n                  ."},{"key":"9202_CR21","doi-asserted-by":"crossref","unstructured":"Simonis, H., & Aggoun, A. Search-tree visualisation. In: Deransart et al. [6], pp. 191\u2013208.","DOI":"10.1007\/10722311_8"},{"key":"9202_CR22","unstructured":"Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., & Carlsson, M. (2010). A generic visualization platform for CP. In CP 2010, LNCS, (Vol. 6308 pp. 460\u2013474): Springer."},{"key":"9202_CR23","unstructured":"Sinz, C. (2004). Visualizing the internal structure of SAT instances (preliminary report). In SAT."},{"key":"9202_CR24","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11499107_19","volume-title":"Theory and applications of satisfiability testing, lecture notes in computer science, Vol. 3569","author":"C Sinz","year":"2005","unstructured":"Sinz, C., & Dieringer, E.M. (2005). DPvis \u2013 a tool to visualize the structure of SAT instances. In F. Bacchus, & T. Walsh (Eds.), Theory and applications of satisfiability testing, lecture notes in computer science, (Vol. 3569 pp. 257\u2013268). Berlin Heidelberg: Springer. doi:\n                    10.1007\/11499107_19\n                    \n                  ."},{"key":"9202_CR25","unstructured":"Smith, B.M., Stergiou, K., & Walsh, T. (1999). Modelling the Golomb ruler problem. Tech. rep., University of Leeds School of Computer Studies."},{"key":"9202_CR26","unstructured":"Van Cauwelaert, S., Lombardi, M., & Schaus, P. (2015). Understanding the potential of propagators. In Integration of AI and OR Techniques in Constraint Programming (pp. 427\u2013436): Springer."},{"key":"9202_CR27","unstructured":"Wallace, M.G., Novello, S., & Schimpf, J. (1997). ECLiPSe : a platform for constraint logic programming. ICL Systems Journal, 12(1)."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9202-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9202-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9202-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9202-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T14:58:02Z","timestamp":1589727482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9202-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,16]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9202"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9202-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2015,8,16]]},"assertion":[{"value":"16 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}