The following pages link to Algorithms – ESA 2012 (Q2912820):
Displayed 50 items.
- The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes (Q134868) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Routing regardless of network stability (Q487016) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- Locally correct Fréchet matchings (Q1624582) (← links)
- Data structures on event graphs (Q2350906) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Open Problems in Throughput Scheduling (Q2912821) (← links)
- Preemptive Coordination Mechanisms for Unrelated Machines (Q2912822) (← links)
- Hierarchical Hub Labelings for Shortest Paths (Q2912823) (← links)
- Bottleneck Non-crossing Matching in the Plane (Q2912824) (← links)
- Lower Bounds for Sorted Geometric Queries in the I/O Model (Q2912825) (← links)
- Constructing Street Networks from GPS Trajectories (Q2912826) (← links)
- I/O-efficient Hierarchical Diameter Approximation (Q2912827) (← links)
- Simplifying Massive Contour Maps (Q2912830) (← links)
- On Online Labeling with Polynomially Many Labels (Q2912834) (← links)
- A 5-Approximation for Capacitated Facility Location (Q2912835) (← links)
- Weighted Geometric Set Multi-cover via Quasi-uniform Sampling (Q2912836) (← links)
- A Bicriteria Approximation for the Reordering Buffer Problem (Q2912837) (← links)
- Time-Dependent Route Planning with Generalized Objective Functions (Q2912839) (← links)
- New Lower and Upper Bounds for Representing Sequences (Q2912840) (← links)
- Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection (Q2912841) (← links)
- The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations (Q2912842) (← links)
- Two Dimensional Range Minimum Queries and Fibonacci Lattices (Q2912843) (← links)
- The Clique Problem in Ray Intersection Graphs (Q2912845) (← links)
- Revenue Guarantees in Sponsored Search Auctions (Q2912846) (← links)
- Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite (Q2912847) (← links)
- Optimal Lower Bound for Differentially Private Multi-party Aggregation (Q2912848) (← links)
- Improved Distance Oracles and Spanners for Vertex-Labeled Graphs (Q2912852) (← links)
- The Quantum Query Complexity of Read-Many Formulas (Q2912853) (← links)
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees (Q2912854) (← links)
- A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems (Q2912855) (← links)
- Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes (Q2912856) (← links)
- Finding Social Optima in Congestion Games with Positive Externalities (Q2912857) (← links)
- Better Bounds for Graph Bisection (Q2912858) (← links)
- On the Complexity of Metric Dimension (Q2912859) (← links)
- Embedding Paths into Trees: VM Placement to Minimize Congestion (Q2912862) (← links)
- Faster Geometric Algorithms via Dynamic Determinant Computation (Q2912863) (← links)
- Lines through Segments in 3D Space (Q2912865) (← links)
- A Polynomial Kernel for Proper Interval Vertex Deletion (Q2912866) (← links)
- An Experimental Study of Dynamic Dominators (Q2912868) (← links)
- Optimizing over the Growing Spectrahedron (Q2912869) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q2912870) (← links)
- On Min-Power Steiner Tree (Q2912871) (← links)
- Maximum Multicommodity Flows over Time without Intermediate Storage (Q2912872) (← links)
- Approximating Earliest Arrival Flows in Arbitrary Networks (Q2912873) (← links)
- Resource Buying Games (Q2912874) (← links)
- Succinct Data Structures for Path Queries (Q2912875) (← links)