{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:11:05Z","timestamp":1556392265413},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679011","type":"print"},{"value":"9783540446125","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_3","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"36-51","source":"Crossref","is-referenced-by-count":0,"title":["What Do We Learn from Experimental Algorithmics?"],"prefix":"10.1007","author":[{"given":"Camil","family":"Demetrescu","sequence":"first","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"3_CR1","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974."},{"key":"3_CR2","author":"R.K. Ahuia","year":"1993","unstructured":"R.K. Ahuia, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.","volume-title":"Network Flows: Theory, Algorithms and Applications"},{"key":"3_CR3","unstructured":"R. Anderson. The role of experiment in the theory of algorithms. In Proceedings of the 5th DIMACS Challenge Workshop, 1996. Available over the Internet at the URL: http:\/\/www.cs.amherst.edu\/dsj\/methday.html ."},{"key":"3_CR4","unstructured":"C. Berge and A. Ghouila-Houri. Programming, Games and Transportation Networks. Wiley, 1962."},{"key":"3_CR5","unstructured":"G. Bilardi, P. D\u2019Alberto, and A. Nicolau. Fractal matrix multiplication: a case study on portability of cache performance. Manuscript, May 2000.","DOI":"10.1007\/3-540-44688-5_3","doi-asserted-by":"crossref"},{"key":"3_CR6","author":"M.H. Brown","year":"1988","unstructured":"M.H. Brown. Algorithm Animation. MIT Press, Cambridge, MA, 1988.","volume-title":"Algorithm Animation"},{"key":"3_CR7","unstructured":"M.H. Brown. Zeus: a System for Algorithm Animation and Multi-View Editing. In Proceedings of the 7-th IEEE Workshop on Visual Languages, pages 4\u20139, 1991.","DOI":"10.1109\/WVL.1991.238857","doi-asserted-by":"crossref"},{"key":"3_CR8","unstructured":"G. Cattaneo, U. Ferraro, G.F. Italiano, and V. Scarano. Cooperative Algorithm and Data Types Animation over the Net. In Proc. XV IFIP World Computer Congress, Invited Lecture, pages 63\u201380, 1998. System Home Page: http:\/\/isis.dia.unisa.it\/catai\/ ."},{"key":"3_CR9","series-title":"Russian. English translation appears in AMS Translations","first-page":"90","volume-title":"Collected Papers, Issue 3: Combinatorial Methods for Flow Problems","author":"B.V. Cherkassky","year":"1979","unstructured":"B.V. Cherkassky. A Fast Algorithm for Computing Maximum Flow in a Network. In A.V. Karzanov editor, Collected Papers, Issue 3: Combinatorial Methods for Flow Problems, pages 90\u201396. The Institute for Systems Studies, Moscow, 1979. In Russian. English translation appears in AMS Translations, Vol. 158, pp. 23\u201330. AMS, Providence, RI, 1994."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"B.V. Cherkassky and A.V. Goldberg. On implementing the push-relabel method for the maximum flow problem. Algorithmica, 19:390\u2013410, 1997.","journal-title":"Algorithmica"},{"key":"3_CR11","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, 1990."},{"key":"3_CR12","unstructured":"P. Crescenzi, C. Demetrescu, I. Finocchi, and R. Petreschi. Reversible Execution and Visualization of Programs with LEONARDO. Journal of Visual Languages and Computing, 11(2), 2000. Leonardo is available at the URL: http:\/\/www.dis.uniroma1.it\/~demetres\/Leonardo\/ .","DOI":"10.1006\/jvlc.1999.0143","doi-asserted-by":"crossref"},{"key":"3_CR13","author":"G.B. Dantzig","year":"1951","unstructured":"G.B. Dantzig. Application of the Simplex Method to a Transportation Problem. In T.C. Hoopmans editor, Activity Analysis and Production and Allocation, Wiley, New York, 1951.","volume-title":"Activity Analysis and Production and Allocation"},{"key":"3_CR14","unstructured":"Demetrescu, C. and Finocchi, I. Break the \u201cRight\u201d Cycles and Get the \u201cBest\u201d Drawing. In Proc. of the 2nd International Conference on Algorithms and Experimentations (ALENEX\u201900) San Francisco, CA, 2000."},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(88)90001-5","volume":"5","author":"M. Eisenstadt","year":"1988","unstructured":"M. Eisenstadt and M. Brayshaw. The transparent prolog machine: An execution model and graphical debugger for logic programming. Journal of Logic Programming, 5(4):1\u201366, 1988.","journal-title":"Journal of Logic Programming"},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 3-rd Workshop on Algorithm Engineering (WAE\u201999)","author":"A.V. Goldberg","year":"1999","unstructured":"A.V. Goldberg. Selecting problems for algorithm evaluation. In Proc. 3-rd Workshop on Algorithm Engineering (WAE\u201999), LNCS 8, pages 1\u201311, 1999."},{"key":"3_CR17","unstructured":"A.V. Goldberg and B.M.E. Moret. Combinatorial algorithms test sets [CATS]: The ACM\/EATCS platform for experimental research (short). In SODA: ACM-SIAM Symposium on Discrete Algorithms, 1999."},{"key":"3_CR18","unstructured":"R.R. Henry, K.M. Whaley, and B. Forstall. The University of Washington Program Illustrator. In Proceedings of the ACM SIGPLAN\u201990 Conference on Programming Language Design and Implementation, pages 223\u2013233, 1990.","DOI":"10.1145\/93542.93571","doi-asserted-by":"crossref"},{"key":"3_CR19","unstructured":"D. Johnson. A theoretician\u2019s guide to the experimental analysis of algorithms. In Proceedings of the 5th DIMACS Challenge Workshop, 1996. Available over the Internet at the URL: http:\/\/www.cs.amherst.edu\/dsj\/methday.html ."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"D. Klingman, A. Napier, and J. Stutz. Netgen: A program for generating large scale capacitated assignment, transportation, and minimum cost network flow problems. Management Science, 20:814\u2013821, 1974.","journal-title":"Management Science"},{"key":"3_CR21","unstructured":"Donald E. Knuth. Stanford GraphBase: A platform for combinatorial algorithms. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 41\u201343, New York, NY 10036, USA, 1993. ACM Press."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1006\/jvlc.1998.0084","volume":"9","author":"S.P. Lahtinen","year":"1998","unstructured":"S.P. Lahtinen, E. Sutinen, and J. Tarhio. Automated Animation of Algorithms with Eliot. Journal of Visual Languages and Computing, 9:337\u2013349, 1998.","journal-title":"Journal of Visual Languages and Computing"},{"key":"3_CR23","unstructured":"T. Leong, P. Shor, and C. Stein. Implementation of a combinatorial multicommodity flow algorithm. In D.S. Johnon and C. McGeoch, eds., Network Flows and Matching: First DIMACS Implementation Challenge, pages 387\u2013406, 1993.","DOI":"10.1090\/dimacs\/012\/15","doi-asserted-by":"crossref"},{"key":"3_CR24","unstructured":"C. McGeoch. A bibliography of algorithm experimentation. In Proceedings of the 5th DIMACS Challenge Workshop, 1996. Available over the Internet at the URL: http:\/\/www.cs.amherst.edu\/dsj\/methday.html ."},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. Naher. LEDA, a platform for combinatorial and geometric computing. Communications of the ACM, 38:96\u2013102, 1995.","journal-title":"Communications of the ACM"},{"key":"3_CR26","unstructured":"B.M.E. Moret. Towards a discipline of experimental algorithmics. In Proceedings of the 5th DIMACS Challenge Workshop, 1996. Available over the Internet at the URL: http:\/\/www.cs.amherst.edu\/dsj\/methday.html ."},{"key":"3_CR27","unstructured":"B.M.E. Moret and H.D. Shapiro. An empirical assessment of algorithms for constructing a minimal spanning tree. Computational Support for Discrete Mathematics N. Dean and G. Shannon eds. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 15:99\u2013117, 1994.","DOI":"10.1090\/dimacs\/015\/09","doi-asserted-by":"crossref"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/1045-926X(92)90014-D","volume":"3","author":"G.C. Roman","year":"1992","unstructured":"G.C. Roman, K.C. Cox, C.D. Wilcox, and J.Y Plun. PAVANE: a System for Declarative Visualization of Concurrent Computations. Journal of Visual Languages and Computing, 3:161\u2013193, 1992.","journal-title":"Journal of Visual Languages and Computing"},{"key":"3_CR29","unstructured":"S. Skiena. Who is interested in algorithms and why? lessons from the stony brook algorithms repository. In Proc. Workshop on Algorithm Engineering (WAE\u201998), pages 204\u2013212, 1998."},{"issue":"3","key":"3_CR30","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S1045-926X(05)80007-2","volume":"1","author":"J.T. Stasko","year":"1990","unstructured":"J.T. Stasko. The Path-Transition Paradigm: a Practical Methodology for Adding Animation to Program Interfaces. Journal of Visual Languages and Computing, 1(3):213\u2013236, 1990.","journal-title":"Journal of Visual Languages and Computing"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jpdc.1993.1062","volume":"18","author":"J.T. Stasko","year":"1993","unstructured":"J.T. Stasko. A Methodology for Building Application-Specific Visualizations of Parallel Programs. Journal of Parallel and Distributed Computing, 18:258\u2013264, 1993.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"3_CR32","author":"J.T. Stasko","year":"1997","unstructured":"J.T. Stasko, J. Domingue, M.H. Brown, and B.A. Price. Software Visualization: Programming as a Multimedia Experience. MIT Press, Cambridge, MA, 1997.","volume-title":"Software Visualization: Programming as a Multimedia Experience"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T18:41:40Z","timestamp":1556390500000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":32,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-44612-5_3","relation":{"cites":[]},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}]}}