default search action
ACM Journal of Experimental Algorithmics, Volume 23
Volume 23, 2018
- Jeffrey A. Robinson, Susan V. Vrbsky, Xiaoyan Hong, Brian P. Eddy:
Analysis of a High-Performance TSP Solver on the GPU. - Michael Hamann, Ben Strasser:
Graph Bisection with Pareto Optimization. - Zoltán Ádám Mann:
Complexity of Coloring Random Graphs: An Experimental Study of the Hardest Region. - Flavio Vella, Massimo Bernaschi, Giancarlo Carbone:
Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness Centrality. - Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the Betweenness Centrality of a Node by Adding Links. - Moritz von Looz, Henning Meyerhenke:
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time. - Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Connection Scan Algorithm. - Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. - Sami Sieranoja, Pasi Fränti:
Constructing a High-Dimensional kNN-Graph Using a Z-Order Curve.
- Valentin Polishchuk, Vijaya Ramachandran, Rezaul Alam Chowdhury:
Editorial: ALENEX 2017 Special Issue. - Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano:
Computing Critical Nodes in Directed Graphs. - Peyman Afshani, Mark de Berg, Henri Casanova, Ben Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. - Constantinos Tsirogiannis, Frank Staals, Vincent Pellissier:
Computing the Expected Value and Variance of Geometric Measures. - Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.