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 |
|---|---|---|
| 2015 | Approximate Deadline-Scheduling with Precedence Constraints. | Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Knemann, Hamid Mahini, David L. Malec, Laura Sanit |
| 2015 | Polymatroid Prophet Inequalities. | Paul Dtting, Robert Kleinberg |
| 2015 | A Polynomial Kernel for Trivially Perfect Editing. | Pl Grns Drange, Michal Pilipczuk |
| 2015 | On the Threshold of Intractability. | Pl Grns Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan |
| 2015 | Explicit Expanding Expanders. | Michael Dinitz, Michael Schapira, Asaf Valadarsky |
| 2015 | A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. | Vincent Cohen-Addad, Arnaud de Mesmay |
| 2015 | Dictionary Matching in a Stream. | Raphal Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya |
| 2015 | A Characterization of Consistent Digital Line Segments in ℤ2. | Iffat Chowdhury, Matt Gibson |
| 2015 | On Randomized Algorithms for Matching in the Online Preemptive Model. | Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan |
| 2015 | On Element-Connectivity Preserving Graph Simplification. | Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu |
| 2015 | Self-Adjusting Binary Search Trees: What Makes Them Tick? | Parinya Chalermsook, Mayank Goswami, Lszl Kozma, Kurt Mehlhorn, Thatchaphol Saranurak |
| 2015 | An Improved Approximation Algorithm for Knapsack Median Using Sparsification. | Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh |
| 2015 | Geometric Hitting Sets for Disks: Theory and Practice. | Norbert Bus, Nabil H. Mustafa, Saurabh Ray |
| 2015 | Sublinear Estimation of Weighted Matchings in Dynamic Data Streams. | Marc Bury, Chris Schwiegelshohn |
| 2015 | Computing the Similarity Between Moving Curves. | Kevin Buchin, Tim Ophelders, Bettina Speckmann |
| 2015 | Fast Quasi-Threshold Editing. | Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner |
| 2015 | Consensus Patterns (Probably) Has no EPTAS. | Christina Boucher, Christine Lo, Daniel Lokshtanov |
| 2015 | Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. | Glencora Borradaile, Amir Nayyeri, Farzad Zafarani |
| 2015 | On Computing the Hyperbolicity of Real-World Graphs. | Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino |
| 2015 | Upper and Lower Bounds for Online Routing on Delaunay Triangulations. | Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, Andr van Renssen |
| 2015 | Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. | Fritz Bkler, Petra Mutzel |
| 2015 | A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations. | Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh |
| 2015 | Enumeration of 2-Level Polytopes. | Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich |
| 2015 | Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. | Hans L. Bodlaender, Jesper Nederlof |
| 2015 | Improved Purely Additive Fault-Tolerant Spanners. | Davide Bil, Fabrizio Grandoni, Luciano Gual, Stefano Leucci, Guido Proietti |
1,101–1,125 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