Abstract is missing.
- External Geometric Data StructuresLars Arge. 1 [doi]
- The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT ProblemsJeong Han Kim. 2 [doi]
- Robust Geometric Computation Based on Digital TopologyKokichi Sugihara. 3-12 [doi]
- Adjacency of Optimal Regions for Huffman TreesKensuke Onishi. 13-22 [doi]
- A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDsPhilipp Woelfel. 23-32 [doi]
- Towards Constructing Optimal Strip Move SequencesMeena Mahajan, Raghavan Rama, S. Vijayakumar. 33-42 [doi]
- Large Triangles in the d-Dimensional Unit-CubeHanno Lefmann. 43-52 [doi]
- Progress on Maximum Weight TriangulationFrancis Y. L. Chin, Jianbo Qian, Cao An Wang. 53-61 [doi]
- Coloring OctreesUdo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic. 62-71 [doi]
- Some Open Problems in Decidability of Brick (Labelled Polyomino) CodesMalgorzata Moczurad, Wlodzimierz Moczurad. 72-81 [doi]
- Q-Ary Ulam-Rényi Game with Weighted Constrained LiesFerdinando Cicalese, Christian Deppe, Daniele Mundici. 82-91 [doi]
- Necessary and Sufficient Numbers of Cards for the Transformation ProtocolKoichi Koizumi, Takaaki Mizuki, Takao Nishizeki. 92-101 [doi]
- On the Selection and Assignment with Minimum Quantity CommitmentsAndrew Lim, Fan Wang, Zhou Xu. 102-111 [doi]
- Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental StudyYing Du, Danny Z. Chen, Xiaodong Wu. 112-121 [doi]
- Transshipment Through Crossdocks with Inventory and Time WindowsAndrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu. 122-131 [doi]
- Approximated Vertex Cover for Graphs with Perfect MatchingsTomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji. 132-142 [doi]
- An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected GraphsYong Zhang, Hong Zhu. 143-150 [doi]
- On the Arrangement of Cliques in Chordal Graphs with Respect to the CutsL. Sunil Chandran, N. S. Narayanaswamy. 151-160 [doi]
- The Worst-Case Time Complexity for Generating All Maximal CliquesEtsuji Tomita, Akira Tanaka, Haruhisa Takahashi. 161-170 [doi]
- Regular Expressions for Languages over Infinite AlphabetsMichael Kaminski, Tony Tan. 171-178 [doi]
- On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack OperationsMasaki Nakanishi. 179-186 [doi]
- Learning DNFs and Circuits Using Teaching AssistantsN. V. Vinodchandran. 188-197 [doi]
- On the Complexity of Samples for LearningJoel Ratsaby. 198-209 [doi]
- New Results on On-Demand Broadcasting with Deadline via Job Scheduling with CancellationWun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong. 210-218 [doi]
- Maximization of the Size and the Weight of Schedules of Degradable IntervalsFabien Baille, Evripidis Bampis, Christian Laforest. 219-228 [doi]
- Minimizing Maximum Lateness on Identical Parallel Batch Processing MachinesShuguang Li, Guojun Li, Shaoqiang Zhang. 229-237 [doi]
- Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal TerrainDanny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama. 238-248 [doi]
- Algorithms for Point Set Matching with k-DifferencesTatsuya Akutsu. 249-258 [doi]
- Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex PolygonHee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron. 259-267 [doi]
- The Traveling Salesman Problem with Few Inner PointsVladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger. 268-277 [doi]
- A Faster Algorithm for the All-Pairs Shortest Path Problem and Its ApplicationTadao Takaoka. 278-289 [doi]
- Algorithms for the On-Line Quota Traveling Salesman ProblemGiorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos. 290-299 [doi]
- On the Orthogonal Drawing of Outerplanar GraphsKumiko Nomura, Satoshi Tayu, Shuichi Ueno. 300-308 [doi]
- Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane GraphsKazuyuki Miura, Machiko Azuma, Takao Nishizeki. 309-318 [doi]
- New Bounds on the Number of Edges in a k-Map GraphZhi-Zhong Chen. 319-328 [doi]
- Dynamic Storage Allocation and On-Line Colouring Interval GraphsN. S. Narayanaswamy. 329-338 [doi]
- New Approximation Algorithms for Some Dynamic Storage Allocation ProblemsShuai Cheng Li, Hon Wai Leong, Steven K. Quek. 339-348 [doi]
- k-Center Problems with Minimum CoverageAndrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu. 349-359 [doi]
- On the Extensions of Solovay-Reducibility.Xizhong Zheng, Robert Rettinger. 360-369 [doi]
- The Complexity of Counting Solutions to Systems of Equations over Finite SemigroupsGustav Nordh, Peter Jonsson. 370-379 [doi]
- Computational Complexity Classification of Partition under Compaction and RetractionNarayan Vikas. 380-391 [doi]
- One-to-Many Disjoint Path Covers in a Graph with Faulty ElementsJung-Heum Park. 392-401 [doi]
- Fault-Tolerant Meshes with Constant DegreeToshinori Yamada. 402-411 [doi]
- Fault Hamiltonicity of Meshes with Two Wraparound Edges412-421 [doi]
- On the Expected Time for Herman s Probabilistic Self-stabilizing AlgorithmToshio Nakata. 422-431 [doi]
- An Efficient Online Algorithm for Square DetectionHo-Fung Leung, Zeshan Peng, Hing-Fung Ting. 432-439 [doi]
- An Efficient Local Alignment Algorithm for Masked SequencesJin Wook Kim, Kunsoo Park. 440-449 [doi]
- Computing Phylogenetic Roots with Bounded Degrees and Errors Is HardTatsuie Tsukiji, Zhi-Zhong Chen. 450-461 [doi]
- Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted TripletsJesper Jansson, Wing-Kin Sung. 462-472 [doi]