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 BibTeX
@proceedings{DBLP:conf/cocoon/2001,
editor = {Jie Wang},
title = {Computing and Combinatorics, 7th Annual International Conference,
COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings},
booktitle = {COCOON},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2108},
year = {2001},
isbn = {3-540-42494-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Complexity Theory
Computational Biology
Computational Geometry
- Xiang-Yang Li:
Generating Well-Shaped d-dimensional Delaunay Meshes.
91-100
Electronic Edition (Springer LINK) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado:
Towards Compatible Triangulations.
101-110
Electronic Edition (Springer LINK) BibTeX
- Abdullah N. Arslan, Ömer Egecioglu:
An Improved Upper Bound on the Size of Planar Convex-Hulls.
111-120
Electronic Edition (Springer LINK) BibTeX
- Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu:
On the Planar Two-Watchtower Problem.
121-130
Electronic Edition (Springer LINK) BibTeX
- Shin-Ichi Nakano:
Efficient Generation of Triconnected Plane Triangulations.
131-141
Electronic Edition (Springer LINK) BibTeX
- Prosenjit Bose, Pat Morin, Antoine Vigneron:
Packing Two Disks into a Polygonal Environment.
142-149
Electronic Edition (Springer LINK) BibTeX
- Danny Z. Chen, Xiaobo Hu, Xiaodong Wu:
Maximum Red/Blue Interval Matching with Applications.
150-158
Electronic Edition (Springer LINK) BibTeX
- Otfried Cheong, Chan-Su Shin, Antoine Vigneron:
Computing Farthest Neighbors on a Convex Polytope.
159-169
Electronic Edition (Springer LINK) BibTeX
- Xuehou Tan:
Finding an Optimal Bridge between Two Polygons.
170-180
Electronic Edition (Springer LINK) BibTeX
- Xiang-Yang Li, Yu Wang:
How Good Is Sink Insertion?
181-190
Electronic Edition (Springer LINK) BibTeX
- Rob Duncan, Jianbo Qian, Binhai Zhu:
Polynomial Time Algorithms for Three-Label Point Labeling.
191-200
Electronic Edition (Springer LINK) BibTeX
- Xuehou Tan:
Approximation Algorithms for the Watchman Route and Zookeeper's Problems.
201-206
Electronic Edition (Springer LINK) BibTeX
Data Structures and Algorithms
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
Electronic Edition (Springer LINK) BibTeX
- Enrico Nardelli, Guido Proietti, Peter Widmayer:
Finding the Most Vital Node of a Shortest Path.
278-287
Electronic Edition (Springer LINK) BibTeX
- Xiao Zhou, Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees.
288-297
Electronic Edition (Springer LINK) BibTeX
- Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
Counting H-Colorings of Partial k-Trees.
298-307
Electronic Edition (Springer LINK) BibTeX
- L. Sunil Chandran:
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph.
308-317
Electronic Edition (Springer LINK) BibTeX
- Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph Separators: A Parameterized View.
318-327
Electronic Edition (Springer LINK) BibTeX
- N. S. Narayanaswamy, C. E. Veni Madhavan:
On Assigning Prefix Free Codes to the Vertices of a Graph.
328-337
Electronic Edition (Springer LINK) BibTeX
- Chin Lung Lu, Zheng-Yao Su, Chuan Yi Tang:
A New Measure of Edit Distance between Labeled Trees.
338-348
Electronic Edition (Springer LINK) BibTeX
- Dingjun Lou, Ning Zhong:
A Highly Efficient Algorithm to Determine Bicritical Graphs.
349-356
Electronic Edition (Springer LINK) BibTeX
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
Electronic Edition (Springer LINK) BibTeX
- Zhixiang Chen:
Multiplicative Adaptive Algorithms for User Preference Retrieval.
540-549
Electronic Edition (Springer LINK) BibTeX
- K. Subramani:
Parametric Scheduling for Network Constraints.
550-560
Electronic Edition (Springer LINK) BibTeX
- Kaile Su, Xudong Luo, Huaiqing Wang, Chengqi Zhang, Shichao Zhang, Qingfeng Chen:
A Logical Framework for Knowledge Sharing in Multi-agent Systems.
561-570
Electronic Edition (Springer LINK) BibTeX
- Kumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi:
A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem.
571-575
Electronic Edition (Springer LINK) BibTeX
Computability
Copyright © Sat May 16 23:02:46 2009
by Michael Ley (ley@uni-trier.de)
