default search action
6. COCOON 2000: Sydney, Australia
- Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma:
Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Lecture Notes in Computer Science 1858, Springer 2000, ISBN 3-540-67787-9
Invited Talks
- Christos H. Papadimitriou:
Theoretical Problems Related to the Internet. 1-2 - Richard P. Brent
:
Recent Progress and Prospects for Integer Factorisation Algorithms. 3-22
Hao Wang Award Paper
- Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu:
Approximating Uniform Triangular Meshes in Polygons. 23-33
The Best Young Researcher Paper
- William Duckworth, Nicholas C. Wormald, Michele Zito:
Maximum Induced Matchings of Random Cubic Graphs. 34-43
Computational Geometry 1
- Gill Barequet:
A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. 44-53 - M. Carmen Hernando
On Local Transformation of Polygons with Visibility Properties. 54-63
Graph Drawing
- Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding Problems for Paths with Direction Constrained Edges. 64-73 - Patrick Healy, Ago Kuusik, Sebastian Leipert:
Characterization of Level Non-planar Graphs by Minimal Patterns. 74-84 - Md. Saidur Rahman
Rectangular Drawings of Plane Graphs Without Designated Corners. 85-94 - Petra Mutzel
Computing Optimal Embeddings for Planar Graphs. 95-104
Graph Theory and Algorithms 1
- Zhi-Zhong Chen:
Approximation Algorithms for Independent Sets in Map Graphs. 105-114 - Zhi-Zhong Chen, Xin He:
Hierarchical Topological Inference on Planar Disc Maps. 115-125 - Yaw-Ling Lin, Fang-Rong Hsu, Yin-Te Tsai:
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs. 126-136
Complexity, Discrete Mathematics, and Number Theory
- Subhash Khot, Venkatesh Raman:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties. 137-147 - Yuriy A. Reznik
Some Results on Tries with Adaptive Branching. 148-158 - Ferdinando Cicalese, Daniele Mundici:
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. 159-169 - Xizhong Zheng:
Closure Properties of Real Number Classes under Limits and Computable Operators. 170-179
Graph Theory and Algorithms 2
- Michael J. Dinneen, Liu Xiong:
A Characterization of Graphs with Vertex Cover Six. 180-192 - Mirka Miller, Slamin:
On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree. 193-201
Online Algorithms
- Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi:
Online Independent Sets. 202-209 - Satoshi Fujita, Takeshi Hada:
Two-Dimensional On-Line Bin Packing Problem with Rotatable Items. 210-220 - Eric Bach, Joan Boyar
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. 221-231 - Zhiyi Tan
Ordinal On-Line Scheduling on Two Uniform Machines. 232-241
Parallel and Distributed Computing
- Sukumar Ghosh:
Agents, Distributed Algorithms, and Stabilization. 242-251 - Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Sorting Algorithm and Its Generalization on Broadcast Communications. 252-261 - Sung-Ryul Kim, Kunsoo Park:
Efficient List Ranking Algorithms on Reconfigurable Mesh. 262-271
Computational Geometry 2
- Alexandre Tiskin
Tripods Do Not Pack Densely. 272-280 - Subhas C. Nandy:
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. 281-290 - Cao An Wang, Bo-Ting Yang:
Tetrahedralization of Two Nested Convex Polyhedra. 291-298 - Sung Kwon Kim, Chan-Su Shin:
Efficient Algorithms for Two-Center Problems for a Convex Polygon. 299-309
Combinatorial Optimization
- Xiaotie Deng, Zhongfei Li, Shouyang Wang
On Computation of Arbitrage for Markets with Friction. 310-319 - Zhongping Qin, Yin-Feng Xu, Binhai Zhu:
On Some Optimization Problems in Obnoxious Facility Location. 320-329 - Frank Ruskey
Generating Necklaces and Strings with Forbidden Substrings. 330-339 - Gunnar W. Klau
Optimal Labelling of Point Features in the Slider Model. 340-350
Data Structures and Computational Biology
- Alan A. Bertossi, Maria Cristina Pinotti
Mappings for Conflict-Free Access of Paths in Elementary Data Structures. 351-361 - Tadao Takaoka:
Theory of Trinomial Heaps. 362-372 - Marcus Oswald, Gerhard Reinelt:
Polyhedral Aspects of the Consecutive Ones Problem. 373-382 - Stephan Weis, Rüdiger Reischuk:
The Complexity of Physical Mapping with Strict Chimerism. 383-395
Learning and Cryptography
- Hirotaka Ono
Logical Analysis of Data with Decomposable Structures. 396-406 - Shirley H. C. Cheung:
Learning from Approximate Data. 407-415 - Reihaneh Safavi-Naini, Yejing Wang:
A Combinatorial Approach to Asymmetric Traitor Tracing. 416-425 - Giovanni Di Crescenzo:
Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs. 426-435
Automata and Quantum Computing
- Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai:
One-Way Probabilistic Reversible and Quantum One-Counter Automata. 436-446 - Zhuhan Jiang, Bruce E. Litow, Olivier Y. de Vel:
Similarity Enrichment in Image Compression through Weighted Finite Automata. 447-456 - Hiroaki Yamamoto:
On the Power of Input-Synchronized Alternating Finite Automata. 457-466 - Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara:
Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. 467-476
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: