Experimental algorithmics. From algorithm design to robust and efficient software (Q1868002)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Bader, David A.; Moret, Bernard M. E.; Sanders, Peter}, Algorithm engineering for parallel computation, 1-23 [Zbl 1026.68760] \textit{Demetrescu, Camil; Finocchi, Irene; Italiano, Giuseppe F.; Näher, Stefan}, Visualization in algorithm engineering: Tools and techniques, 24-50 [Zbl 1026.68768] \textit{Fellows, Michael R.}, Parameterized complexity: The main ideas and connections to practical computing, 51-77 [Zbl 1026.68773] \textit{Ladner, Richard E.; Fortna, Ray; Nguyen, Bao-Hoang}, A comparison of cache aware and cache oblivious static search trees using program instrumentation, 78-92 [Zbl 1026.68790] \textit{McGeoch, Catherine; Sanders, Peter; Fleischer, Rudolf; Cohen, Paul R.; Precup, Doina}, Using finite experiments to study asymptotic performance, 93-126 [Zbl 1026.68796] \textit{Meinel, Christoph; Sack, Harald; Wagner, Arno}, WWW. BDD-Portal. ORG: An experimentation platform for binary decision diagram algorithms, 127-138 [Zbl 1026.68798] \textit{Meinel, Christoph; Stangier, Christian}, Algorithms and heuristics in VLSI design, 139-162 [Zbl 1026.68797] \textit{Moret, Bernard M. E.; Warnow, Tandy}, Reconstructing optimal phylogenetic trees: A challenge in experimental algorithmics, 163-180 [Zbl 1026.68801] \textit{Sanders, Peter}, Presenting data from experiments in algorithmics, 181-196 [Zbl 1026.68816] \textit{Spirakis, Paul G.; Zaroliagis, Christos D.}, Distributed algorithm engineering, 197-228 [Zbl 1026.68819] \textit{Zaroliagis, Christos D.}, Implementations and experimental studies of dynamic graph algorithms, 229-278 [Zbl 1026.68829]