| ISBN | 出版时间 | 包装 | 开本 | 页数 | 字数 |
|---|---|---|---|---|---|
| 未知 | 暂无 | 暂无 | 未知 | 0 | 暂无 |
Invited Talks
Stable Matching Problems
Delaunay Meshing of Surfaces
Best Paper 2006
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
Best Student Paper 2006
Branching and Treewidth Based Exact Algorithms
Session 1A: Algorithms and Data Structures
Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
Flexible Word Design and Graph Labeling
Session 1B: Online Algorithms
Frequency Allocation Problems for Linear Cellular Networks
Finite-State Online Algorithms and Their Automated Competitive Analysis
Offiine Sorting Buffers on Line
Session 2A: Approximation Algorithms
Approximating Tree Edit Distance Through String Edit Distance
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
Improved Approximation for Single-Sink Buy-at-Bulk
Approximability of Partitioning Graphs with Supply and Demand
Session 2B: Graphs
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Algorithms on Graphs with Small Dominating Targets
Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
On Estimating Path Aggregates over Streaming Graphs
Session 3A: Computational Geometry
Diamond Triangulations Contain Spanners of Bounded Degree
……
Author Index
