European Symposium on Algorithms
ESA
A
CORE rank
CORE rank (raw)
A
Fields of research
Theory of Computation
Papers indexed
2,439
1993–2026
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 |
|---|---|---|
| 2022 | Efficient Frchet Distance Queries for Segments. | Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals |
| 2022 | Faster Approximate Covering of Subcurves Under the Frchet Distance. | Frederik Brning, Jacobus Conradi, Anne Driemel |
| 2022 | A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. | Jendrik Brachter, Pascal Schweitzer |
| 2022 | Polynomial Kernel for Immersion Hitting in Tournaments. | Lukasz Bozyk, Michal Pilipczuk |
| 2022 | Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. | Bartlomiej Bosek, Anna Zych-Pawlewicz |
| 2022 | List Colouring Trees in Logarithmic Space. | Hans L. Bodlaender, Carla Groenland, Hugo Jacob |
| 2022 | Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. | Kobi Bodek, Moran Feldman |
| 2022 | On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. | Vclav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Such, Toms Valla |
| 2022 | On the External Validity of Average-Case Analyses of Graph Algorithms. | Thomas Blsius, Philipp Fischbeck |
| 2022 | Resource Sharing Revisited: Local Weak Duality and Optimal Convergence. | Daniel Blankenburg |
| 2022 | Sparse Temporal Spanners with Low Stretch. | Davide Bil, Gianlorenzo D'Angelo, Luciano Gual, Stefano Leucci, Mirko Rossi |
| 2022 | Online Spanners in Metric Spaces. | Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tth |
| 2022 | Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. | Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert |
| 2022 | When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. | Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender |
| 2022 | Galactic Token Sliding. | Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad |
| 2022 | An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions. | Florian Barth, Stefan Funke, Claudius Proissl |
| 2022 | Computing NP-Hard Repetitiveness Measures via MAX-SAT. | Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Kppl, Takaaki Nishimoto |
| 2022 | Bounding and Computing Obstacle Numbers of Graphs. | Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff |
| 2022 | The Price of Hierarchical Clustering. | Anna Arutyunova, Heiko Rglin |
| 2022 | Computing Smallest Convex Intersecting Polygons. | Antonios Antoniadis, Mark de Berg, Sndor Kisfaludi-Bak, Antonis Skarlatos |
| 2022 | Simple Streaming Algorithms for Edge Coloring. | Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh |
| 2022 | Techniques for Generalized Colorful k-Center Problems. | Georg Anegg, Laura Vargas Koch, Rico Zenklusen |
| 2022 | Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. | Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhfer, Miklos Santha |
| 2022 | TSP in a Simple Polygon. | Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous |
| 2022 | Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. | Susanne Albers, Sebastian Schubert |
551–575 of 2,439← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing
- AALENEXWorkshop on Algorithm Engineering and Experiments