The intended scope was all research in algorithms, theoretical as well as applied, carried out in the fields of computer science and discrete mathematics.
Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms.
In ESA 2003 Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, and Russell Schwartz: SNPs Problems, Complexity, and Algorithms.
In ESA 2001 Sudipto Guha, Samir Khuller: Approximation Algorithms for Connected Dominating Sets.
In ESA 1996 Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold (extended abstract) An Empirical Evaluation of k-Means Coresets Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings Combining Predicted and Live Traffic with Time-Dependent A* Potentials Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs Experimental Comparison of PC-Trees and PQ-Trees Determining 4-edge-connected components in linear time Evidence for Long-Tails in SLS Algorithms Approximate $CVP_{\infty}$ in time $2^{0.802 n}$ Generalizing CGAL Periodic Delaunay Triangulations Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents Fragile Complexity of Comparison-Based Algorithms Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs Patching Colors with Tensors Decremental SPQR-trees for Planar Graphs An Exact Algorithm for the Steiner Forest Problem On the Complexity of the (Approximate) Nearest Colored Node Problem Practical Access to Dynamic Programming on Tree Decompositions Improving TSP tours using dynamic programming over tree decompositions Positive-instance driven dynamic programming for treewidth Counting restricted homomorphisms via Möbius inversion over matroid lattice A randomized polynomial kernelization for Vertex Cover with a smaller parameter Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane The Strongly Stable Roommates Problem KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation Since 2022, ESA also awards the best paper for the Simplicity Track: Since 2001, ESA is co-located with other algorithms conferences and workshops in a combined meeting called ALGO.