Abstract is missing.
- Towards a Theory of AlgorithmsAllan Borodin. 1 [doi]
- k-Restricted Rotation with an Application to Search Tree RebalancingAlejandro Almeida Ruiz, Fabrizio Luccio, Antonio Mesa Enriques, Linda Pagli. 2-13 [doi]
- Heap Building BoundsZhentao Li, Bruce A. Reed. 14-23 [doi]
- The Multi-radius Cover ProblemRefael Hassin, Danny Segev. 24-35 [doi]
- Parameterized Complexity of Generalized Vertex Cover ProblemsJiong Guo, Rolf Niedermeier, Sebastian Wernicke. 36-48 [doi]
- The Complexity of Implicit and Space Efficient Priority QueuesChristian Worm Mortensen, Seth Pettie. 49-60 [doi]
- Analysis of a Class of Tries with Adaptive Multi-digit BranchingYuriy A. Reznik. 61-72 [doi]
- Balanced Aspect Ratio Trees RevisitedAmitabh Chaudhary, Michael T. Goodrich. 73-85 [doi]
- Improved Combinatorial Group Testing for Real-World Problem SizesDavid Eppstein, Michael T. Goodrich, Daniel S. Hirschberg. 86-98 [doi]
- Parameterized Counting Algorithms for General Graph Covering ProblemsNaomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. 99-109 [doi]
- Approximating the Online Set Multicover Problems via Randomized WinnowingPiotr Berman, Bhaskar DasGupta. 110-121 [doi]
- Max-stretch Reduction for Tree SpannersKazuo Iwama, Andrzej Lingas, Masaki Okita. 122-133 [doi]
- Succinct Representation of Triangulations with a BoundaryLuca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. 134-145 [doi]
- Line-Segment Intersection Made In-PlaceJan Vahrenhold. 146-157 [doi]
- Improved Fixed-Parameter Algorithms for Two Feedback Set ProblemsJiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke. 158-168 [doi]
- Communication-Aware Processor Allocation for SupercomputersMichael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips. 169-181 [doi]
- Dynamic HotlinksKarim Douïeb, Stefan Langerman. 182-194 [doi]
- The Minimum-Area Spanning Tree ProblemPaz Carmi, Matthew J. Katz, Joseph S. B. Mitchell. 195-204 [doi]
- Hinged Dissection of PolypolyhedraErik D. Demaine, Martin L. Demaine, Jeffrey F. Lindy, Diane L. Souvaine. 205-217 [doi]
- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and AlgorithmsShlomo Moran, Sagi Snir. 218-232 [doi]
- Linear Time Algorithms for Generalized Edge Dominating Set ProblemsAndré Berger, Ojas Parekh. 233-243 [doi]
- On Geometric Dilation and Halving ChordsAdrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote. 244-255 [doi]
- Orthogonal Subdivisions with Low Stabbing NumbersCsaba D. Tóth. 256-268 [doi]
- Kinetic and Dynamic Data Structures for Convex Hulls and Upper EnvelopesGiora Alexandron, Haim Kaplan, Micha Sharir. 269-281 [doi]
- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded LengthVictor Chepoi, Bertrand Estellon, Yann Vaxès. 282-293 [doi]
- A Dynamic Implicit Adjacency Labelling Scheme for Line GraphsDavid Morgan. 294-305 [doi]
- The On-line Asymmetric Traveling Salesman ProblemGiorgio Ausiello, Vincenzo Bonifaci, Luigi Laura. 306-317 [doi]
- All-Pairs Shortest Paths with Real Weights in ::::O::::(::::n:::::::3:::/log ::::n::::) TimeTimothy M. Chan. 318-324 [doi]
- ::::k::::-Link Shortest Paths in Weighted SubdivisionsOvidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. 325-337 [doi]
- Power-Saving Scheduling for Weakly Dynamic Voltage Scaling DevicesJian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu. 338-349 [doi]
- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover ProblemsMarkus Bläser, L. Shankar Ram, Maxim Sviridenko. 350-359 [doi]
- On the Vehicle Routing ProblemPiotr Berman, Surajit K. Das. 360-371 [doi]
- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability CaseMordecai J. Golin, Zhenming Liu. 372-384 [doi]
- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting AlgorithmsGerth Stølting Brodal, Gabriel Moruz. 385-395 [doi]
- Derandomization of Dimensionality Reduction and SDP Based AlgorithmsAnkur Bhargava, S. Rao Kosaraju. 396-408 [doi]
- Subquadratic Algorithms for 3SUMIlya Baran, Erik D. Demaine, Mihai Patrascu. 409-421 [doi]
- Near-Optimal Pricing in Near-Linear TimeJason D. Hartline, Vladlen Koltun. 422-431 [doi]
- Improved Approximation Bounds for Planar Point Pattern MatchingMinkyoung Cho, David M. Mount. 432-443 [doi]