Table of Contents

• A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical ComputingMichael R. Fellows. 1-2 [doi]
• Algorithmic Aspects of Web Search EnginesMonika Rauch Henzinger. 3 [doi]
• Efficient Tradeoff Schemes in Data Structures for Querying Moving ObjectsPankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu. 4-15 [doi]
• Swap and Mismatch Edit DistanceAmihood Amir, Estrella Eisenberg, Ely Porat. 16-27 [doi]
• Path Decomposition Under a New Cost Measure with Applications to Optical Network DesignElliot Anshelevich, Lisa Zhang. 28-39 [doi]
• Optimal External Memory Planar Point EnclosureLars Arge, Vasilis Samoladas, Ke Yi. 40-52 [doi]
• Maximizing Throughput in Multi-queue SwitchesYossi Azar, Arik Litichevskey. 53-64 [doi]
• An Improved Algorithm for CIOQ SwitchesYossi Azar, Yossi Richter. 65-76 [doi]
• Labeling Smart DustVikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler. 77-88 [doi]
• Graph Decomposition Lemmas and Their Role in Metric Embedding MethodsYair Bartal. 89-97 [doi]
• Modeling Locality: A Probabilistic Analysis of LRU and FWFLuca Becchetti. 98-109 [doi]
• An Algorithm for Computing DNA WalksAnkur Bhargava, S. Rao Kosaraju. 110-121 [doi]
• Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related ProblemsEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich. 122-133 [doi]
• Direct Routing: Algorithms and ComplexityCostas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis. 134-145 [doi]
• Lower Bounds for Embedding into Distributions over Excluded Minor Graph FamiliesDouglas E. Carroll, Ashish Goel. 146-156 [doi]
• A Parameterized Algorithm for Upward Planarity TestingHubert Y. Chan 0002. 157-168 [doi]
• Fisher Equilibrium Price with a Class of Concave Utility FunctionsNing Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao. 169-179 [doi]
• Hardness and Approximation Results for Packing Steiner TreesJoseph Cheriyan, Mohammad R. Salavatipour. 180-191 [doi]
• Approximation Hardness of Dominating Set ProblemsMiroslav Chlebík, Janka Chlebíková. 192-203 [doi]
• Improved Online Algorithms for Buffer Management in QoS SwitchesMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý. 204-215 [doi]
• Time Dependent Multi Scheduling of MulticastRami Cohen, Dror Rawitz, Danny Raz. 216-227 [doi]
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot SystemsReuven Cohen, David Peleg. 228-239 [doi]
• The Average Case Analysis of Partition SortsRichard Cole, David C. Kandathil. 240-251 [doi]
• A Fast Distributed Algorithm for Approximating the Maximum MatchingAndrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska. 252-263 [doi]
• Extreme Points Under Random NoiseValentina Damerow, Christian Sohler. 264-274 [doi]
• Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-ColoringsJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. 275-286 [doi]
• On Variable-Sized Multidimensional PackingLeah Epstein, Rob van Stee. 287-298 [doi]
• An Inductive Construction for Plane Laman Graphs via Vertex SplittingZsolt Fekete, Tibor Jordán, Walter Whiteley. 299-310 [doi]
• Faster Fixed-Parameter Tractable Algorithms for Matching and Packing ProblemsMichael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides. 311-322 [doi]
• On the Evolution of Selfish RoutingSimon Fischer, Berthold Vöcking. 323-334 [doi]
• Competitive Online Approximation of the Optimal Search RatioRudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen. 335-346 [doi]
• Incremental Algorithms for Facility Location and k-MedianDimitris Fotakis. 347-358 [doi]
• Dynamic Shannon CodingTravis Gagie. 359-370 [doi]
• Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative EntriesNaveen Garg, Rohit Khandekar. 371-382 [doi]
• Negotiation-Range Mechanisms: Coalition-Resistant MarketsRica Gonen. 383-394 [doi]
• Approximation Algorithms for Quickest Spanning Tree ProblemsRefael Hassin, Asaf Levin. 395-402 [doi]
• An Approximation Algorithm for Maximum Triangle PackingRefael Hassin, Shlomi Rubinstein. 403-413 [doi]
• Approximate Parameterized MatchingCarmit Hazay, Moshe Lewenstein, Dina Sokol. 414-425 [doi]
• Approximation of Rectangle Stabbing and Interval Stabbing ProblemsSofia Kovaleva, Frits C. R. Spieksma. 426-435 [doi]
• Fast 3-Coloring Triangle-Free Planar GraphsLukasz Kowalik. 436-447 [doi]
• Approximate Unions of Lines and Minkowski SumsMarc J. van Kreveld, A. Frank van der Stappen. 448-459 [doi]
• Radio Network Clustering from ScratchFabian Kuhn, Thomas Moscibroda, Roger Wattenhofer. 460-471 [doi]
• Seeking a Vertex of the Planar Matching Polytope in NCRaghav Kulkarni, Meena Mahajan. 472-483 [doi]
• Equivalence of Search Capability Among Mobile Guards with Various VisibilitiesJae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa. 484-495 [doi]
• Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous ProcessorsJunning Liu, Micah Adler. 496-507 [doi]
• On the Stability of Multiple Partner Stable Marriages with TiesVarun S. Malhotra. 508-519 [doi]
• Flows on Few Paths: Algorithms and Lower BoundsMaren Martens, Martin Skutella. 520-531 [doi]
• Maximum Matchings in Planar Graphs via Gaussian EliminationMarcin Mucha, Piotr Sankowski. 532-543 [doi]
• Fast Multipoint Evaluation of Bivariate PolynomialsMichael Nüsken, Martin Ziegler. 544-555 [doi]
• On Adaptive Integer SortingAnna Pagh, Rasmus Pagh, Mikkel Thorup. 556-579 [doi]
• Tiling a Polygon with Two Kinds of RectanglesEric Rémila. 568-579 [doi]
• On Dynamic Shortest Paths ProblemsLiam Roditty, Uri Zwick. 580-591 [doi]
• Uniform Algorithms for Deterministic Construction of Efficient DictionariesMilan Ruzic. 592-603 [doi]
• Fast Sparse Matrix MultiplicationRaphael Yuster, Uri Zwick. 604-615 [doi]
• An Experimental Study of Random Knapsack ProblemsRené Beier, Berthold Vöcking. 616-627 [doi]
• Contraction and Treewidth Lower BoundsHans Leo Bodlaender, Arie M. C. A. Koster, Thomas Wolle. 628-639 [doi]
• Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous NetworksRobert Elsässer, Burkhard Monien, Stefan Schamberger. 640-651 [doi]
• Comparing Real Algebraic Numbers of Small DegreeIoannis Z. Emiris, Elias P. Tsigaridas. 652-663 [doi]
• Code Flexibility and Program Efficiency by Genericity: Improving Cgal s ArrangementsEfi Fogel, Ron Wein, Dan Halperin. 664-676 [doi]
• Finding Dominators in PracticeLoukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August. 677-688 [doi]
• Data Migration on Parallel DisksLeana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan. 689-701 [doi]
• Classroom Examples of Robustness Problems in Geometric ComputationsLutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap. 702-713 [doi]
• Stable Minimum Storage Merging by Symmetric ComparisonsPok-Son Kim, Arne Kutzner. 714-723 [doi]
• On Rectangular CartogramsMarc J. van Kreveld, Bettina Speckmann. 724-735 [doi]
• Multi-word Atomic Read/Write Registers on Multiprocessor SystemsAndreas Larsson, Anders Gidenstam, Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas. 736-748 [doi]
• Beyond Optimal Play in Two-Person-Zerosum GamesUlf Lorenz. 749-759 [doi]
• Solving Geometric Covering Problems by Data ReductionSteffen Mecke, Dorothea Wagner. 760-771 [doi]
• Efficient IP Table Lookup via Adaptive Stratified Trees with Selective ReconstructionsMarco Pellegrini, Giordano Fusco. 772-783 [doi]
• Super Scalar Sample SortPeter Sanders, Sebastian Winkel. 784-796 [doi]
• Construction of Minimum-Weight SpannersMikkel Sigurd, Martin Zachariasen. 797-808 [doi]
• A Straight Skeleton Approximating the Medial AxisMirela Tanase, Remco C. Veltkamp. 809-821 [doi]
• Non-additive Shortest PathsGeorge Tsaggouris, Christos D. Zaroliagis. 822-834 [doi]