Invited Talks.- Theoretical Problems Related to the Internet.- Recent Progress and Prospects for Integer Factorisation Algorithms.- Hao Wang Award Paper.- Approximating Uniform Triangular Meshes in Polygons.- The Best Young Researcher Paper.- Maximum Induced Matchings of Random Cubic Graphs.- Computational Geometry 1.- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems.- On Local Transformation of Polygons with Visibility Properties.- Graph Drawing.- Embedding Problems for Paths with Direction Constrained Edges.- Characterization of Level Non-planar Graphs by Minimal Patterns.- Rectangular Drawings of Plane Graphs Without Designated Corners.- Computing Optimal Embeddings for Planar Graphs.- Graph Theory and Algorithms 1.- Approximation Algorithms for Independent Sets in Map Graphs.- Hierarchical Topological Inference on Planar Disc Maps.- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs.- Complexity, Discrete Mathematics, and Number Theory.- Parameterized Complexity of Finding Subgraphs with Hereditary Properties.- Some Results on Tries with Adaptive Branching.- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound.- Closure Properties of Real Number Classes under Limits and Computable Operators.- Graph Theory and Algorithms 2.- A Characterization of Graphs with Vertex Cover Six.- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree.- Online Algorithms.- Online Independent Sets.- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items.- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.- Ordinal On-Line Scheduling on Two Uniform Machines.- Parallel and Distributed Computing.- Agents, Distributed Algorithms, and Stabilization.- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications.- Efficient List Ranking Algorithms on Reconfigurable Mesh.- Computational Geometry 2.- Tripods Do Not Pack Densely.- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line.- Tetrahedralization of Two Nested Convex Polyhedra.- Efficient Algorithms for Two-Center Problems for a Convex Polygon.- Combinatorial Optimization.- On Computation of Arbitrage for Markets with Friction.- On Some Optimization Problems in Obnoxious Facility Location.- Generating Necklaces and Strings with Forbidden Substrings.- Optimal Labelling of Point Features in the Slider Model.- Data Structures and Computational Biology.- Mappings for Conflict-Free Access of Paths in Elementary Data Structures.- Theory of Trinomial Heaps.- Polyhedral Aspects of the Consecutive Ones Problem.- The Complexity of Physical Mapping with Strict Chimerism.- Learning and Cryptography.- Logical Analysis of Data with Decomposable Structures.- Learning from Approximate Data.- A Combinatorial Approach to Asymmetric Traitor Tracing.- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs.- Automata and Quantum Computing.- One-Way Probabilistic Reversible and Quantum One-Counter Automata.- Similarity Enrichment in Image Compression through Weighted Finite Automata.- On the Power of Input-Synchronized Alternating Finite Automata.- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.
Inhaltsverzeichnis
Invited Talks. - Theoretical Problems Related to the Internet. - Recent Progress and Prospects for Integer Factorisation Algorithms. - Hao Wang Award Paper. - Approximating Uniform Triangular Meshes in Polygons. - The Best Young Researcher Paper. - Maximum Induced Matchings of Random Cubic Graphs. - Computational Geometry 1. - A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. - On Local Transformation of Polygons with Visibility Properties. - Graph Drawing. - Embedding Problems for Paths with Direction Constrained Edges. - Characterization of Level Non-planar Graphs by Minimal Patterns. - Rectangular Drawings of Plane Graphs Without Designated Corners. - Computing Optimal Embeddings for Planar Graphs. - Graph Theory and Algorithms 1. - Approximation Algorithms for Independent Sets in Map Graphs. - Hierarchical Topological Inference on Planar Disc Maps. - Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs. - Complexity, Discrete Mathematics, and Number Theory. - Parameterized Complexity of Finding Subgraphs with Hereditary Properties. - Some Results on Tries with Adaptive Branching. - Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. - Closure Properties of Real Number Classes under Limits and Computable Operators. - Graph Theory and Algorithms 2. - A Characterization of Graphs with Vertex Cover Six. - On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree. - Online Algorithms. - Online Independent Sets. - Two-Dimensional On-Line Bin Packing Problem with Rotatable Items. - Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. - Ordinal On-Line Scheduling on Two Uniform Machines. - Parallel and Distributed Computing. - Agents, Distributed Algorithms, and Stabilization. - A Fast Sorting Algorithm and Its Generalization on Broadcast Communications. - Efficient List Ranking Algorithms on Reconfigurable Mesh. - Computational Geometry 2. - Tripods Do Not Pack Densely. - An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. - Tetrahedralization of Two Nested Convex Polyhedra. - Efficient Algorithms for Two-Center Problems for a Convex Polygon. - Combinatorial Optimization. - On Computation of Arbitrage for Markets with Friction. - On Some Optimization Problems in Obnoxious Facility Location. - Generating Necklaces and Strings with Forbidden Substrings. - Optimal Labelling of Point Features in the Slider Model. - Data Structures and Computational Biology. - Mappings for Conflict-Free Access of Paths in Elementary Data Structures. - Theory of Trinomial Heaps. - Polyhedral Aspects of the Consecutive Ones Problem. - The Complexity of Physical Mapping with Strict Chimerism. - Learning and Cryptography. - Logical Analysis of Data with Decomposable Structures. - Learning from Approximate Data. - A Combinatorial Approach to Asymmetric Traitor Tracing. - Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs. - Automata and Quantum Computing. - One-Way Probabilistic Reversible and Quantum One-Counter Automata. - Similarity Enrichment in Image Compression through Weighted Finite Automata. - On the Power of Input-Synchronized Alternating Finite Automata. - Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.