Abstract is missing.
- Theoretical Problems Related to the InternetChristos H. Papadimitriou. 1-2 [doi]
- Recent Progress and Prospects for Integer Factorisation AlgorithmsRichard P. Brent. 3-22 [doi]
- Approximating Uniform Triangular Meshes in PolygonsFranz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu. 23-33 [doi]
- Maximum Induced Matchings of Random Cubic GraphsWilliam Duckworth, Nicholas C. Wormald, Michele Zito. 34-43 [doi]
- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type ProblemsGill Barequet. 44-53 [doi]
- On Local Transformation of Polygons with Visibility PropertiesM. Carmen Hernando, Michael E. Houle, Ferran Hurtado. 54-63 [doi]
- Embedding Problems for Paths with Direction Constrained EdgesGiuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides. 64-73 [doi]
- Characterization of Level Non-planar Graphs by Minimal PatternsPatrick Healy, Ago Kuusik, Sebastian Leipert. 74-84 [doi]
- Rectangular Drawings of Plane Graphs Without Designated CornersMd. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki. 85-94 [doi]
- Computing Optimal Embeddings for Planar GraphsPetra Mutzel, René Weiskircher. 95-104 [doi]
- Approximation Algorithms for Independent Sets in Map GraphsZhi-Zhong Chen. 105-114 [doi]
- Hierarchical Topological Inference on Planar Disc MapsZhi-Zhong Chen, Xin He. 115-125 [doi]
- Efficient Algorithms for the Minimum Connected Domination on Trapezoid GraphsYaw-Ling Lin, Fang-Rong Hsu, Yin-Te Tsai. 126-136 [doi]
- Parameterized Complexity of Finding Subgraphs with Hereditary PropertiesSubhash Khot, Venkatesh Raman. 137-147 [doi]
- Some Results on Tries with Adaptive BranchingYuriy A. Reznik. 148-158 [doi]
- Optimal Coding with One Asymmetric Error: Below the Sphere Packing BoundFerdinando Cicalese, Daniele Mundici. 159-169 [doi]
- Closure Properties of Real Number Classes under Limits and Computable OperatorsXizhong Zheng. 170-179 [doi]
- A Characterization of Graphs with Vertex Cover SixMichael J. Dinneen, Liu Xiong. 180-192 [doi]
- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-DegreeMirka Miller, Slamin. 193-201 [doi]
- Online Independent SetsMagnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi. 202-209 [doi]
- Two-Dimensional On-Line Bin Packing Problem with Rotatable ItemsSatoshi Fujita, Takeshi Hada. 210-220 [doi]
- Better Bounds on the Accommodating Ratio for the Seat Reservation ProblemEric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin. 221-231 [doi]
- Ordinal On-Line Scheduling on Two Uniform MachinesZhiyi Tan, Yong He. 232-241 [doi]
- Agents, Distributed Algorithms, and StabilizationSukumar Ghosh. 242-251 [doi]
- A Fast Sorting Algorithm and Its Generalization on Broadcast CommunicationsShyue-Horng Shiau, Chang-Biau Yang. 252-261 [doi]
- Efficient List Ranking Algorithms on Reconfigurable MeshSung-Ryul Kim, Kunsoo Park. 262-271 [doi]
- Tripods Do Not Pack DenselyAlexandre Tiskin. 272-280 [doi]
- An Efficient k Nearest Neighbor Searching Algorithm for a Query LineSubhas C. Nandy. 281-290 [doi]
- Tetrahedralization of Two Nested Convex PolyhedraCao An Wang, Bo-Ting Yang. 291-298 [doi]
- Efficient Algorithms for Two-Center Problems for a Convex PolygonSung Kwon Kim, Chan-Su Shin. 299-309 [doi]
- On Computation of Arbitrage for Markets with FrictionXiaotie Deng, Zhongfei Li, Shouyang Wang. 310-319 [doi]
- On Some Optimization Problems in Obnoxious Facility LocationZhongping Qin, Yin-Feng Xu, Binhai Zhu. 320-329 [doi]
- Generating Necklaces and Strings with Forbidden SubstringsFrank Ruskey, Joe Sawada. 330-339 [doi]
- Optimal Labelling of Point Features in the Slider ModelGunnar W. Klau, Petra Mutzel. 340-350 [doi]
- Mappings for Conflict-Free Access of Paths in Elementary Data StructuresAlan A. Bertossi, Maria Cristina Pinotti. 351-361 [doi]
- Theory of Trinomial HeapsTadao Takaoka. 362-372 [doi]
- Polyhedral Aspects of the Consecutive Ones ProblemMarcus Oswald, Gerhard Reinelt. 373-382 [doi]
- The Complexity of Physical Mapping with Strict ChimerismStephan Weis, Rüdiger Reischuk. 383-395 [doi]
- Logical Analysis of Data with Decomposable StructuresHirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki. 396-406 [doi]
- Learning from Approximate DataShirley H. C. Cheung. 407-415 [doi]
- A Combinatorial Approach to Asymmetric Traitor TracingReihaneh Safavi-Naini, Yejing Wang. 416-425 [doi]
- Removing Complexity Assumptions from Concurrent Zero-Knowledge ProofsGiovanni Di Crescenzo. 426-435 [doi]
- One-Way Probabilistic Reversible and Quantum One-Counter AutomataTomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai. 436-446 [doi]
- Similarity Enrichment in Image Compression through Weighted Finite AutomataZhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel. 447-456 [doi]
- On the Power of Input-Synchronized Alternating Finite AutomataHiroaki Yamamoto. 457-466 [doi]
- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width RestrictionMasaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. 467-476 [doi]