17. COCOON 2011: Dallas, TX, USA

• Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
  Derandomizing HSSW Algorithm for 3-SAT. 1-12
  
• Shuji Kijima, Yoshio Okamoto, Takeaki Uno:
  Dominating Set Counting in Graph Classes. 13-24
  
• Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
  The Density Maximization Problem in Graphs. 25-36
  
• Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker:
  FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time. 37-48
  
• Daming Zhu, Shaohan Ma, Pingping Zhang:
  Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems. 49-61
  
• Minghui Jiang, Yong Zhang:
  Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy. 62-73
  
• Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Francis C. M. Lau:
  Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum. 74-85
  
• Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
  On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. 86-97
  
• Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
  On Parameterized Independent Feedback Vertex Set. 98-109
  
• Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen:
  Cograph Editing: Complexity and Parameterized Algorithms. 110-121
  
• Tomoyuki Yamakami:
  Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems. 122-133
  
• Desh Ranjan, John E. Savage, Mohammad Zubair:
  Strong I/O Lower Bounds for Binomial and FFT Computation Graphs. 134-145
  
• Jin-yi Cai, Michael Kowalczyk:
  Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities. 146-157
  
• Dmitry Gavinsky, Martin Roetteler, Jérémie Roland:
  Quantum Algorithm for the Boolean Hidden Shift Problem. 158-167
  
• Jochen Messner, Thomas Thierauf:
  A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability. 168-179
  
• Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote:
  Proper n-Cell Polycubes in n - 3 Dimensions. 180-191
  
• Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu:
  Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. 192-203
  
• Tanaeem M. Moosa, M. Sohel Rahman:
  Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees. 204-212
  
• Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
  Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. 213-224
  
• Hsien-Chih Chang, Hsueh-I Lu:
  Computing the Girth of a Planar Graph in Linear Time. 225-236
  
• Ryan Williams:
  Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory. 237-239
  
• Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers:
  Unions of Disjoint NP-Complete Sets. 240-251
  
• Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran:
  ReachFewL = ReachUL. 252-258
  
• Yuichi Asahiro, Kenta Kanmera, Eiji Miyano:
  (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. 259-270
  
• Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram:
  Scheduling Jobs on Heterogeneous Platforms. 271-283
  
• Steven M. Kautz, Brad Shutters:
  Self-assembling Rulers for Approximating Generalized Sierpinski Carpets. 284-296
  
• Lauri Ahlroth, Olli Pottonen, André Schumacher:
  Approximately Uniform Online Checkpointing. 297-306
  
• Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno:
  Bandwidth of Convex Bipartite Graphs and Related Graphs. 307-318
  
• Narayan Vikas:
  Algorithms for Partition of Some Class of Graphs under Compaction. 319-330
  
• Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
  A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. 331-342
  
• Qilong Feng, Jianxin Wang, Jianer Chen:
  Matching and P 2-Packing: Weighted Versions. 343-353
  
• Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
  On Totally Unimodularity of Edge-Edge Adjacency Matrices. 354-365
  
• Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang:
  The Topology Aware File Distribution Problem. 366-378
  
• Yilin Shen, Nam P. Nguyen, My T. Thai:
  Exploiting the Robustness on Power-Law Networks. 379-390
  
• Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
  Competitive Algorithms for Online Pricing. 391-401
  
• Cong Tian, Zhenhua Duan:
  Making Abstraction-Refinement Efficient in Model Checking. 402-413
  
• Guozhen Tan, Jinghao Sun:
  An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times. 414-431
  
• François Le Gall, Yuichi Yoshida:
  Property Testing for Cyclic Groups and Beyond. 432-443
  
• Vikraman Arvind, Johannes Köbler:
  Canonizing Hypergraphs under Abelian Group Action. 444-455
  
• Gregory Karagiorgos, Dimitrios Poulakis:
  Linear Time Algorithms for the Basis of Abelian Groups. 456-466
  
• Angsheng Li, Yicheng Pan:
  Characterizations of Locally Testable Linear- and Affine-Invariant Families. 467-478
  
• Shengke Zeng, Shaoquan Jiang, Zhiguang Qin:
  A New Conditionally Anonymous Ring Signature. 479-491
  
• Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
  On the Right-Seed Array of a String. 492-502
  
• Huy Hoang Do, Wing-Kin Sung:
  Compressed Directed Acyclic Word Graph with Application in Local Alignment. 503-518
  
• Juha Kortelainen, Tuomas Kortelainen, Ari Vesanen:
  Unavoidable Regularities in Long Words with Bounded Number of Symbol Occurrences. 519-530
  
• Berkeley R. Churchill, Edmund A. Lamagna:
  Summing Symbols in Mutual Recurrences. 531-542
  
• Minghui Jiang:
  Flipping Triangles and Rectangles. 543-554
  
• Kewen Liao, Hong Shen:
  Unconstrained and Constrained Fault-Tolerant Resource Allocation. 555-566
  
• Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
  Finding Paths with Minimum Shared Edges. 567-578
  
• Annalisa De Bonis, Giovanni Di Crescenzo:
  Combinatorial Group Testing for Corruption Localizing Hashing. 579-591
  
• Sergiu Carpov, Jacques Carlier, Dritan Nace, Renaud Sirdey:
  Task Ordering and Memory Management Problem for Degree of Parallelism Estimation. 592-603
  
• Gianluca De Marco, Evangelos Kranakis, Gábor Wiener:
  Computing Majority with Triple Queries. 604-615
  
• Tengyu Ma, Xiaoming Sun, Huacheng Yu:
  A New Variation of Hat Guessing Games. 616-626
  
• Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang:
  Oblivious Transfer and n-Variate Linear Function Evaluation. 627-637
  
• Yiwei Jiang, An Zhang, Jueliang Hu:
  Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation. 638-648
  

Last update Sat May 25 02:33:18 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page