<head>
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
</head>
<PRE>Cocoon2005 List of Accepted papers  
</PRE>
<PRE>4: Yong He and Gyorgy Dosa.
   Bin packing and covering problems with rejection </PRE>
<PRE>6: Fábio Viduani Martinez, José Soares and José Coelho de Pina.
   Algorithms for Terminal Steiner Trees 
 </PRE>
<PRE>10: Shiquan Wu and Xun Gu. Gene Network: Model, Dynamics and Simulation 
 </PRE>
<PRE>15: XiangYang Li and Peng-Jun Wan. 
    Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks  
 </PRE>
<PRE>19: Minming Li, Becky Jie Liu and Frances F. Yao. 
    Min-Energy Voltage Allocation for Tree-Structured Tasks 
 </PRE>
<PRE>21: Zhipeng Cai, Guohui Lin and Guoliang Xue. 
    Improved Approximation Algorithms for the Capacitated Multicast Routing Problem 
 </PRE>
<PRE> 
23: Marek Chrobak, Claire Kenyon and Neal Young. 
    The Reverse Greedy Algorithm for the Metric K-Median Problem 
 </PRE>
<PRE>24: Cristina Bazgan, Zsolt Tuza and Daniel Vanderpooten. 
    Complexity and approximation of satisfactory partition problems  
 </PRE>
<PRE>31: Sean Hallgren, Alexander Russell and Igor Shparlinski. 
    Quantum Noisy  Rational Function Reconstruction 
 </PRE>
<PRE>34: Xiaotie DENG, Li-Sha HUANG and Minming LI. 
    On Walrasian Price of CPU Time  
 </PRE>
<PRE>44: Jianyang Zeng, Wen-Jing Hsu and Suiping Zhou.
    Evolution of Scale-Free Networks with Partial Information 
 </PRE>
<PRE>51: Frank Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond and Kim Stevens. 
    An O*(2^O(k)) FPT Algorithm for the Undirected Feedback Vertex Set Problem
 </PRE>
<PRE>59: guang xu and jinhui xu. 
    An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties 
 </PRE>
<PRE>60: Piotr Sankowski. 
    Subquadratic Algorithm for Dynamic Shortest Distances 
 </PRE>
<PRE> 
61: Robert Rettinger and Xizhong Zheng. 
    Solovay Reducibility on D-c.e Real Numbers 
 </PRE>
<PRE> 
62: Lane Hemaspaandra and Mayur Thakur. 
    Query-Monotonic Turing Reductions 
 </PRE>
<PRE>68: Yvo Desmedt, Yongge Wang, Rei Safavi-Naini and Huaxiong Wang. 
    Radio Networks With Reliable Communication  
 </PRE>
<PRE>76: D. T. Lee and Chung-Shou Liao.
    Power Domination Problem in Graphs 
 </PRE>
<PRE> 
80: Eyal Ackerman, Gill Barequet and Ron Y. Pinter.
    An Upper Bound on the Number of Rectangulations of a Point Set  
 </PRE>
<PRE>85: Guillaume Blin and Romeo Rizzi. 
    Conserved Interval Distance Computation between Non-trivial Genomes 
 </PRE>
<PRE>90: Chandan Dubey, Shashank Mehta and Jitender Deogun.
    Conditionally Critical Indecomposable Graphs 
 </PRE>
<PRE> 
91: Hirotaka Ono and Yen Kaow Ng. 
    Best Fitting Fixed-Length Substring Patterns for a Set of Strings </PRE>
<PRE> 
92: Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy and Hadrien Mélot. 
    A tight analysis of the maximal matching heuristic
 </PRE>
<PRE> 
100: Christian Bachmaier,
     Florian Fischer and Michael Forster. Radial Coordinate Assignment for Level Graphs 
 </PRE>
<PRE>103: Zhiyi Tan and Yong He. 
     Semi-online problems on identical machines  with inexact partial information 
 </PRE>
<PRE>105: Fabien BAILLE, Evripidis BAMPIS, Christian LAFOREST and Nicolas THIBAULT.
     On-line simultaneous maximization of the size and the weight for degradable intervals schedules </PRE>
<PRE> 
106: Ker-I Ko and Fuxiang Yu.
     On the Complexity of Computing the  Logarithm  and  Square Root  Functions on a Complex Domain </PRE>
<PRE>108: Saverio Caminiti and Rossella Petreschi. 
     String coding of trees with locality and heritability </PRE>
<PRE> 
110: Beatrice List, Markus Maucher, 
     Uwe Schöning and Rainer Schuler. Randomized QuickSort and the Entropy of the Random Source </PRE>
<PRE> 
113: Martin Hoefer and Piotr Krysta.
     Geometric Network Design with Selfish Agents </PRE>
<PRE> 
116: Oscar Ibarra, Sara Woodworth, Hsu-Chun Yen and Zhe Dang. 
     On Sequential and 1-Deterministic P Systems </PRE>
<PRE>121: Prosenjit Gupta, Ravi Janardan and Michiel Smid. 
     Efficient Non-intersection Queries on Aggregated Geometric Data 
 </PRE>
<PRE>123: David Liben-Nowell, 
     Erik Vee and An Zhu. Finding Longest Increasing and Common Subsequences in Streaming Data </PRE>
<PRE> 
124: Piotr Krysta.
      Bicriteria Network Design via Iterative Rounding 
 </PRE>
<PRE>128: Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu and Sheng-Lung Peng.
     On the recognition of probe graphs of some self--complementary classes of perfect graphs 
 </PRE>
<PRE> 
129: xuehou tan.
     Approximation algorithms for cutting out polygons with lines and rays </PRE>
<PRE> 
132: Sergey Bereg and Binhai Zhu. 
    RNA multiple structural alignment with longest common subsequences </PRE>
<PRE> 
133: Xiaomin Chen, Mario Szegedy and Lei Wang. 
     Optimally Balanced Forward Degree Sequence </PRE>
<PRE>136: Joong Chae Na, Raffaele Giancarlo and Kunsoo Park.
     $O(n^2 \log n)$ Time On-line Construction of Two-Dimensional Suffix Trees 
 </PRE>
<PRE> 
138: Sung Eun Bae and Tadao Takaoka. 
     Improved Algorithms for the $K$-Maximum Subarray Problem for Small $K$ 
 </PRE>
<PRE>141: Fan Chung, Ron Graham, Jia Mao and Andrew Yao. 
    Oblivious Strategies for the Majority and Plurality Problems </PRE>
<PRE>147: An Braeken, Svetla Nikova and Ventzislav Nikov. 
     Error-Set Codes and Related Objects 
 </PRE>
<PRE> 
148: Chung Keung Poon and Wai Keung Yiu. 
     Opportunistic Data Structures for Range Queries </PRE>
<PRE>153: Anshul Kothari, Subhash Suri and Yunhong Zhou.
     Interval Subset Sum and Uniform-Price Auction Clearing 
 </PRE>
<PRE>156: Xiaofei Huang.
     Global Optimality Conditions and Near-Perfect Optimization in Coding 
 </PRE>
<PRE>164: Parinya Chalermsook and Jittat Fakcharoenphol. 
     Simple distributed algorithms for approximating minimum steiner trees </PRE>
<PRE> 
166: Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen and Prudence W. H. Wong. 
    Off-line Algorithms for Minimizing the Total Flow Time in Broadcast Scheduling 
 </PRE>
<PRE>168: Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki. 
     Algorithms for Finding Distance-Edge-Colorings of Graphs </PRE>
<PRE>171: Marie-France Sagot and Eric Tannier. 
    Perfect Sorting by Reversals </PRE>
<PRE>174: Wen-Lian Hsu. 
     A Linear Time Algorithm for Finding a Maximal Planar Subgraph 
 
</PRE>
<PRE>176: Christian Icking, Tom Kamphans, Rolf Klein and Elmar Langetepe.
     Exploring simple grid polygons </PRE>
<PRE>180: Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl and Aaron Zollinger.
     Interference in Cellular Networks: The Minimum Membership Set Cover Problem 
 </PRE>
<PRE>185: Tao-Ming Wang. 
     Toroidal Grids Are Antimagic 
 </PRE>
<PRE> 
186: Jan Kara, Jan Kratochvil and David Wood. 
     On the complexity of the balanced vertex ordering problem </PRE>
<PRE>189: Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh,Ram Swaminathan, Robert Tarjan and Yunhong Zhou. 
     Server Allocation Algorithms for Tiered Systems 
 </PRE>
<PRE>198: Fabrizio Grandoni, Jochen Konemann and Alessandro Panconesi. 
     Distributed Weighted Vertex Cover via Maximal Matchings 
 </PRE>
<PRE>204: Vincent Berry, Sylvain Guillemot, François Nicolas and Christophe Paul. 
     On the approximation of computing of evolutionary trees 
 </PRE>
<PRE>206: Martin Kutz and Attila Por. 
     Angel, Devil, and King </PRE>
<PRE> 
208: Domingo Gomez, Jaime Gutierrez, Alvar Ibeas, Carmen Martinez and Ramon Beivide. 
     On Finding a Shortest Path in Circulant Graphs with two jumps 
  </PRE>
<PRE>211: Shengyu Zhang. 
     Promised and Distributed Quantum Search </PRE>
<PRE>217: Viger Fabien and Latapy Matthieu. 
      Efficient and simple generation of random simple connected graphs with prescribed degree sequence 
 </PRE>
<PRE> 
218: Luciano Gualà and Guido Proietti. 
     A Truthful $\left(2-2/k \right)$-approximation Mechanism for the Steiner Tree Problem with $k$ Terminals 
 </PRE>
<PRE> 
219: Luca Allulli, Giorgio Ausiello and Luigi Laura. 
     On the Power of Lookahead in On-line Vehicle Routing Problems 
 </PRE>
<PRE>226: Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan. 
     A New Algorithm for the Hypergraph Transversal Problem 
 </PRE>
<PRE>227: Lefmann Hanno.
     Distributions of Points in d Dimensions and Large k-Point Simplices </PRE>
<PRE>230: Michael Dom, Jiong Guo and Rolf Niedermeier. 
     Bounded Degree Closest k-Tree Power is NP-complete 
 </PRE>
<PRE> 
231: Xiaodong Wu. 
     Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy </PRE>
<PRE>233: spyros angelopoulos, atish das sarma, avner magen and anastasios viglas. 
     on-line algorithms for market equilibria </PRE>
<PRE> 
234: Ferdinando Cicalese, Peter Damaschke, Libertad Tansini and Sören Werth. 
     Overlaps Help: Improved Bounds for Group Testing with Interval Queries 
 </PRE>
<PRE> 
235: Chunfang Zheng and David Sankoff. 
     Genome Rearrangements with Partially Ordered Chromosomes </PRE>
<PRE>237: Tao Liu, Jijun Tang and Bernard Moret.
     Quartet methods for phylogeny reconstruction from gene orders 
 </PRE>
<PRE>242: Eun-Jun Yoon and Kee-Young Yoo. 
     New Efficient Simple Authenticated Key Agreement Protocol 
 </PRE>
<PRE> 
243: Zhixiang Chen, Bin Fu, Yong Tang and Binhai Zhu. 
     A PTAS for a Disc Covering Problem Using Width-Bounded Separators 
 </PRE>
<PRE> 
244: W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova and Michael A. Langston.
     A New Approach and Faster Exact Methods for Maximum Common Subgraph Problem 
 
</PRE>
<PRE>246: Guowu Yang, Xiaoyu Song, Hannah H. Yang and Fei Xie.
     A Theoretical Upper Bound for IP-Based Floorplanning 
 </PRE>
<PRE>252: Zhixiang Chen and Bin Fu.
     A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm 
 </PRE>
<PRE> 
259: Jin-Yi Cai and Venkatesan T. Chakaravarthy. 
     A Note on Zero Error Algorithms Having Oracle Access to One NP Query 
 </PRE>
<PRE>268: Xujin Chen, Xiaodong Hu and Tianping Shuai. 
     Routing and Coloring for Maximal Number of Trees 
 </PRE>
<PRE> 
296: SEBASTIAN BOCKER and ZSUZSANNA LIPTAK. 
     The Money Changing Problem revisited: Computing the Frobenius number in time O(k a1) 
 </PRE>
<PRE>315: Jinsong Tan, Kok Seng Chua and Louxin Zhang. 
     Algorithmic and Complexity Issues of Three Clustering Methods Algorithmic and Complexity Issues of Three Clustering Methods </PRE>
<PRE>328: Luay Nakhleh, Derek Ruths and Li-San Wang. 
     RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer 
 </PRE>
<PRE> 
329: Ewa Misiolek and Danny Z. Chen.
    Effcient Algorithms for Simplifying Flow Networks 
 </PRE>
<PRE> 
330: HengWu Li and DaMing Zhu. 
     A New Pseudoknots Folding Algorithm for RNA Structure Prediction 
 </PRE>
<PRE>338: Guoxuan Ma, Jiming Peng and Yu Wei. 
     On Approximate Balanced Bi-clustering 
 </PRE>
<PRE>340: Jianer Chen, Xiuzhen Huang, Iyad A. Kanj and Ge Xia. 
     The W-Hardness under Linear FPT-Reductions: Structural Properties and Futher Applications </PRE>
<PRE>350: Takuro Fukunaga and Hiroshi Nagamochi.
     Approximation algorithms for the b-edge dominating set problem and its related problems 
 </PRE>
<PRE>356: Hossein Jowhari and Mohammad Ghodsi.
     New Streaming Algorithms for Counting Triangles in Graphs </PRE>
<PRE>359: Yinfeng Xu, Wenqiang Dai, Naoki Katoh and Makoto Ohsaki. 
     Triangulating a Convex Polygon With Less Number of Non-Standard Bars (Extended Abstract) </PRE>
<PRE>363 Guantao Chen, Zhicheng Gao, Xingxing Yu and Wenan Zang.
Approximating The Longest Cycle Problem on Graphs with Bounded Degree </PRE>
<PRE>371: Miklos Csuros and Bin Ma. 
     Rapid homology search with two-stage extension and daughter seeds 
 </PRE>
<PRE>380: Frank Ruskey and Aaron Williams.
     Generating combinations by prefix shifts 
 </PRE>
<PRE> 
381: WeiZhao Wang and Zheng Sun. 
     Share the Multicast Payment Fairly 
 </PRE>
<PRE> 
382: Jianping Li, Kang Li, Ken C K Law and Hao Zhao. 
     On Packing and Coloring Hyperedges in a Cycle </PRE>
<PRE>387: Q. H. Ding, J. B. Qian, W.W. Tsang and C. A. Wang. 
     Random Triangulation of a Simple Polygon with Uniform Probability </PRE>
<PRE> 
388: X. G. Yang and Z. Zhang. 
     Some New Results on Inverse Sorting Problems 
 </PRE>
<PRE> 
389: Hai Liu, Pengjun Wan and Xiaohua Jia. 
     Fault-Tolerant Relay Node Placement in Wireless Sensor Networks 
 </PRE>
<PRE> </PRE>