Algorithms - ESA 2007

Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks

Pages 41-52

Berenbrink, Petra (et al.)

Finding Frequent Elements in Non-bursty Streams

Pages 53-62

Panigrahy, Rina (et al.)

Tradeoffs and Average-Case Equilibria in Selfish Routing

Pages 63-74

Hoefer, Martin (et al.)

On the Variance of Subset Sum Estimation

Pages 75-86

Szegedy, Mario (et al.)

On Minimum Power Connectivity Problems

Pages 87-98

Lando, Yuval (et al.)

On the Cost of Interchange Rearrangement in Strings

Pages 99-110

Amir, Amihood (et al.)

Finding Mobile Data: Efficiency vs. Location Inaccuracy

Pages 111-122

Bar-Noy, Amotz (et al.)

A Faster Query Algorithm for the Text Fingerprinting Problem

Pages 123-135

Chan, Chi-Yuan (et al.)

Polynomial Time Algorithms for Minimum Energy Scheduling

Pages 136-150

Baptiste, Philippe (et al.)

k-Mismatch with Don’t Cares

Pages 151-162

Clifford, Raphaël (et al.)

Finding Branch-Decompositions and Rank-Decompositions

Pages 163-174

Hliněný, Petr (et al.)

Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover

Pages 175-186

Alon, Noga (et al.)

Linear-Time Ranking of Permutations

Pages 187-193

Mareš, Martin (et al.)

Radix Sorting with No Extra Space

Pages 194-205

Franceschini, Gianni (et al.)

Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation

Pages 206-217

Santis, Emilio (et al.)

Order Statistics in the Farey Sequences in Sublinear Time

Pages 218-229

Pawlewicz, Jakub

New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks

Pages 230-240

Puerto, Justo (et al.)

Dial a Ride from k-Forest

Pages 241-252

Gupta, Anupam (et al.)

Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue

Pages 253-264

Buchbinder, Niv (et al.)

Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication

Pages 265-274

Kowaluk, Mirosław (et al.)

Optimal Algorithms for k-Search with Application in Option Pricing

Pages 275-286

Lorenz, Julian (et al.)

Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra

Pages 287-298

Kaplan, Haim (et al.)

Stackelberg Strategies for Atomic Congestion Games

Pages 299-310

Fotakis, Dimitris

Good Quality Virtual Realization of Unit Ball Graphs

Pages 311-322

Pemmaraju, Sriram V. (et al.)

Algorithms for Playing Games with Limited Randomness

Pages 323-334

Kalyanaraman, Shankar (et al.)

Approximation of Partial Capacitated Vertex Cover

Pages 335-346

Bar-Yehuda, Reuven (et al.)

Optimal Resilient Dynamic Dictionaries

Pages 347-358

Brodal, Gerth Stølting (et al.)

Determining the Smallest k Such That G Is k-Outerplanar

Pages 359-370

Kammer, Frank

On the Size of Succinct Indices

Pages 371-382

Golynski, Alexander (et al.)

Compact Oracles for Approximate Distances Around Obstacles in the Plane

Pages 383-394

Thorup, Mikkel

Convex Combinations of Single Source Unsplittable Flows

Pages 395-406

Martens, Maren (et al.)

Farthest-Polygon Voronoi Diagrams

Pages 407-418

Cheong, Otfried (et al.)

Equitable Revisited

Pages 419-426

Bein, Wolfgang (et al.)

Online Scheduling of Equal-Length Jobs on Parallel Machines

Pages 427-438

Ding, Jihuan (et al.)

k-Anonymization with Minimal Loss of Information

Pages 439-450

Gionis, Aristides (et al.)

A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs

Pages 451-462

Elbassioni, Khaled (et al.)

Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling

Pages 463-474

Kobayashi, Koji (et al.)

Bundle Pricing with Comparable Items

Pages 475-486

Grigoriev, Alexander (et al.)

Approximating Interval Scheduling Problems with Bounded Profits

Pages 487-497

Beniaminy, Israel (et al.)

Pricing Tree Access Networks with Connected Backbones

Pages 498-509

Goyal, Vineet (et al.)

Distance Coloring

Pages 510-521

Sharp, Alexa

An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching

Pages 522-533

Bansal, Nikhil (et al.)

To Fill or Not to Fill: The Gas Station Problem

Pages 534-545

Khuller, Samir (et al.)

Online Bandwidth Allocation

Pages 546-557

Forišek, Michal (et al.)

Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems

Pages 558-569

Huang, Chien-Chung

On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

Pages 570-581

Israeli, Amos (et al.)

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

Pages 582-593

Gavoille, Cyril (et al.)

Dynamic Plane Transitive Closure

Pages 594-604

Diks, Krzysztof (et al.)

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments

Pages 605-617

Ausiello, Giorgio (et al.)

Estimating Clustering Indexes in Data Streams

Pages 618-632

Buriol, Luciana S. (et al.)

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

Pages 633-644

Dupont, Laurent (et al.)

Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step

Pages 645-656

Berberich, Eric (et al.)

Fast and Compact Oracles for Approximate Distances in Planar Graphs

Pages 657-668

Muller, Laurent Flindt (et al.)

Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces

Pages 669-680

Hachenberger, Peter

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks

Pages 681-692

Chimani, Markus (et al.)

Algorithms to Separate ${\{0,\frac{1}{2}\}}$-Chvátal-Gomory Cuts

Pages 693-704

Koster, Arie M. C. A. (et al.)

Fast Lowest Common Ancestor Computations in Dags

Pages 705-716

Eckhardt, Stefan (et al.)

A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem

Pages 717-728

Bazgan, Cristina (et al.)

Solutions to Real-World Instances of PSPACE-Complete Stacking

Pages 729-740

König, Felix G. (et al.)

Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough

Pages 741-753

Robert, Julien (et al.)

An Experimental Study of New and Known Online Packet Buffering Algorithms

Pages 754-765

Albers, Susanne (et al.)