Combinatorial Algorithms

22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers

Editors:

ISBN: 978-3-642-25010-1 (Print) 978-3-642-25011-8 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-18

    Weighted Improper Colouring

  3. No Access

    Book Chapter

    Pages 19-30

    Algorithmic Aspects of Dominator Colorings in Graphs

  4. No Access

    Book Chapter

    Pages 31-43

    Parameterized Longest Previous Factor

  5. No Access

    Book Chapter

    Pages 44-56

    p-Suffix Sorting as Arithmetic Coding

  6. No Access

    Book Chapter

    Pages 57-70

    Periods in Partial Words: An Algorithm

  7. No Access

    Book Chapter

    Pages 71-84

    The 1-Neighbour Knapsack Problem

  8. No Access

    Book Chapter

    Pages 85-95

    A Golden Ratio Parameterized Algorithm for Cluster Editing

  9. No Access

    Book Chapter

    Pages 96-105

    Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs

  10. No Access

    Book Chapter

    Pages 106-120

    How Not to Characterize Planar-Emulable Graphs

  11. No Access

    Book Chapter

    Pages 121-134

    Testing Monotone Read-Once Functions

  12. No Access

    Book Chapter

    Pages 135-143

    Complexity of Cycle Transverse Matching Problems

  13. No Access

    Book Chapter

    Pages 144-155

    Efficient Conditional Expectation Algorithms for Constructing Hash Families

  14. No Access

    Book Chapter

    Pages 156-169

    2-Layer Right Angle Crossing Drawings

  15. No Access

    Book Chapter

    Pages 170-181

    Hamiltonian Orthogeodesic Alternating Paths

  16. No Access

    Book Chapter

    Pages 182-194

    Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order

  17. No Access

    Book Chapter

    Pages 195-208

    Two Constant-Factor-Optimal Realizations of Adaptive Heapsort

  18. No Access

    Book Chapter

    Pages 209-222

    A Unifying Property for Distribution-Sensitive Priority Queues

  19. No Access

    Book Chapter

    Pages 223-235

    Enumerating Tatami Mat Arrangements of Square Grids

  20. No Access

    Book Chapter

    Pages 236-246

    Quasi-Cyclic Codes over \(\mathbb{F}_{13}\)

  21. No Access

    Book Chapter

    Pages 247-260

    Acyclic Colorings of Graph Subdivisions

previous Page of 2