Abstract is missing.
- An Efficient QuasidictionaryTorben Hagerup, Rajeev Raman. 1-18 [doi]
- Combining Pattern Discovery and Probabilistic Modeling in Data MiningHeikki Mannila. 19 [doi]
- Time and Space Efficient Multi-method DispatchingStephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe. 20-29 [doi]
- Linear Time Approximation Schemes for Vehicle SchedulingJohn E. Augustine, Steven S. Seiden. 30-39 [doi]
- Minimizing Makespan for the Lazy Bureaucrat ProblemClint Hepner, Clifford Stein. 40-50 [doi]
- A PTAS for the Single Machine Scheduling Problem with Controllable Processing TimesMonaldo Mastrolilli. 51-59 [doi]
- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and TerrainsStephan Eidenbenz. 60-68 [doi]
- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2DPartha P. Goswami, Sandip Das, Subhas C. Nandy. 69-79 [doi]
- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal ChainsChristos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell. 80-89 [doi]
- Exact Algorithms and Approximation Schemes for Base Station Placement ProblemsNissan Lev-Tov, David Peleg. 90-99 [doi]
- A Factor-2 Approximation for Labeling Points with Maximum Sliding LabelsZhongping Qin, Binhai Zhu. 100-109 [doi]
- Optimal Algorithm for a Special Point-Labeling ProblemSasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy. 110-120 [doi]
- Random Arc Allocation and ApplicationsPeter Sanders, Berthold Vöcking. 121-130 [doi]
- On Neighbors in Geometric PermutationsMicha Sharir, Shakhar Smorodinsky. 131-139 [doi]
- Powers of Geometric Intersection Graphs and Dispersion AlgorithmsGeir Agnarsson, Peter Damaschke, Magnús M. Halldórsson. 140-149 [doi]
- Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar CaseJochen Alber, Michael R. Fellows, Rolf Niedermeier. 150-159 [doi]
- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are DangerousHajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger. 160-169 [doi]
- Approximation Hardness of the Steiner Tree Problem on GraphsMiroslav Chlebík, Janka Chlebíková. 170-179 [doi]
- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded GenusJohn A. Ellis, Hongbing Fan, Michael R. Fellows. 180-189 [doi]
- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation AlgorithmsHarold N. Gabow, Seth Pettie. 190-199 [doi]
- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular MatroidAlexander Golynski, Joseph Douglas Horton. 200-209 [doi]
- Approximation Algorithms for Edge-Dilation k-Center ProblemsJochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha. 210-219 [doi]
- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering AlgorithmSarnath Ramnath. 220-229 [doi]
- Improved Algorithms for the Random Cluster Graph ModelRon Shamir, Dekel Tsur. 230-239 [doi]
- Delta-List Vertex Coloring in Linear TimeSan Skulrattanakulchai. 240-248 [doi]
- Robot Localization without Depth PerceptionErik D. Demaine, Alejandro López-Ortiz, J. Ian Munro. 249-259 [doi]
- Online Parallel Heuristics and Robot Searching under the Competitive FrameworkAlejandro López-Ortiz, Sven Schuierer. 260-269 [doi]
- Analysis of Heuristics for the Freeze-Tag ProblemMarcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell. 270-279 [doi]
- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing ProblemsEsther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko. 280-287 [doi]
- All-Norm Approximation AlgorithmsYossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger. 288-297 [doi]
- Approximability of Dense Instances of NEAREST CODEWORD ProblemCristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski. 298-307 [doi]
- Call Control with k RejectionsR. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos. 308-317 [doi]
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner ProblemGuy Even, Guy Kortsarz, Wolfgang Slany. 318-327 [doi]
- Packet BundlingJens S. Frederiksen, Kim S. Larsen. 328-337 [doi]
- Algorithms for the Multi-constrained Routing ProblemAnuj Puri, Stavros Tripakis. 338-347 [doi]
- Computing the Threshold for q-Gram FiltersJuha Kärkkäinen. 348-357 [doi]
- On the Generality of Phylogenies from Incomplete Directed CharactersItsik Pe er, Ron Shamir, Roded Sharan. 358-367 [doi]
- Sorting with a ForkliftMichael H. Albert, Mike D. Atkinson. 368-377 [doi]
- Tree Decompositions with Small CostHans Leo Bodlaender, Fedor V. Fomin. 378-387 [doi]
- Computing the Treewidth and the Minimum Fill-in with the Modular DecompositionHans Leo Bodlaender, Udi Rotics. 388-397 [doi]
- Performance Tuning an Algorithm for Compressing Relational TablesJyrki Katajainen, Jeppe Nejsum Madsen. 398-407 [doi]
- A Randomized In-Place Algorithm for Positioning the kth Element in a MultisetJyrki Katajainen, Tomi Pasanen. 408-417 [doi]
- Paging on a RAM with Limited ResourcesTony W. Lai. 418-427 [doi]
- An Optimal Algorithm for Finding NCA on Pure Pointer MachinesAlessandro Dal Palù, Enrico Pontelli, Desh Ranjan. 428-438 [doi]
- Amortized Complexity of Bulk Updates in AVL-TreesEljas Soisalon-Soininen, Peter Widmayer. 439-448 [doi]