IWOCA 2011: Victoria, BC, Canada

• Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski:
  Weighted Improper Colouring. 1-18
  
• S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
  Algorithmic Aspects of Dominator Colorings in Graphs. 19-30
  
• Richard Beal, Donald A. Adjeroh:
  Parameterized Longest Previous Factor. 31-43
  
• Richard Beal, Donald A. Adjeroh:
  p-Suffix Sorting as Arithmetic Coding. 44-56
  
• Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia:
  Periods in Partial Words: An Algorithm. 57-70
  
• Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
  The 1-Neighbour Knapsack Problem. 71-84
  
• Sebastian Böcker:
  A Golden Ratio Parameterized Algorithm for Cluster Editing. 85-95
  
• Ching-Lueh Chang, Yuh-Dauh Lyuu:
  Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs. 96-105
  
• Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
  How Not to Characterize Planar-Emulable Graphs. 106-120
  
• Dmitry V. Chistikov:
  Testing Monotone Read-Once Functions. 121-134
  
• Ross Churchley, Jing Huang, Xuding Zhu:
  Complexity of Cycle Transverse Matching Problems. 135-143
  
• Charles J. Colbourn:
  Efficient Conditional Expectation Algorithms for Constructing Hash Families. 144-155
  
• Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
  2-Layer Right Angle Crossing Drawings. 156-169
  
• Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
  Hamiltonian Orthogeodesic Alternating Paths. 170-181
  
• Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams:
  Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. 182-194
  
• Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
  Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. 195-208
  
• Amr Elmasry, Arash Farzan, John Iacono:
  A Unifying Property for Distribution-Sensitive Priority Queues. 209-222
  
• Alejandro Erickson, Mark Schurch:
  Enumerating Tatami Mat Arrangements of Square Grids. 223-235
  
• T. Aaron Gulliver:
  Quasi-Cyclic Codes over $\mathbb{F}_{13}$. 236-246
  
• Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman:
  Acyclic Colorings of Graph Subdivisions. 247-260
  
• Zahed Rahmati, Alireza Zarei:
  Kinetic Euclidean Minimum Spanning Tree in the Plane. 261-274
  
• Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey:
  Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. 275-286
  
• Frank Ruskey, Jennifer Woodcock:
  The Rand and Block Distances of Pairs of Set Partitions. 287-299
  
• Bojan Mohar, Petr Skoda:
  On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. 300-309
  
• Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
  A New View on Rural Postman Based on Eulerian Extension and Matching. 310-323
  
• Brett Stevens, Aaron Williams:
  Hamilton Cycles in Restricted Rotator Graphs. 324-336
  
• Anne Condon, Chris Thachuk:
  Efficient Codon Optimization with Motif Engineering. 337-348
  
• A. N. Trahtman:
  An Algorithm for Road Coloring. 349-360
  
• Robert Sámal, Rudolf Stolar, Tomás Valla:
  Complexity of the Cop and Robber Guarding Game. 361-373
  
• Markus Chimani, Petra Mutzel, Bernd Zey:
  Improved Steiner Tree Algorithms for Bounded Treewidth. 374-386
  

Last update Fri May 25 08:24:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page