Abstract is missing.
- Nash Equilibria: Where We StandChristos H. Papadimitriou. 1 [doi]
- Small Worlds as Navigable Augmented Networks: Model, Analysis, and ValidationPierre Fraigniaud. 2-11 [doi]
- Arrangements in Geometry: Recent Advances and ChallengesMicha Sharir. 12-16 [doi]
- Nash Equilibria in Voronoi Games on GraphsChristoph Dürr, Nguyen Kim Thang. 17-28 [doi]
- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche FormationPetra Berenbrink, Oliver Schulte. 29-40 [doi]
- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted TasksPetra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu. 41-52 [doi]
- Finding Frequent Elements in Non-bursty StreamsRina Panigrahy, Dilys Thomas. 53-62 [doi]
- Tradeoffs and Average-Case Equilibria in Selfish RoutingMartin Hoefer, Alexander Souza. 63-74 [doi]
- On the Variance of Subset Sum EstimationMario Szegedy, Mikkel Thorup. 75-86 [doi]
- On Minimum Power Connectivity ProblemsYuval Lando, Zeev Nutov. 87-98 [doi]
- On the Cost of Interchange Rearrangement in StringsAmihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat. 99-110 [doi]
- Finding Mobile Data: Efficiency vs. Location InaccuracyAmotz Bar-Noy, Joanna Klukowska. 111-122 [doi]
- A Faster Query Algorithm for the Text Fingerprinting ProblemChi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang. 123-135 [doi]
- Polynomial Time Algorithms for Minimum Energy SchedulingPhilippe Baptiste, Marek Chrobak, Christoph Dürr. 136-150 [doi]
- ::::k:::: -Mismatch with Don t CaresRaphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild. 151-162 [doi]
- Finding Branch-Decompositions and Rank-DecompositionsPetr Hlinený, Sang-il Oum. 163-174 [doi]
- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex CoverNoga Alon, Raphael Yuster. 175-186 [doi]
- Linear-Time Ranking of PermutationsMartin Mares, Milan Straka. 187-193 [doi]
- Radix Sorting with No Extra SpaceGianni Franceschini, S. Muthukrishnan, Mihai Patrascu. 194-205 [doi]
- Fast Low Degree Connectivity of Ad-Hoc Networks Via PercolationEmilio De Santis, Fabrizio Grandoni, Alessandro Panconesi. 206-217 [doi]
- Order Statistics in the Farey Sequences in Sublinear TimeJakub Pawlewicz. 218-229 [doi]
- New Results on Minimax Regret Single Facility Ordered Median Location Problems on NetworksJusto Puerto, Antonio M. Rodríguez-Chía, Arie Tamir. 230-240 [doi]
- Dial a Ride from ::::k:::: -ForestAnupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi. 241-252 [doi]
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions RevenueNiv Buchbinder, Kamal Jain, Joseph Naor. 253-264 [doi]
- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix MultiplicationMiroslaw Kowaluk, Andrzej Lingas. 265-274 [doi]
- Optimal Algorithms for ::::k:::: -Search with Application in Option PricingJulian Lorenz, Konstantinos Panagiotou, Angelika Steger. 275-286 [doi]
- Linear Data Structures for Fast Ray-Shooting Amidst Convex PolyhedraHaim Kaplan, Natan Rubin, Micha Sharir. 287-298 [doi]
- Stackelberg Strategies for Atomic Congestion GamesDimitris Fotakis. 299-310 [doi]
- Good Quality Virtual Realization of Unit Ball GraphsSriram V. Pemmaraju, Imran A. Pirwani. 311-322 [doi]
- Algorithms for Playing Games with Limited RandomnessShankar Kalyanaraman, Christopher Umans. 323-334 [doi]
- Approximation of Partial Capacitated Vertex CoverReuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz. 335-346 [doi]
- Optimal Resilient Dynamic DictionariesGerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave. 347-358 [doi]
- Determining the Smallest ::::k:::: Such That ::::G:::: Is ::::k:::: -OuterplanarFrank Kammer. 359-370 [doi]
- On the Size of Succinct IndicesAlexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao. 371-382 [doi]
- Compact Oracles for Approximate Distances Around Obstacles in the PlaneMikkel Thorup. 383-394 [doi]
- Convex Combinations of Single Source Unsplittable FlowsMaren Martens, Fernanda Salazar, Martin Skutella. 395-406 [doi]
- Farthest-Polygon Voronoi DiagramsOtfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na. 407-418 [doi]
- Equitable RevisitedWolfgang W. Bein, Lawrence L. Larmore, John Noga. 419-426 [doi]
- Online Scheduling of Equal-Length Jobs on Parallel MachinesJihuan Ding, Tomás Ebenlendr, Jiri Sgall, Guochuan Zhang. 427-438 [doi]
- ::::k:::: -Anonymization with Minimal Loss of InformationAristides Gionis, Tamir Tassa. 439-450 [doi]
- A Quasi-PTAS for Profit-Maximizing Pricing on Line GraphsKhaled M. Elbassioni, René Sitters, Yan Zhang. 451-462 [doi]
- Improved Upper Bounds on the Competitive Ratio for Online Realtime SchedulingKoji Kobayashi, Kazuya Okamoto. 463-474 [doi]
- Bundle Pricing with Comparable ItemsAlexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld. 475-486 [doi]
- Approximating Interval Scheduling Problems with Bounded ProfitsIsrael Beniaminy, Zeev Nutov, Meir Ovadia. 487-497 [doi]
- Pricing Tree Access Networks with Connected BackbonesVineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi. 498-509 [doi]
- Distance ColoringAlexa Sharp. 510-521 [doi]
- An ::::O:::: (log:::2::: ::::k:::: )-Competitive Algorithm for Metric Bipartite MatchingNikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor. 522-533 [doi]
- To Fill or Not to Fill: The Gas Station ProblemSamir Khuller, Azarakhsh Malekian, Julián Mestre. 534-545 [doi]
- Online Bandwidth AllocationMichal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan. 546-557 [doi]
- Two s Company, Three s a Crowd: Stable Family and Threesome Roommates ProblemsChien-Chung Huang. 558-569 [doi]
- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX SystemsAmos Israeli, Dror Rawitz, Oran Sharon. 570-581 [doi]
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth GraphsCyril Gavoille, Arnaud Labourel. 582-593 [doi]
- Dynamic Plane Transitive ClosureKrzysztof Diks, Piotr Sankowski. 594-604 [doi]
- Small Stretch Spanners in the Streaming Model: New Algorithms and ExperimentsGiorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. 605-617 [doi]
- Estimating Clustering Indexes in Data StreamsLuciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler. 618-632 [doi]
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of QuadricsLaurent Dupont, Michael Hemmer, Sylvain Petitjean, Elmar Schömer. 633-644 [doi]
- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First StepEric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein. 645-656 [doi]
- Fast and Compact Oracles for Approximate Distances in Planar GraphsLaurent Flindt Muller, Martin Zachariasen. 657-668 [doi]
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex PiecesPeter Hachenberger. 669-680 [doi]
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner NetworksMarkus Chimani, Maria Kandyba, Petra Mutzel. 681-692 [doi]
- Algorithms to Separate {0, 1/2}-Chvátal-Gomory CutsArie M. C. A. Koster, Adrian Zymolka, Manuel Kutschka. 693-704 [doi]
- Fast Lowest Common Ancestor Computations in DagsStefan Eckhardt, Andreas Michael Mühling, Johannes Nowak. 705-716 [doi]
- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack ProblemCristina Bazgan, Hadrien Hugot, Daniel Vanderpooten. 717-728 [doi]
- Solutions to Real-World Instances of PSPACE-Complete StackingFelix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke. 729-740 [doi]
- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair EnoughJulien Robert, Nicolas Schabanel. 741-753 [doi]
- An Experimental Study of New and Known Online Packet Buffering AlgorithmsSusanne Albers, Tobias Jacobs. 754-765 [doi]