The following pages link to Algorithms - ESA 2015 (Q3452762):
Displaying 50 items.
- Computing the similarity between moving curves (Q1615772) (← links)
- Exact Minkowski sums of polygons with holes (Q1615780) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Explicit expanding expanders (Q2408170) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Improved Approximation Algorithms for Stochastic Matching (Q3452763) (← links)
- Sorting and Permuting without Bank Conflicts on GPUs (Q3452764) (← links)
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons (Q3452765) (← links)
- Buffer Management for Packets with Processing Times (Q3452767) (← links)
- A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem (Q3452768) (← links)
- λ > 4 (Q3452770) (← links)
- Revenue Maximization for Selling Multiple Correlated Items (Q3452771) (← links)
- Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm (Q3452773) (← links)
- Towards Tight Lower Bounds for Scheduling Problems (Q3452775) (← links)
- Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
- Fully-Dynamic Approximation of Betweenness Centrality (Q3452779) (← links)
- Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
- Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
- Upper and Lower Bounds for Online Routing on Delaunay Triangulations (Q3452783) (← links)
- On Computing the Hyperbolicity of Real-World Graphs (Q3452784) (← links)
- Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- An Improved Approximation Algorithm for Knapsack Median Using Sparsification (Q3452792) (← links)
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems (Q3452793) (← links)
- Self-Adjusting Binary Search Trees: What Makes Them Tick? (Q3452794) (← links)
- On Element-Connectivity Preserving Graph Simplification (Q3452796) (← links)
- On Randomized Algorithms for Matching in the Online Preemptive Model (Q3452797) (← links)
- A Characterization of Consistent Digital Line Segments in ℤ2 (Q3452798) (← links)
- On the Efficiency of All-Pay Mechanisms (Q3452799) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface (Q3452802) (← links)
- Polymatroid Prophet Inequalities (Q3452806) (← links)
- Node-Balancing by Edge-Increments (Q3452807) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Selfish Vector Packing (Q3452809) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- Prophet Secretary (Q3452813) (← links)
- Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem (Q3452814) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints (Q3452817) (← links)
