European Symposium on Algorithms

ESA

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

2,439

1993–2026

Best Theory of Computation conferences

Papers per year

1993161 peak2026

Most published authors

ESA papers

2,439 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2020	The Minimization of Random Hypergraphs.	Thomas Blsius, Tobias Friedrich, Martin Schirneck
2020	An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling.	Sujoy Bhore, Guangping Li, Martin Nllenburg
2020	Noisy, Greedy and Not so Greedy k-Means++.	Anup Bhattacharya, Jan Eube, Heiko Rglin, Melanie Schmidt
2020	An Optimal Decentralized (Δ + 1)-Coloring Algorithm.	Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
2020	Simulating Population Protocols in Sub-Constant Time per Interaction.	Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran
2020	On the Complexity of BWT-Runs Minimization via Alphabet Reordering.	Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan
2020	Grundy Distinguishes Treewidth from Pathwidth.	Rmy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	Linear Time LexDFS on Chordal Graphs.	Jesse Beisegel, Ekkehard Khler, Robert Scheffler, Martin Strehler
2020	Mincut Sensitivity Data Structures for the Insertion of an Edge.	Surender Baswana, Shiv Kumar Gupta, Till Knollmann
2020	Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations.	Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram
2020	Minimum Neighboring Degree Realization in Graphs and Trees.	Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz
2020	Improved Bounds for Metric Capacitated Covering Problems.	Sayan Bandyapadhyay
2020	Set Cover with Delay - Clairvoyance Is Not Required.	Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou
2020	Cutting Polygons into Small Pieces with Chords: Laser-Based Localization.	Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tth
2020	Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis.	Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
2020	Analysis of the Period Recovery Error Bound.	Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky
2020	Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem.	Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence
2020	Reconstructing Biological and Digital Phylogenetic Trees in Parallel.	Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda
2020	Parallel Batch-Dynamic Trees via Change Propagation.	Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick
2020	Planar Bichromatic Bottleneck Spanning Trees.	A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
2020	New Bounds on Augmenting Steps of Block-Structured Integer Programs.	Lin Chen, Martin Kouteck, Lei Xu, Weidong Shi
2020	Capacitated Sum-Of-Radii Clustering: An FPT Approximation.	Tanmay Inamdar, Kasturi R. Varadarajan
2020	Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies.	Johannes Blum, Sabine Storandt
2020	Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions.	Rajiv Raman, Saurabh Ray
2019	Front Matter, Table of Contents, Preface, Conference Organization.

726–750 of 2,439← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.