7. COCOON 2001:
Guilin, China
Jie Wang (Ed.):
Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings.
Lecture Notes in Computer Science 2108 Springer 2001, ISBN 3-540-42494-6
Complexity Theory
Computational Biology
Computational Geometry
- Xiang-Yang Li:
Generating Well-Shaped d-dimensional Delaunay Meshes.
91-100

- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado:
Towards Compatible Triangulations.
101-110

- Abdullah N. Arslan, Ömer Egecioglu:
An Improved Upper Bound on the Size of Planar Convex-Hulls.
111-120

- Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu:
On the Planar Two-Watchtower Problem.
121-130

- Shin-Ichi Nakano:
Efficient Generation of Triconnected Plane Triangulations.
131-141

- Prosenjit Bose, Pat Morin, Antoine Vigneron:
Packing Two Disks into a Polygonal Environment.
142-149

- Danny Z. Chen, Xiaobo Hu, Xiaodong Wu:
Maximum Red/Blue Interval Matching with Applications.
150-158

- Otfried Cheong, Chan-Su Shin, Antoine Vigneron:
Computing Farthest Neighbors on a Convex Polytope.
159-169

- Xuehou Tan:
Finding an Optimal Bridge between Two Polygons.
170-180

- Xiang-Yang Li, Yu Wang:
How Good Is Sink Insertion?
181-190

- Rob Duncan, Jianbo Qian, Binhai Zhu:
Polynomial Time Algorithms for Three-Label Point Labeling.
191-200

- Xuehou Tan:
Approximation Algorithms for the Watchman Route and Zookeeper's Problems.
201-206

Data Structures and Algorithms
- Wen-Lian Hsu:
PC-Trees vs. PQ-Trees.
207-217

- Holger Petersen:
Stacks versus Deques.
218-227

- H. K. Dai:
Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences.
228-236

Games and Combinatorics
Graph Algorithms and Complexity
- Valerie King, Mikkel Thorup:
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms.
268-277

- Enrico Nardelli, Guido Proietti, Peter Widmayer:
Finding the Most Vital Node of a Shortest Path.
278-287

- Xiao Zhou, Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees.
288-297

- Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Counting H-Colorings of Partial k-Trees.
298-307

- L. Sunil Chandran:
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph.
308-317

- Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph Separators: A Parameterized View.
318-327

- N. S. Narayanaswamy, C. E. Veni Madhavan:
On Assigning Prefix Free Codes to the Vertices of a Graph.
328-337

- Chin Lung Lu, Zheng-Yao Su, Chuan Yi Tang:
A New Measure of Edit Distance between Labeled Trees.
338-348

- Dingjun Lou, Ning Zhong:
A Highly Efficient Algorithm to Determine Bicritical Graphs.
349-356

Graph Drawing
Graph Theory
Online Algorithms
Randomized and Average-Case Algorithms
Steiner Trees
Systems Algorithms and Modeling
- Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer:
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata.
529-539

- Zhixiang Chen:
Multiplicative Adaptive Algorithms for User Preference Retrieval.
540-549

- K. Subramani:
Parametric Scheduling for Network Constraints.
550-560

- Kaile Su, Xudong Luo, Huaiqing Wang, Chengqi Zhang, Shichao Zhang, Qingfeng Chen:
A Logical Framework for Knowledge Sharing in Multi-agent Systems.
561-570

- Kumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi:
A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem.
571-575

Computability
Last update Mon May 20 22:38:48 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page