{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:23Z","timestamp":1792111463972,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":29,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_464","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:04:13Z","timestamp":1461269053000},"page":"2333-2337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visualization Techniques for Algorithm Engineering"],"prefix":"10.1007","author":[{"given":"Camil","family":"Demetrescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"464_CR2242","doi-asserted-by":"crossref","unstructured":"Anderson RJ (2002) The role of experiment in the theory of algorithms. In: Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS implementation challenges. DIMACS series in discrete mathematics and theoretical computer science, vol 59. American Mathematical Society, Providence, pp 191\u2013195","DOI":"10.1090\/dimacs\/059\/09"},{"key":"464_CR2243","unstructured":"Baker J, Cruz I, Liotta G, Tamassia R (1996) Animating geometric algorithms over the web. In: Proceedings of the 12th annual ACM symposium on computational geometry. Philadelphia, 24\u201326 May 1996, pp C3\u2013C4"},{"key":"464_CR2244","doi-asserted-by":"crossref","unstructured":"Baker J, Cruz I, Liotta G, Tamassia R (1996) The Mocha algorithm animation system. In: Proceedings of the 1996 ACM workshop on advanced visual interfaces, Gubbio, 27\u201329 May 1996, pp 248\u2013250","DOI":"10.1145\/948449.948487"},{"key":"464_CR2245","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/234782.234792","volume":"27","author":"J Baker","year":"1996","unstructured":"Baker J, Cruz I, Liotta G, Tamassia R (1996) A new model for algorithm animation over the WWW. ACM Comput Surv 27:568\u2013572","journal-title":"ACM Comput Surv"},{"key":"464_CR2246","doi-asserted-by":"crossref","unstructured":"Baker R, Boilen M, Goodrich M, Tamassia R, Stibel B (1999) Testers and visualizers for teaching data structures. In: Proceeding of the 13th SIGCSE technical symposium on computer science education, New Orleans, 24\u201328 Mar 1999, pp 261\u2013265","DOI":"10.1145\/299649.299779"},{"key":"464_CR2247","volume-title":"Algorithm animation","author":"M Brown","year":"1988","unstructured":"Brown M (1988) Algorithm animation. MIT Press, Cambridge"},{"key":"464_CR2248","doi-asserted-by":"crossref","unstructured":"Brown M (1988) Perspectives on algorithm animation. In: Proceedings of the ACM SIGCHI'88 conference on human factors in computing systems. Washington, DC, 15\u201319 May 1988, pp 33\u201338","DOI":"10.1145\/57167.57172"},{"key":"464_CR2249","doi-asserted-by":"crossref","unstructured":"Brown M (1991) Zeus: a system for algorithm animation and multi-view editing. In: Proceedings of the 7th IEEE workshop on visual languages, Kobe, 8\u201311 Oct 1991, pp 4\u20139","DOI":"10.1109\/WVL.1991.238857"},{"issue":"4","key":"464_CR2250","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1006\/jvlc.2002.0230","volume":"13","author":"G Cattaneo","year":"2002","unstructured":"Cattaneo G, Ferraro U, Italiano GF, Scarano V (2002) Cooperative algorithm and data types animation over the net. J Vis Lang Comp 13(4):391","journal-title":"J Vis Lang Comp"},{"key":"464_CR2251","doi-asserted-by":"crossref","unstructured":"Crescenzi P, Demetrescu C, Finocchi I, Petreschi R (2008) Reversible execution and visualization of programs with LEONARDO. J Vis Lang Comp 11:125\u2013150, Leonardo is available at: http:\/\/www.dis.uniroma1.it\/~demetres\/Leonardo\/. Accessed 15 Jan 2008","DOI":"10.1006\/jvlc.1999.0143"},{"key":"464_CR2252","unstructured":"Demetrescu C (2001) Fully dynamic algorithms for path problems on directed graphs. PhD thesis, Department of Computer and Systems Science, University of Rome \u201cLa Sapienza\u201d"},{"key":"464_CR2253","doi-asserted-by":"crossref","unstructured":"Demetrescu C, Finocchi I, Italiano GF, N\u00e4her S (2002) Visualization in algorithm engineering: tools and techniques. In: Experimental algorithm design to robust and efficient software. Lecture notes in computer science, vol 2547, Springer, Berlin, pp 24\u201350","DOI":"10.1007\/3-540-36383-1_2"},{"key":"464_CR2254","unstructured":"Demetrescu C, Finocchi I, Liotta G (2000) Visualizing algorithms over the web with the publication-driven approach. In: Proceedings of the 4th workshop on algorithm engineering (WAE\u201900), Saarbr\u00fccken, 5\u20138 Sept 2000"},{"key":"464_CR2255","doi-asserted-by":"crossref","unstructured":"Fabri A, Giezeman G, Kettner L, Schirra S, Sch\u00f6nherr S (1996) The cgal kernel: a basis for geometric computation. In: Applied computational geometry: towards geometric engineering proceedings (WACG'96), Philadelphia, 27\u201328 May 1996, pp 191\u2013202","DOI":"10.1007\/BFb0014496"},{"key":"464_CR2256","doi-asserted-by":"crossref","unstructured":"Goldberg A (1999) Selecting problems for algorithm evaluation. In: Proceedings of the 3rd workshop on algorithm engineering (WAE'99), London, 19\u201321 July 1999. Lecture notes in computer science, vol 1668, pp 1\u201311","DOI":"10.1007\/3-540-48318-7_1"},{"key":"464_CR2257","doi-asserted-by":"crossref","unstructured":"Johnson D (2002) A theoretician's guide to the experimental analysis of algorithms. In: Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS series in discrete mathematics and theoretical computer science, vol 59. American Mathematical Society, Providence, 215\u2013250","DOI":"10.1090\/dimacs\/059\/11"},{"key":"464_CR2258","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/75705.75709","volume-title":"Instrumentation for future parallel computing systems","author":"A Malony","year":"1989","unstructured":"Malony A, Reed D (1989) Visualizing parallel computer system performance. In: Simmons M, Koskela R, Bucher I (eds) Instrumentation for future parallel computing systems. ACM Press, New York, pp 59\u201390"},{"key":"464_CR2259","doi-asserted-by":"crossref","unstructured":"McGeoch C (2002) A bibliography of algorithm experimentation. In: Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS implementation challenges. DIMACS series in discrete mathematics and theoretical computer science, vol 59. American Mathematical Society, Providence, pp 251\u2013254","DOI":"10.1090\/dimacs\/059\/12"},{"key":"464_CR2260","isbn-type":"print","volume-title":"LEDA: a platform of combinatorial and geometric computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn K, Naher S (1999) LEDA: a platform of combinatorial and geometric computing. Cambridge University Press, Cambridge. ISBN 0-521-56329-1","ISBN":"https:\/\/id.crossref.org\/isbn\/0521563291"},{"key":"464_CR2261","doi-asserted-by":"crossref","unstructured":"Moret B (2002) Towards a discipline of experimental algorithmics. In: Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS implementation challenges. dimacs series in discrete mathematics and theoretical computer Science, vol 59. American Mathematical Society, Providence, pp 197\u2013214","DOI":"10.1090\/dimacs\/059\/10"},{"key":"464_CR2262","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S1045-926X(05)80036-9","volume":"1","author":"B Myers","year":"1990","unstructured":"Myers B (1990) Taxonomies of visual programming and program visualization. J Vis Lang Comp 1:97\u2013123","journal-title":"J Vis Lang Comp"},{"key":"464_CR2263","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1006\/jvlc.1993.1015","volume":"4","author":"B Price","year":"1993","unstructured":"Price B, Baecker R, Small I (1993) A principled taxonomy of software visualization. J Vis Lang Comp 4:211\u2013266","journal-title":"J Vis Lang Comp"},{"key":"464_CR2264","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/2.42012","volume":"22","author":"G Roman","year":"1989","unstructured":"Roman G, Cox K (1989) A declarative approach to visualizing concurrent computations. Computer 22:25\u201336","journal-title":"Computer"},{"key":"464_CR2265","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/2.247643","volume":"26","author":"G Roman","year":"1993","unstructured":"Roman G, Cox K (1993) A taxonomy of program visualization systems. Computer 26:11\u201324","journal-title":"Computer"},{"key":"464_CR2266","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/1045-926X(92)90014-D","volume":"3","author":"G Roman","year":"1992","unstructured":"Roman G, Cox K, Wilcox C, Plun J (1992) PAVANE: a system for declarative visualization of concurrent computations. J Vis Lang Comp 3:161\u2013193","journal-title":"J Vis Lang Comp"},{"key":"464_CR2267","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/130956.130959","volume":"23","author":"J Stasko","year":"1992","unstructured":"Stasko J (1992) Animating algorithms with X-TANGO. SIGACT News 23:67\u201371","journal-title":"SIGACT News"},{"key":"464_CR2268","volume-title":"Software visualization: programming as a multimedia experience","author":"J Stasko","year":"1997","unstructured":"Stasko J, Domingue J, Brown M, Price B (1997) Software visualization: programming as a multimedia experience. MIT Press, Cambridge"},{"key":"464_CR2269","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jpdc.1993.1062","volume":"18","author":"J Stasko","year":"1993","unstructured":"Stasko J, Kraemer E (1993) A methodology for building application- specific visualizations of parallel programs. J Parallel Distrib Comp 18:258\u2013264","journal-title":"J Parallel Distrib Comp"},{"key":"464_CR2270","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/2945.468401","volume":"1","author":"A Tal","year":"1995","unstructured":"Tal A, Dobkin D (1995) Visualization of geometric algorithms. IEEE Trans Vis Comp Graph 1:194\u2013204","journal-title":"IEEE Trans Vis Comp Graph"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:49:24Z","timestamp":1792108164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_464","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}