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
2016	Counting Matchings with k Unmatched Vertices in Planar Graphs.	Radu Curticapean
2016	Stochastic Streams: Sample Complexity vs. Space Complexity.	Michael S. Crouch, Andrew McGregor, Gregory Valiant, David P. Woodruff
2016	Cell-Probe Lower Bounds for Bit Stream Computation.	Raphal Clifford, Markus Jalsenius, Benjamin Sach
2016	An ILP-based Proof System for the Crossing Number Problem.	Markus Chimani, Tilo Wiedera
2016	Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs.	Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2016	Homotopy Measures for Representative Trajectories.	Erin W. Chambers, Irina Kostitsyna, Maarten Lffler, Frank Staals
2016	Optimal Staged Self-Assembly of General Shapes.	Cameron T. Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie
2016	On Interference Among Moving Sensors and Related Problems.	Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, Andr van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky
2016	Solving k-SUM Using Few Linear Queries.	Jean Cardinal, John Iacono, Aurlien Ooms
2016	New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.	Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
2016	Hitting Set for Hypergraphs of Low VC-dimension.	Karl Bringmann, Lszl Kozma, Shay Moran, N. S. Narayanaswamy
2016	Mapping Polygons to the Grid with Small Hausdorff and Frchet Distance.	Quirijn W. Bouts, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Willem Sonke, Kevin Verbeek
2016	Separation of Cycle Inequalities for the Periodic Timetabling Problem.	Ralf Borndrfer, Heide Hoppmann, Marika Karbstein
2016	KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation.	Michele Borassi, Emanuele Natale
2016	Parameterized Hardness of Art Gallery Problems.	douard Bonnet, Tillmann Miltzow
2016	Fixed-Parameter Approximability of Boolean MinCSPs.	douard Bonnet, Lszl Egri, Dniel Marx
2016	Fully Dynamic Spanners with Worst-Case Update Time.	Greg Bodwin, Sebastian Krinninger
2016	Efficient Algorithms with Asymmetric Read and Write Costs.	Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun
2016	Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane.	Thomas Blsius, Tobias Friedrich, Anton Krohmer, Sren Laue
2016	Hyperbolic Random Graphs: Separators and Treewidth.	Thomas Blsius, Tobias Friedrich, Anton Krohmer
2016	Compact and Fast Sensitivity Oracles for Single-Source Distances.	Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti
2016	Online Algorithms for Multi-Level Aggregation.	Marcin Bienkowski, Martin Bhm, Jaroslaw Byrka, Marek Chrobak, Christoph Drr, Luks Folwarczn, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Vesel
2016	On the Hardness of Learning Sparse Parities.	Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket
2016	Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.	Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell
2016	On the Lattice Distortion Problem.	Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz

1,026–1,050 of 2,439← Previous Next →

Comparable venues

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