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.

The Empirical Validation Gap 27
Transitioning from Monte Carlo to Deterministic Graph Algorithms 15
Proving Computational Intractability Through Hardness Reductions 11
Proving Algorithmic Optimality via Complexity Conjectures 9
From Fractional Solutions to Discrete Decisions 9
Dynamic Programming on Tree Decompositions 7
Tightening Theoretical Bounds by Optimizing Constant Factors 7
Incremental Maintenance of Dynamic Graph Indices 7
The Empirical Validation Gap in Algorithmic Design 7
Closing the Optimality Gap in Online Algorithms 6
Managing Hidden Constant Overhead in Algorithm Design 6
Irrevocable Decisions in Online Resource Allocation 6
Online Optimization Under Adversarial Arrival Orders 5
Generalizing Graph Algorithms to Directed and Weighted Networks 5
Graph Algorithms Under Semi-Streaming Space Constraints 5

Top Authors

AuthorPapers
Monika Henzinger23
Kurt Mehlhorn19
Haim Kaplan17
MohammadTaghi Hajiaghayi12
Piotr Sankowski11
Yossi Azar11
Rasmus Pagh9
Christoph Dürr7
Heiko Röglin7
Meirav Zehavi7
Michael Mitzenmacher7
Nitin Nitin7
George Christodoulou6
Gramoz Goranci6
Haitao Wang6
Jeff M. Phillips6
Robert Ganian6
T-H. Hubert Chan6
Anupam Gupta5
Assaf Schuster5

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Scheduling for Flow-Time with Admission Control2003
Semi-clairvoyant Scheduling2003
Streaming Geometric Optimization Using Graphics Hardware2003
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons2002
Approximation Algorithms for k-Line Center2002
A Primal Approach to the Stable Set Problem2002
Balanced-Replication Algorithms for Distribution Trees2002
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router2002
External-Memory Breadth-First Search with Sublinear I/O2002
Geometric Algorithms for Density-Based Data Clustering2002
Kinetic Medians and kd-Trees2002
Near-Linear Time Approximation Algorithms for Curve Simplification2002
Non-independent Randomized Rounding and an Application to Digital Halftoning2002
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy2002
Partial Alphabetic Trees2002
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors2002
Range Searching in Categorical Data: Colored Range Searching on Grid2002
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy2002
SCIL - Symbolic Constraints in Integer Linear Programming2002
Translating a Planar Object to Maximize Point Containment2002
Truthful and Competitive Double Auctions2002
Two Simplified Algorithms for Maintaining Order in a List2002
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs2001
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms2001
A Separation Bound for Real Algebraic Expressions2001
Competitive Auctions for Multiple Digital Goods2001
Computing Cycle Covers without Short Cycles2001
Cuckoo Hashing2001
Lossy Dictionaries2001
Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation2001
On the Approximability of the Minimum Test Collection Problem2001
Packing Cycles and Cuts in Undirected Graphs2001
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts2000
On Multicriteria Online Problems2000
Polygon Decomposition for Efficient Construction of Minkowski Sums2000
Resource Constrained Shortest Paths2000
Web Information Retrieval - an Algorithmic Perspective2000
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design1999
Efficient Approximation Algorithms for the Achromatic Number1999
Off-Line Temporary Tasks Assignment1999
On 2-Coverings and 2-Packings of Laminar Families1999
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees1999
Strategies for Searching with Different Access Costs1999
An Experimental Study of Dynamic Algorithms for Directed Graphs1998
Augmenting Suffix Trees, with Applications1998
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice1998
Design and Analysis of Dynamic Processes: A Stochastic Approach1998
Evaluating Server-Assisted Cache Replacement in the Web1998
Finding an Optimal Path without Growing the Tree1998
Fitting Points on the Real Line and Its Application to RH Mapping1998

« prev Page 12/13 next »