Abstract is missing.
- Designing Reliable Algorithms in Unreliable MemoriesIrene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano. 1-8 [doi]
- From Balanced Graph Partitioning to Balanced Metric LabelingJoseph Naor. 9 [doi]
- Fearful Symmetries: Quantum Computing, Factoring, and Graph IsomorphismCristopher Moore. 10 [doi]
- Exploring an Unknown Graph EfficientlyRudolf Fleischer, Gerhard Trippen. 11-22 [doi]
- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic RatioStefan Rührup, Christian Schindelhauer. 23-34 [doi]
- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum MulticutGarima Batra, Naveen Garg, Garima Gupta. 35-46 [doi]
- Relax-and-Cut for Capacitated Network DesignGeorg Kliewer, Larissa Timajev. 47-58 [doi]
- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion GamesGeorge Christodoulou, Elias Koutsoupias. 59-70 [doi]
- The Complexity of Games on Highly Regular GraphsKonstantinos Daskalakis, Christos H. Papadimitriou. 71-82 [doi]
- Computing Equilibrium Prices: Does Theory Meet Practice?Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan. 83-94 [doi]
- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch DecompositionsFrederic Dorn, Eelko Penninkx, Hans Leo Bodlaender, Fedor V. Fomin. 95-106 [doi]
- An Algorithm for the SAT Problem for Formulae of Linear LengthMagnus Wahlström. 107-118 [doi]
- Linear-Time Enumeration of Isolated CliquesHiro Ito, Kazuo Iwama, Tsuyoshi Osumi. 119-130 [doi]
- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded GraphsSergio Cabello, Bojan Mohar. 131-142 [doi]
- Delineating Boundaries for Imprecise RegionsIris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff. 143-154 [doi]
- EXACUS: Efficient and Exact Algorithms for Curves and SurfacesEric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert. 155-166 [doi]
- Min Sum Clustering with PenaltiesRefael Hassin, Einat Or. 167-178 [doi]
- Improved Approximation Algorithms for Metric Max TSPZhi-Zhong Chen, Takayuki Nagoya. 179-190 [doi]
- Unbalanced Graph CutsAra Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina. 191-202 [doi]
- Low Degree Connectivity in Ad-Hoc NetworksLudek Kucera. 203-214 [doi]
- 5-Regular Graphs are 3-Colorable with Positive ProbabilityJosep Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, Xavier Pérez, Dionisios G. Sotiropoulos. 215-225 [doi]
- Optimal Integer Alphabetic Trees in Linear TimeT. C. Hu, Lawrence L. Larmore, J. David Morgenthaler. 226-237 [doi]
- Predecessor Queries in Constant Time?Marek Karpinski, Yakov Nekrich. 238-248 [doi]
- An Algorithm for Node-Capacitated Ring RoutingAndrás Frank, Zoltán Király, Balázs Kotnyek. 249-258 [doi]
- On Degree Constrained Shortest PathsSamir Khuller, Kwangil Lee, Mark A. Shayman. 259-270 [doi]
- A New Template for Solving p-Median Problems for Trees in Sub-quadratic TimeRobert Benkoczi, Binay K. Bhattacharya. 271-282 [doi]
- Roll Cutting in the Curtain IndustryArianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger. 283-292 [doi]
- Space Efficient Algorithms for the Burrows-Wheeler BacktransformationUlrich Lauther, Tamás Lukovszki. 293-304 [doi]
- Cache-Oblivious Comparison-Based Algorithms on MultisetsArash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro. 305-316 [doi]
- Oblivious vs. Distribution-Based Sorting: An Experimental EvaluationGeeta Chaudhry, Thomas H. Cormen. 317-328 [doi]
- Allocating Memory in a Lock-Free MannerAnders Gidenstam, Marina Papatriantafilou, Philippas Tsigas. 329-342 [doi]
- Generating Realistic Terrains with Higher-Order Delaunay TriangulationsThierry de Kok, Marc J. van Kreveld, Maarten Löffler. 343-354 [doi]
- I/O-Efficient Construction of Constrained Delaunay TriangulationsPankaj K. Agarwal, Lars Arge, Ke Yi. 355-366 [doi]
- Convex Hull and Voronoi Diagram of Additively Weighted PointsJean-Daniel Boissonnat, Christophe Delage. 367-378 [doi]
- New Tools and Simpler Algorithms for BranchwidthChristophe Paul, Jan Arne Telle. 379-390 [doi]
- Treewidth Lower Bounds with BramblesHans Leo Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster. 391-402 [doi]
- Minimal Interval CompletionsPinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger. 403-414 [doi]
- A 2-Approximation Algorithm for Sorting by Prefix ReversalsJohannes Fischer, Simon W. Ginzinger. 415-425 [doi]
- Approximating the 2-Interval Pattern ProblemMaxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette. 426-437 [doi]
- A Loopless Gray Code for Minimal Signed-Binary RepresentationsGurmeet Singh Manku, Joe Sawada. 438-447 [doi]
- Efficient Approximation Schemes for Geometric Problems?Dániel Marx. 448-459 [doi]
- Geometric Clustering to Minimize the Sum of Cluster SizesVittorio Bilò, Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos. 460-471 [doi]
- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar GraphsAndré Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao. 472-483 [doi]
- Packet Routing and Information Gathering in Lines, Rings and TreesYossi Azar, Rafi Zachut. 484-495 [doi]
- Jitter Regulation for Multiple StreamsDavid Hay, Gabriel Scalosub. 496-507 [doi]
- Efficient c-Oriented Range Searching with DOP-TreesMark de Berg, Herman J. Haverkort, Micha Streppel. 508-519 [doi]
- Matching Point Sets with Respect to the Earth Mover s DistanceSergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote. 520-531 [doi]
- Small Stretch Spanners on Dynamic GraphsGiorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano. 532-543 [doi]
- An Experimental Study of Algorithms for Fully Dynamic Transitive ClosureIoannis Krommidas, Christos D. Zaroliagis. 544-555 [doi]
- Experimental Study of Geometric ::::t::::-SpannersMohammad Farshi, Joachim Gudmundsson. 556-567 [doi]
- Highway Hierarchies Hasten Exact Shortest Path QueriesPeter Sanders, Dominik Schultes. 568-579 [doi]
- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration DelaysAleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters. 580-591 [doi]
- Fairness-Free Periodic Scheduling with VacationsJiri Sgall, Hadas Shachnai, Tami Tamir. 592-603 [doi]
- Online Bin Packing with Cardinality ConstraintsLeah Epstein. 604-615 [doi]
- Fast Monotone 3-Approximation Algorithm for Scheduling Related MachinesAnnamária Kovács. 616-627 [doi]
- Engineering Planar Separator AlgorithmsMartin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis. 628-639 [doi]
- : Standard Template Library for XXL Data SetsRoman Dementiev, Lutz Kettner, Peter Sanders. 640-651 [doi]
- Negative Cycle Detection ProblemChi-Him Wong, Yiu-Cheong Tam. 652-663 [doi]
- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game TreesFerdinando Cicalese, Eduardo Sany Laber. 664-676 [doi]
- Online View Maintenance Under a Response-Time ConstraintKamesh Munagala, Jun Yang, Hai Yu. 677-688 [doi]
- Online Primal-Dual Algorithms for Covering and Packing ProblemsNiv Buchbinder, Joseph Naor. 689-701 [doi]
- Efficient Algorithms for Shared Backup Allocation in Networks with Partial InformationYigal Bejerano, Joseph Naor, Alexander Sprintson. 702-713 [doi]
- Using Fractional Primal-Dual to Schedule Split Intervals with DemandsReuven Bar-Yehuda, Dror Rawitz. 714-725 [doi]
- An Approximation Algorithm for the Minimum Latency Set Cover ProblemRefael Hassin, Asaf Levin. 726-733 [doi]
- Workload-Optimal Histograms on StreamsS. Muthukrishnan, Martin Strauss, X. Zheng. 734-745 [doi]
- Finding Frequent Patterns in a String in Sublinear TimePetra Berenbrink, Funda Ergün, Tom Friedetzky. 746-757 [doi]
- Online Occlusion CullingGereon Frahling, Jens Krokowski. 758-769 [doi]
- Shortest Paths in Matrix Multiplication TimePiotr Sankowski. 770-778 [doi]
- Computing Common Intervals of ::::K:::: Permutations, with Applications to Modular Decomposition of GraphsAnne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot. 779-790 [doi]
- Greedy Routing in Tree-Decomposed GraphsPierre Fraigniaud. 791-802 [doi]
- Making Chord Robust to Byzantine AttacksAmos Fiat, Jared Saia, Maxwell Young. 803-814 [doi]
- Bucket Game with Applications to Set Multicover and Dynamic Page MigrationMarcin Bienkowski, Jaroslaw Byrka. 815-826 [doi]
- Bootstrapping a Hop-Optimal Network in the Weak Sensor ModelMartin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro. 827-838 [doi]
- Approximating Integer Quadratic Programs and MAXCUT in Subdense GraphsAndreas Björklund. 839-849 [doi]
- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment ProblemAlain Faye, Frédéric Roupin. 850-861 [doi]
- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and KnapsackHassene Aissi, Cristina Bazgan, Daniel Vanderpooten. 862-873 [doi]
- Robust Approximate ZerosVikram Sharma, Zilin Du, Chee-Keng Yap. 874-886 [doi]
- Optimizing a 2D Function Satisfying Unimodality PropertiesErik D. Demaine, Stefan Langerman. 887-898 [doi]