Combinatorial Algorithms

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

  • Costas S. Iliopoulos
  • William F. Smyth
Conference proceedings IWOCA 2011

DOI: 10.1007/978-3-642-25011-8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7056)

Table of contents (30 papers)

  1. Front Matter
  2. Weighted Improper Colouring
    Julio Araujo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
    Pages 1-18
  3. Algorithmic Aspects of Dominator Colorings in Graphs
    S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
    Pages 19-30
  4. Parameterized Longest Previous Factor
    Richard Beal, Donald Adjeroh
    Pages 31-43
  5. p-Suffix Sorting as Arithmetic Coding
    Richard Beal, Donald Adjeroh
    Pages 44-56
  6. Periods in Partial Words: An Algorithm
    Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia
    Pages 57-70
  7. The 1-Neighbour Knapsack Problem
    Glencora Borradaile, Brent Heeringa, Gordon Wilfong
    Pages 71-84
  8. How Not to Characterize Planar-Emulable Graphs
    Markus Chimani, Martin Derka, Petr Hliněný, Matěj Klusáček
    Pages 106-120
  9. Testing Monotone Read-Once Functions
    Dmitry V. Chistikov
    Pages 121-134
  10. Complexity of Cycle Transverse Matching Problems
    Ross Churchley, Jing Huang, Xuding Zhu
    Pages 135-143
  11. 2-Layer Right Angle Crossing Drawings
    Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta
    Pages 156-169
  12. Hamiltonian Orthogeodesic Alternating Paths
    Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter
    Pages 170-181
  13. Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order
    Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams
    Pages 182-194
  14. Two Constant-Factor-Optimal Realizations of Adaptive Heapsort
    Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
    Pages 195-208
  15. A Unifying Property for Distribution-Sensitive Priority Queues
    Amr Elmasry, Arash Farzan, John Iacono
    Pages 209-222
  16. Enumerating Tatami Mat Arrangements of Square Grids
    Alejandro Erickson, Mark Schurch
    Pages 223-235
  17. Quasi-Cyclic Codes over \(\mathbb{F}_{13}\)
    T. Aaron Gulliver
    Pages 236-246

About these proceedings

Introduction

This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Vancouver, BC, Canada, in July 2011.
The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.

Keywords

computational complexity exact algorithm fingerprints kinetic data structures triangulated plane graph

Editors and affiliations

  • Costas S. Iliopoulos
    • 1
  • William F. Smyth
    • 2
  1. 1.Digital Ecosystems & Business Intelligence InstituteCurtin UniversityPerthAustralia
  2. 2.Department of Computing and Software Information Technology BuildingMcMaster UniversityHamiltonCanada

Bibliographic information

  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-25010-1
  • Online ISBN 978-3-642-25011-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349