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
2013	Dynamic Graphs in the Sliding-Window Model.	Michael S. Crouch, Andrew McGregor, Daniel M. Stubbs
2013	Rumor Spreading in Random Evolving Graphs.	Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013	List H-Coloring a Graph by Removing Few Vertices.	Rajesh Hemant Chitnis, Lszl Egri, Dniel Marx
2013	Secluded Connectivity Problems.	Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2013	Limitations of Deterministic Auction Design for Correlated Bidders.	Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
2013	Economic 3-Colored Subdivision of Triangulations.	Lucas Moutinho Bueno, Jorge Stolfi
2013	Vertex Deletion for 3D Delaunay Triangulations.	Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Richard Shewchuk
2013	Computing the Frchet Distance with a Retractable Leash.	Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer
2013	The Encoding Complexity of Two Dimensional Range Minimum Data Structures.	Gerth Stlting Brodal, Andrej Brodnik, Pooya Davoodi
2013	On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity.	Jop Brit, Daniel Dadush, Sebastian Pokutta
2013	Revisiting the Problem of Searching on a Line.	Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher
2013	The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology.	Jean-Daniel Boissonnat, Tamal K. Dey, Clment Maria
2013	Largest Chordal and Interval Subgraphs Faster Than 2 n.	Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	Exclusive Graph Searching.	Llia Blin, Janna Burman, Nicolas Nisse
2013	Parallel String Sample Sort.	Timo Bingmann, Peter Sanders
2013	A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree.	Davide Bil, Luciano Gual, Guido Proietti
2013	Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.	Christoph Berkholz, Paul S. Bonsma, Martin Grohe
2013	Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap.	Mark de Berg, Dirk H. P. Gerrits
2013	Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.	Djamal Belazzougui, Fabio Cunial, Juha Krkkinen, Veli Mkinen
2013	An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering.	Andreas Beckmann, Ulrich Meyer, David Veith
2013	Theory and Implementation of Online Multiselection Algorithms.	Jrmy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
2013	Maximizing Barrier Coverage Lifetime with Mobile Sensors.	Amotz Bar-Noy, Dror Rawitz, Peter Terlecky
2013	On Resilient Graph Spanners.	Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini
2013	Logit Dynamics with Concurrent Updates for Local Interaction Games.	Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2013	An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters.	Lars Arge, Gerth Stlting Brodal, Jakob Truelsen, Constantinos Tsirogiannis

1,251–1,275 of 2,439← Previous Next →

Comparable venues

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