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	Better Approximation Algorithms for Technology Diffusion.	Jochen Knemann, Sina Sadeghian Sadeghabad, Laura Sanit
2013	Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet.	Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
2013	An Alternative Approach to Alternative Routes: HiDAR.	Moritz Kobitzsch
2013	Balls into Bins Made Faster.	Megha Khosla
2013	An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions.	Thomas Kesselheim, Klaus Radke, Andreas Tnnis, Berthold Vcking
2013	Inefficiency of Standard Multi-unit Auctions.	Bart de Keijzer, Evangelos Markakis, Guido Schfer, Orestis Telelis
2013	Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.	Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Such
2013	A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs.	Nir Halman, Giacomo Nannicini, James B. Orlin
2013	Frchet Queries in Geometric Trees.	Joachim Gudmundsson, Michiel H. M. Smid
2013	Encodings for Range Selection and Top-k Queries.	Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
2013	On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3.	Panos Giannopoulos, Christian Knauer, Daniel Werner
2013	Kernelization Using Structural Parameters on Sparse Graph Classes.	Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar
2013	Binary Jumbled Pattern Matching on Trees and Tree-Like Structures.	Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013	Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph.	Fedor V. Fomin, Michal Pilipczuk
2013	Long Circuits and Large Euler Subgraphs.	Fedor V. Fomin, Petr A. Golovach
2013	BICO: BIRCH Meets Coresets for k-Means Clustering.	Hendrik Fichtenberger, Marc Gill, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler
2013	Compressed Cache-Oblivious String B-tree.	Paolo Ferragina, Rossano Venturini
2013	Tractable Parameterizations for the Minimum Linear Arrangement Problem.	Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2013	Nearly Optimal Private Convolution.	Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov
2013	Network Bargaining with General Capacities.	Linda Farczadi, Konstantinos Georgiou, Jochen Knemann
2013	Table Cartograms.	William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek
2013	Maximizing a Submodular Function with Viability Constraints.	Wolfgang Dvork, Monika Henzinger, David P. Williamson
2013	FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations.	Hu Ding, Jinhui Xu
2013	Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract).	Marek Cygan, Fabrizio Grandoni, Danny Hermelin
2013	A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems.	Radu Curticapean, Marvin Knnemann

1,226–1,250 of 2,439← Previous Next →

Comparable venues

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