11. COCOON 2005:
Kunming,
China
Lusheng Wang (Ed.):
Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings.
Lecture Notes in Computer Science 3595 Springer 2005, ISBN 3-540-28061-8 BibTeX
Invited Lectures
Bioinformatics
- Shiquan Wu, Xun Gu:
Gene Network: Model, Dynamics and Simulation.
12-21
Electronic Edition (link) BibTeX
- Guillaume Blin, Romeo Rizzi:
Conserved Interval Distance Computation Between Non-trivial Genomes.
22-31
Electronic Edition (link) BibTeX
- Sergey Bereg, Binhai Zhu:
RNA Multiple Structural Alignment with Longest Common Subsequences.
32-41
Electronic Edition (link) BibTeX
- Marie-France Sagot, Eric Tannier:
Perfect Sorting by Reversals.
42-51
Electronic Edition (link) BibTeX
- Chunfang Zheng, David Sankoff:
Genome Rearrangements with Partially Ordered Chromosomes.
52-62
Electronic Edition (link) BibTeX
- Tao Liu, Jijun Tang, Bernard M. E. Moret:
Quartet-Based Phylogeny Reconstruction from Gene Orders.
63-73
Electronic Edition (link) BibTeX
- Jinsong Tan, Kok Seng Chua, Louxin Zhang:
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
74-83
Electronic Edition (link) BibTeX
- Luay Nakhleh, Derek A. Ruths, Li-San Wang:
RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer.
84-93
Electronic Edition (link) BibTeX
- Hengwu Li, Daming Zhu:
A New Pseudoknots Folding Algorithm for RNA Structure Prediction.
94-103
Electronic Edition (link) BibTeX
- Miklós Csürös, Bin Ma:
Rapid Homology Search with Two-Stage Extension and Daughter Seeds.
104-114
Electronic Edition (link) BibTeX
- Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul:
On the Approximation of Computing Evolutionary Trees.
115-125
Electronic Edition (link) BibTeX
Networks
- Xiang-Yang Li, Peng-Jun Wan:
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks.
126-135
Electronic Edition (link) BibTeX
- Zhipeng Cai, Guohui Lin, Guoliang Xue:
Improved Approximation Algorithms for the Capacitated Multicast Routing Problem.
136-145
Electronic Edition (link) BibTeX
- Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou:
Construction of Scale-Free Networks with Partial Information.
146-155
Electronic Edition (link) BibTeX
- Yvo Desmedt, Yongge Wang, Reihaneh Safavi-Naini, Huaxiong Wang:
Radio Networks with Reliable Communication.
156-166
Electronic Edition (link) BibTeX
- Martin Hoefer, Piotr Krysta:
Geometric Network Design with Selfish Agents.
167-178
Electronic Edition (link) BibTeX
- Piotr Krysta:
Bicriteria Network Design via Iterative Rounding.
179-187
Electronic Edition (link) BibTeX
- Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger:
Interference in Cellular Networks: The Minimum Membership Set Cover Problem.
188-198
Electronic Edition (link) BibTeX
- Xujin Chen, Xiao-Dong Hu, Tianping Shuai:
Routing and Coloring for Maximal Number of Trees.
199-209
Electronic Edition (link) BibTeX
- Weizhao Wang, Xiang-Yang Li, Zheng Sun:
Share the Multicast Payment Fairly.
210-219
Electronic Edition (link) BibTeX
- Jianping Li, Kang Li, Ken C. K. Law, Hao Zhao:
On Packing and Coloring Hyperedges in a Cycle.
220-229
Electronic Edition (link) BibTeX
- Hai Liu, Peng-Jun Wan, Xiaohua Jia:
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks.
230-239
Electronic Edition (link) BibTeX
String Algorithms
Scheduling
- Minming Li, Becky Jie Liu, Frances F. Yao:
Min-Energy Voltage Allocation for Tree-Structured Tasks.
283-296
Electronic Edition (link) BibTeX
- Zhiyi Tan, Yong He:
Semi-online Problems on Identical Machines with Inexact Partial Information.
297-307
Electronic Edition (link) BibTeX
- Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault:
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules.
308-317
Electronic Edition (link) BibTeX
- Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong:
Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling.
318-328
Electronic Edition (link) BibTeX
Complexity
Steiner Trees
Graph Drawing and Layout Design
Quantum Computing
Randomized Algorithms
Geometry
- Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki:
Triangulating a Convex Polygon with Small Number of Non-standard Bars.
481-489
Electronic Edition (link) BibTeX
- Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu:
A PTAS for a Disc Covering Problem Using Width-Bounded Separators.
490-503
Electronic Edition (link) BibTeX
- Xiaodong Wu:
Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy.
504-513
Electronic Edition (link) BibTeX
- Hanno Lefmann:
Distributions of Points in d Dimensions and Large k-Point Simplices.
514-523
Electronic Edition (link) BibTeX
- Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring Simple Grid Polygons.
524-533
Electronic Edition (link) BibTeX
- Xuehou Tan:
Approximation Algorithms for Cutting Out Polygons with Lines and Rays.
534-543
Electronic Edition (link) BibTeX
- Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Efficient Non-intersection Queries on Aggregated Geometric Data.
544-553
Electronic Edition (link) BibTeX
- Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
An Upper Bound on the Number of Rectangulations of a Point Set.
554-559
Electronic Edition (link) BibTeX
Codes
Finance
Facility Location
- Sung Eun Bae, Tadao Takaoka:
Improved Algorithms for the K-Maximum Subarray Problem for Small K.
621-631
Electronic Edition (link) BibTeX
- Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems.
632-643
Electronic Edition (link) BibTeX
- Guang Xu, Jinhui Xu:
An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties.
644-653
Electronic Edition (link) BibTeX
- Marek Chrobak, Claire Kenyon, Neal E. Young:
The Reverse Greedy Algorithm for the Metric K-Median Problem.
654-660
Electronic Edition (link) BibTeX
- Guoxuan Ma, Jiming Peng, Yu Wei:
On Approximate Balanced Bi-clustering.
661-670
Electronic Edition (link) BibTeX
Graph Theory
Graph Algorithms
- Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot:
A Tight Analysis of the Maximal Matching Heuristic.
701-709
Electronic Edition (link) BibTeX
- Hossein Jowhari, Mohammad Ghodsi:
New Streaming Algorithms for Counting Triangles in Graphs.
710-716
Electronic Edition (link) BibTeX
- W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova, Michael A. Langston:
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem.
717-727
Electronic Edition (link) BibTeX
- Luca Allulli, Giorgio Ausiello, Luigi Laura:
On the Power of Lookahead in On-Line Vehicle Routing Problems.
728-736
Electronic Edition (link) BibTeX
- Ewa Misiolek, Danny Z. Chen:
Efficient Algorithms for Simplifying Flow Networks.
737-746
Electronic Edition (link) BibTeX
- Takuro Fukunaga, Hiroshi Nagamochi:
Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems.
747-756
Electronic Edition (link) BibTeX
- Michael Dom, Jiong Guo, Rolf Niedermeier:
Bounded Degree Closest k-Tree Power Is NP-Complete.
757-766
Electronic Edition (link) BibTeX
- Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
A New Algorithm for the Hypergraph Transversal Problem.
767-776
Electronic Edition (link) BibTeX
- Domingo Gómez, Jaime Gutierrez, Álvar Ibeas, Carmen Martínez, Ramón Beivide:
On Finding a Shortest Path in Circulant Graphs with Two Jumps.
777-786
Electronic Edition (link) BibTeX
- Wen-Lian Hsu:
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees.
787-797
Electronic Edition (link) BibTeX
- Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for Finding Distance-Edge-Colorings of Graphs.
798-807
Electronic Edition (link) BibTeX
- Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng:
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
808-817
Electronic Edition (link) BibTeX
- Chung-Shou Liao, Der-Tsai Lee:
Power Domination Problem in Graphs.
818-828
Electronic Edition (link) BibTeX
- Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Complexity and Approximation of Satisfactory Partition Problems.
829-838
Electronic Edition (link) BibTeX
- Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
Distributed Weighted Vertex Cover via Maximal Matchings.
839-848
Electronic Edition (link) BibTeX
- Jan Kára, Jan Kratochvíl, David R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem.
849-858
Electronic Edition (link) BibTeX
- Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem.
859-869
Electronic Edition (link) BibTeX
- Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
Approximating the Longest Cycle Problem on Graphs with Bounded Degree.
870-884
Electronic Edition (link) BibTeX
Others
- Yong He, György Dósa:
Bin Packing and Covering Problems with Rejection.
885-894
Electronic Edition (link) BibTeX
- Lane A. Hemaspaandra, Mayur Thakur:
Query-Monotonic Turing Reductions.
895-904
Electronic Edition (link) BibTeX
- Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
On Sequential and 1-Deterministic P Systems.
905-914
Electronic Edition (link) BibTeX
- Xiaofei Huang:
Global Optimality Conditions and Near-Perfect Optimization in Coding.
915-924
Electronic Edition (link) BibTeX
- Martin Kutz, Attila Pór:
Angel, Devil, and King.
925-934
Electronic Edition (link) BibTeX
- Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
Overlaps Help: Improved Bounds for Group Testing with Interval Queries.
935-944
Electronic Edition (link) BibTeX
- Eun-Jun Yoon, Kee-Young Yoo:
New Efficient Simple Authenticated Key Agreement Protocol.
945-954
Electronic Edition (link) BibTeX
- Zhixiang Chen, Bin Fu:
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm.
955-964
Electronic Edition (link) BibTeX
- Sebastian Böcker, Zsuzsanna Lipták:
The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a1).
965-974
Electronic Edition (link) BibTeX
- Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.
975-984
Electronic Edition (link) BibTeX
- Xiao-guang Yang, Jian-Zhong Zhang:
Some New Results on Inverse Sorting Problems.
985-992
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:02:47 2009
by Michael Ley (ley@uni-trier.de)
