The following pages link to Algorithms – ESA 2007 (Q3527193):
Displayed 50 items.
- Nash Equilibria: Where We Stand (Q3527194) (← links)
- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation (Q3527195) (← links)
- Arrangements in Geometry: Recent Advances and Challenges (Q3527196) (← links)
- Nash Equilibria in Voronoi Games on Graphs (Q3527197) (← links)
- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation (Q3527198) (← links)
- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks (Q3527199) (← links)
- Finding Frequent Elements in Non-bursty Streams (Q3527200) (← links)
- On the Variance of Subset Sum Estimation (Q3527201) (← links)
- On Minimum Power Connectivity Problems (Q3527202) (← links)
- Finding Mobile Data: Efficiency vs. Location Inaccuracy (Q3527204) (← links)
- A Faster Query Algorithm for the Text Fingerprinting Problem (Q3527205) (← links)
- Polynomial Time Algorithms for Minimum Energy Scheduling (Q3527206) (← links)
- k-Mismatch with Don’t Cares (Q3527207) (← links)
- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover (Q3527209) (← links)
- Linear-Time Ranking of Permutations (Q3527211) (← links)
- Radix Sorting with No Extra Space (Q3527212) (← links)
- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation (Q3527213) (← links)
- Order Statistics in the Farey Sequences in Sublinear Time (Q3527214) (← links)
- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks (Q3527215) (← links)
- Dial a Ride from k-Forest (Q3527216) (← links)
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue (Q3527217) (← links)
- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication (Q3527218) (← links)
- Optimal Algorithms for k-Search with Application in Option Pricing (Q3527219) (← links)
- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra (Q3527220) (← links)
- Stackelberg Strategies for Atomic Congestion Games (Q3527221) (← links)
- Good Quality Virtual Realization of Unit Ball Graphs (Q3527222) (← links)
- Algorithms for Playing Games with Limited Randomness (Q3527224) (← links)
- Optimal Resilient Dynamic Dictionaries (Q3527225) (← links)
- Determining the Smallest k Such That G Is k-Outerplanar (Q3527226) (← links)
- On the Size of Succinct Indices (Q3527227) (← links)
- Compact Oracles for Approximate Distances Around Obstacles in the Plane (Q3527228) (← links)
- Convex Combinations of Single Source Unsplittable Flows (Q3527229) (← links)
- Farthest-Polygon Voronoi Diagrams (Q3527230) (← links)
- Equitable Revisited (Q3527231) (← links)
- Online Scheduling of Equal-Length Jobs on Parallel Machines (Q3527232) (← links)
- k-Anonymization with Minimal Loss of Information (Q3527233) (← links)
- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs (Q3527234) (← links)
- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling (Q3527235) (← links)
- Bundle Pricing with Comparable Items (Q3527236) (← links)
- Approximating Interval Scheduling Problems with Bounded Profits (Q3527237) (← links)
- Pricing Tree Access Networks with Connected Backbones (Q3527238) (← links)
- Distance Coloring (Q3527239) (← links)
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching (Q3527240) (← links)
- To Fill or Not to Fill: The Gas Station Problem (Q3527241) (← links)
- Online Bandwidth Allocation (Q3527246) (← links)
- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems (Q3527247) (← links)
- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems (Q3527248) (← links)
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs (Q3527249) (← links)
- Dynamic Plane Transitive Closure (Q3527250) (← links)
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments (Q3527251) (← links)