11. COCOON 2005: Kunming, China

Invited Lectures

• Leslie G. Valiant:
  Completeness for Parity Problems. 1-8
  
• Alberto Apostolico:
  Monotony and Surprise. 9
  
• Shang-Hua Teng:
  Smoothed Analysis of Algorithms and Heuristics. 10-11
  

Bioinformatics

• Shiquan Wu, Xun Gu:
  Gene Network: Model, Dynamics and Simulation. 12-21
  
• Guillaume Blin, Romeo Rizzi:
  Conserved Interval Distance Computation Between Non-trivial Genomes. 22-31
  
• Sergey Bereg, Binhai Zhu:
  RNA Multiple Structural Alignment with Longest Common Subsequences. 32-41
  
• Marie-France Sagot, Eric Tannier:
  Perfect Sorting by Reversals. 42-51
  
• Chunfang Zheng, David Sankoff:
  Genome Rearrangements with Partially Ordered Chromosomes. 52-62
  
• Tao Liu, Jijun Tang, Bernard M. E. Moret:
  Quartet-Based Phylogeny Reconstruction from Gene Orders. 63-73
  
• Jinsong Tan, Kok Seng Chua, Louxin Zhang:
  Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis. 74-83
  
• Luay Nakhleh, Derek A. Ruths, Li-San Wang:
  RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer. 84-93
  
• Hengwu Li, Daming Zhu:
  A New Pseudoknots Folding Algorithm for RNA Structure Prediction. 94-103
  
• Miklós Csürös, Bin Ma:
  Rapid Homology Search with Two-Stage Extension and Daughter Seeds. 104-114
  
• Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul:
  On the Approximation of Computing Evolutionary Trees. 115-125
  

Networks

• Xiang-Yang Li, Peng-Jun Wan:
  Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks. 126-135
  
• Zhipeng Cai, Guohui Lin, Guoliang Xue:
  Improved Approximation Algorithms for the Capacitated Multicast Routing Problem. 136-145
  
• Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou:
  Construction of Scale-Free Networks with Partial Information. 146-155
  
• Yvo Desmedt, Yongge Wang, Reihaneh Safavi-Naini, Huaxiong Wang:
  Radio Networks with Reliable Communication. 156-166
  
• Martin Hoefer, Piotr Krysta:
  Geometric Network Design with Selfish Agents. 167-178
  
• Piotr Krysta:
  Bicriteria Network Design via Iterative Rounding. 179-187
  
• Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger:
  Interference in Cellular Networks: The Minimum Membership Set Cover Problem. 188-198
  
• Xujin Chen, Xiao-Dong Hu, Tianping Shuai:
  Routing and Coloring for Maximal Number of Trees. 199-209
  
• Weizhao Wang, Xiang-Yang Li, Zheng Sun:
  Share the Multicast Payment Fairly. 210-219
  
• Jianping Li, Kang Li, Ken C. K. Law, Hao Zhao:
  On Packing and Coloring Hyperedges in a Cycle. 220-229
  
• Hai Liu, Peng-Jun Wan, Xiaohua Jia:
  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks. 230-239
  

String Algorithms

• Hirotaka Ono, Yen Kaow Ng:
  Best Fitting Fixed-Length Substring Patterns for a Set of Strings. 240-250
  
• Saverio Caminiti, Rossella Petreschi:
  String Coding of Trees with Locality and Heritability. 251-262
  
• David Liben-Nowell, Erik Vee, An Zhu:
  Finding Longest Increasing and Common Subsequences in Streaming Data. 263-272
  
• Joong Chae Na, Raffaele Giancarlo, Kunsoo Park:
  O(n²log n) Time On-Line Construction of Two-Dimensional Suffix Trees. 273-282
  

Scheduling

• Minming Li, Becky Jie Liu, Frances F. Yao:
  Min-Energy Voltage Allocation for Tree-Structured Tasks. 283-296
  
• Zhiyi Tan, Yong He:
  Semi-online Problems on Identical Machines with Inexact Partial Information. 297-307
  
• Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault:
  On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. 308-317
  
• 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
  

Complexity

• Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao:
  Oblivious and Adaptive Strategies for the Majority and Plurality Problems. 329-338
  
• Jin-yi Cai, Venkatesan T. Chakaravarthy:
  A Note on Zero Error Algorithms Having Oracle Access to One NP Query. 339-348
  
• Ker-I Ko, Fuxiang Yu:
  On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain. 349-358
  
• Robert Rettinger, Xizhong Zheng:
  Solovay Reducibility on D-c.e Real Numbers. 359-368
  

Steiner Trees

• Fábio Viduani Martinez, José Coelho de Pina, José Soares:
  Algorithms for Terminal Steiner Trees. 369-379
  
• Parinya Chalermsook, Jittat Fakcharoenphol:
  Simple Distributed Algorithms for Approximating Minimum Steiner Trees. 380-389
  
• Luciano Gualà, Guido Proietti:
  A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. 390-400
  

Graph Drawing and Layout Design

• Christian Bachmaier, Florian Fischer, Michael Forster:
  Radial Coordinate Assignment for Level Graphs. 401-410
  
• Guowu Yang, Xiaoyu Song, Hannah Honghua Yang, Fei Xie:
  A Theoretical Upper Bound for IP-Based Floorplanning. 411-419
  

Quantum Computing

• Sean Hallgren, Alexander Russell, Igor Shparlinski:
  Quantum Noisy Rational Function Reconstruction. 420-429
  
• Shengyu Zhang:
  Promised and Distributed Quantum Search. 430-439
  

Randomized Algorithms

• Fabien Viger, Matthieu Latapy:
  Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence. 440-449
  
• Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
  Randomized Quicksort and the Entropy of the Random Source. 450-460
  
• Piotr Sankowski:
  Subquadratic Algorithm for Dynamic Shortest Distances. 461-470
  
• Q. Ding, J. Qian, W. Tsang, C. Wang:
  Randomly Generating Triangulations of a Simple Polygon. 471-480
  

Geometry

• Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki:
  Triangulating a Convex Polygon with Small Number of Non-standard Bars. 481-489
  
• Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu:
  A PTAS for a Disc Covering Problem Using Width-Bounded Separators. 490-503
  
• Xiaodong Wu:
  Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy. 504-513
  
• Hanno Lefmann:
  Distributions of Points in d Dimensions and Large k-Point Simplices. 514-523
  
• Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
  Exploring Simple Grid Polygons. 524-533
  
• Xuehou Tan:
  Approximation Algorithms for Cutting Out Polygons with Lines and Rays. 534-543
  
• Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
  Efficient Non-intersection Queries on Aggregated Geometric Data. 544-553
  
• Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
  An Upper Bound on the Number of Rectangulations of a Point Set. 554-559
  

Codes

• Chung Keung Poon, Wai Keung Yiu:
  Opportunistic Data Structures for Range Queries. 560-569
  
• Frank Ruskey, Aaron Williams:
  Generating Combinations by Prefix Shifts. 570-576
  
• An Braeken, Ventzislav Nikov, Svetla Nikova:
  Error-Set Codes and Related Objects. 577-585
  

Finance

• Xiaotie Deng, Li-Sha Huang, Minming Li:
  On Walrasian Price of CPU Time. 586-595
  
• Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas:
  On-Line Algorithms for Market Equilibria. 596-607
  
• Anshul Kothari, Subhash Suri, Yunhong Zhou:
  Interval Subset Sum and Uniform-Price Auction Clearing. 608-620
  

Facility Location

• Sung Eun Bae, Tadao Takaoka:
  Improved Algorithms for the K-Maximum Subarray Problem for Small K. 621-631
  
• Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou:
  Server Allocation Algorithms for Tiered Systems. 632-643
  
• Guang Xu, Jinhui Xu:
  An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties. 644-653
  
• Marek Chrobak, Claire Kenyon, Neal E. Young:
  The Reverse Greedy Algorithm for the Metric K-Median Problem. 654-660
  
• Guoxuan Ma, Jiming Peng, Yu Wei:
  On Approximate Balanced Bi-clustering. 661-670
  

Graph Theory

• Tao-Ming Wang:
  Toroidal Grids Are Anti-magic. 671-679
  
• Xiaomin Chen, Mario Szegedy, Lei Wang:
  Optimally Balanced Forward Degree Sequence. 680-689
  
• Chandan K. Dubey, Shashank K. Mehta, Jitender S. Deogun:
  Conditionally Critical Indecomposable Graphs. 690-700
  

Graph Algorithms

• Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot:
  A Tight Analysis of the Maximal Matching Heuristic. 701-709
  
• Hossein Jowhari, Mohammad Ghodsi:
  New Streaming Algorithms for Counting Triangles in Graphs. 710-716
  
• 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
  
• Luca Allulli, Giorgio Ausiello, Luigi Laura:
  On the Power of Lookahead in On-Line Vehicle Routing Problems. 728-736
  
• Ewa Misiolek, Danny Z. Chen:
  Efficient Algorithms for Simplifying Flow Networks. 737-746
  
• Takuro Fukunaga, Hiroshi Nagamochi:
  Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems. 747-756
  
• Michael Dom, Jiong Guo, Rolf Niedermeier:
  Bounded Degree Closest k-Tree Power Is NP-Complete. 757-766
  
• Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
  A New Algorithm for the Hypergraph Transversal Problem. 767-776
  
• 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
  
• Wen-Lian Hsu:
  A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees. 787-797
  
• Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
  Algorithms for Finding Distance-Edge-Colorings of Graphs. 798-807
  
• 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
  
• Chung-Shou Liao, Der-Tsai Lee:
  Power Domination Problem in Graphs. 818-828
  
• Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
  Complexity and Approximation of Satisfactory Partition Problems. 829-838
  
• Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi:
  Distributed Weighted Vertex Cover via Maximal Matchings. 839-848
  
• Jan Kára, Jan Kratochvíl, David R. Wood:
  On the Complexity of the Balanced Vertex Ordering Problem. 849-858
  
• Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens:
  An O(2^O(k)n³) FPT Algorithm for the Undirected Feedback Vertex Set Problem. 859-869
  
• Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
  Approximating the Longest Cycle Problem on Graphs with Bounded Degree. 870-884
  

Others

• Yong He, György Dósa:
  Bin Packing and Covering Problems with Rejection. 885-894
  
• Lane A. Hemaspaandra, Mayur Thakur:
  Query-Monotonic Turing Reductions. 895-904
  
• Oscar H. Ibarra, Sara Woodworth, Hsu-Chun Yen, Zhe Dang:
  On Sequential and 1-Deterministic P Systems. 905-914
  
• Xiaofei Huang:
  Global Optimality Conditions and Near-Perfect Optimization in Coding. 915-924
  
• Martin Kutz, Attila Pór:
  Angel, Devil, and King. 925-934
  
• Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth:
  Overlaps Help: Improved Bounds for Group Testing with Interval Queries. 935-944
  
• Eun-Jun Yoon, Kee-Young Yoo:
  New Efficient Simple Authenticated Key Agreement Protocol. 945-954
  
• Zhixiang Chen, Bin Fu:
  A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm. 955-964
  
• Sebastian Böcker, Zsuzsanna Lipták:
  The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a₁). 965-974
  
• Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
  W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. 975-984
  
• Xiaoguang Yang, Jianzhong Zhang:
  Some New Results on Inverse Sorting Problems. 985-992
  

Last update Tue May 21 16:24:43 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page