Esa
632 papers254 directions
Papers by Year
| 2026 | 30 |
| 2025 | 20 |
| 2024 | 29 |
| 2023 | 28 |
| 2022 | 29 |
| 2021 | 21 |
| 2020 | 22 |
| 2019 | 28 |
| 2018 | 26 |
| 2017 | 27 |
| 2016 | 36 |
| 2015 | 41 |
| 2014 | 19 |
| 2013 | 16 |
| 2012 | 16 |
| 2011 | 21 |
| 2010 | 14 |
| 2009 | 28 |
| 2008 | 18 |
| 2007 | 21 |
| 2006 | 21 |
| 2005 | 14 |
| 2004 | 14 |
| 2003 | 17 |
| 2002 | 19 |
| 2001 | 10 |
| 2000 | 5 |
| 1999 | 6 |
| 1998 | 9 |
| 1997 | 3 |
| 1996 | 10 |
| 1995 | 8 |
| 1994 | 6 |
| 1993 | 3 |
Top Research Directions
Research directions most represented by papers from this venue.
Top Authors
Impactful Papers
Papers from this venue that shaped research clusters.
Foundational
Self-Adjusting Binary Search Trees: What Makes Them Tick?
foundational
The Dynamic Optimality Conjecture for Bi
2015
Necklaces, Convolutions, and X + Y
foundational
Linearizing Circular Domains for Efficie
2006
Average Sensitivity of the Knapsack Problem
foundational
Algorithmic Robustness via Average Sensi
2022
Comparing Real Algebraic Numbers of Small Degree
foundational
Controlling Coefficient Growth in Symbol
2004
Dial a Ride from k-forest
foundational
Breaking Approximation Barriers in Metri
2007
Improved Approximations for k-Exchange Systems - (Extended Abstract)
foundational
Escaping Local Optima with Non-Oblivious
2011
A Primal Approach to the Stable Set Problem
foundational
Computational Intractability of Graph Re
2002
Minimum Makespan Multi-vehicle Dial-a-Ride
foundational
Exploiting Euclidean Geometry for Tighte
2009
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
foundational
Generalizing Algorithmic Frameworks to A
2008
Influential
Parameterized Algorithms for Diverse Multistage Problems
influential
Transitioning from Monte Carlo to Determ
2021
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
influential
Kinetic Maintenance of Dynamic Geometric
2008
Techniques for Scheduling with Rejection
influential
The Empirical Validation Gap
1998
Improved Bounds for Online Balanced Graph Re-Partitioning
influential
Resource Augmentation for Online Algorit
2022
Feature Cross Search via Submodular Optimization
influential
Extending Theoretical Guarantees to Non-
2021
TSP in a Simple Polygon
influential
Geometric Visibility in Multiply Connect
2022
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else
influential
Robustness and Consistency in Learning-A
2023
Related Venues
Venues with the most similar research cluster distributions.
ICALP81% similar · 1,234 papers
SODA78% similar · 2,036 papers
ACM Trans. Algorithms76% similar · 355 papers
SIAM Journal on Computing74% similar · 966 papers
Approx-random73% similar · 404 papers
STOC72% similar · 1,631 papers
Stacs70% similar · 357 papers
FOCS69% similar · 1,306 papers
Isaac67% similar · 401 papers
J. ACM67% similar · 532 papers
Papers
« prev Page 13/13