Show indexed articles as search result.

Publisher’s description: The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing.
The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice.
The articles of mathematical interest will be reviewed individually. For the preceding workshop see [Zbl 1380.68013].
Indexed articles:
Edelkamp, Stefan; Weiß, Armin, Worst-case efficient sorting with QuickMergesort, 1-14 [Zbl 1430.68065]
Aumüller, Martin; Hass, Nikolaj, Simple and fast BlockQuicksort using Lomuto’s partitioning scheme, 15-26 [Zbl 1430.68062]
Fischer, Johannes; Kurpicz, Florian, Lightweight distributed suffix array construction, 27-38 [Zbl 1430.68080]
Azaïs, Romain; Durand, Jean-Baptiste; Godin, Christophe, Approximation of trees by self-nested trees, 39-53 [Zbl 1430.68031]
Delling, Daniel; Dibbelt, Julian; Pajor, Thomas, Fast and exact public transit routing with restricted Pareto sets, 54-65 [Zbl 1430.68191]
Barth, Florian; Funke, Stefan; Storandt, Sabine, Alternative multicriteria routes, 66-80 [Zbl 1430.68174]
Beck, Moritz; Lam, Kam-Yiu; Ng, Joseph Kee Yin; Storandt, Sabine; Zhu, Chun Jiang, Concatenated \(k\)-path covers, 81-91 [Zbl 1430.68175]
Tseng, Thomas; Dhulipala, Laxman; Blelloch, Guy, Batch-parallel Euler tour trees, 92-106 [Zbl 1430.68246]
Jabrayilov, Adalat; Mutzel, Petra, A new integer linear program for the Steiner tree problem with revenues, budget and hop constraints, 107-116 [Zbl 1430.90488]
Ganian, Robert; Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan, SAT-encodings for treecut width and treedepth, 117-129 [Zbl 1430.68206]
Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin, Efficiently enumerating hitting sets of hypergraphs arising in data profiling, 130-143 [Zbl 1430.68178]
Lamm, Sebastian; Schulz, Christian; Strash, Darren; Williger, Robert; Zhang, Huashuo, Exactly solving the maximum weight independent set problem on large real-world graphs, 144-158 [Zbl 1430.68226]
Sun, Yihan; Blelloch, Guy E., Parallel range, segment and rectangle queries with augmented maps, 159-173 [Zbl 1430.68385]
Castermans, Thom; Speckman, Bettina; Verbeek, Kevin, A practical algorithm for spatial agglomerative clustering, 174-185 [Zbl 1430.68364]
Fekete, Sándor P.; Krupke, Dominik, Practical methods for computing large covering tours and cycle covers with turn cost, 186-198 [Zbl 1430.68199]
Schlag, Sebastian; Schmitt, Matthias; Schulz, Christian, Faster support vector machines, 199-210 [Zbl 1430.68274]
Schlag, Sebastian; Schulz, Christian; Seemaier, Daniel; Strash, Darren, Scalable edge partitioning, 211-225 [Zbl 1430.68240]