Skip to main content
SpringerLink
Log in

Combinatorial Algorithms

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Costas S. Iliopoulos

    1. Digital Ecosystems & Business Intelligence Institute, Curtin University, Perth, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. William F. Smyth

    1. Department of Computing and Software Information Technology Building, McMaster University, Hamilton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: IWOCA 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  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. A Golden Ratio Parameterized Algorithm for Cluster Editing

    • Sebastian Böcker
    Pages 85-95

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

    • Ching-Lueh Chang, Yuh-Dauh Lyuu
    Pages 96-105

  10. How Not to Characterize Planar-Emulable Graphs

    • Markus Chimani, Martin Derka, Petr Hliněný, Matěj Klusáček
    Pages 106-120

  11. Testing Monotone Read-Once Functions

    • Dmitry V. Chistikov
    Pages 121-134

  12. Complexity of Cycle Transverse Matching Problems

    • Ross Churchley, Jing Huang, Xuding Zhu
    Pages 135-143

  13. Efficient Conditional Expectation Algorithms for Constructing Hash Families

    • Charles J. Colbourn
    Pages 144-155

  14. 2-Layer Right Angle Crossing Drawings

    • Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta
    Pages 156-169

  15. Hamiltonian Orthogeodesic Alternating Paths

    • Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter
    Pages 170-181

  16. 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

  17. Two Constant-Factor-Optimal Realizations of Adaptive Heapsort

    • Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
    Pages 195-208

  18. A Unifying Property for Distribution-Sensitive Priority Queues

    • Amr Elmasry, Arash Farzan, John Iacono
    Pages 209-222

  19. Enumerating Tatami Mat Arrangements of Square Grids

    • Alejandro Erickson, Mark Schurch
    Pages 223-235

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

    • T. Aaron Gulliver
    Pages 236-246
Back to top

Other volumes

  1. Combinatorial Algorithms

Keywords

About this book

This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Victoria, 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.

Editors and Affiliations

  • Digital Ecosystems & Business Intelligence Institute, Curtin University, Perth, Australia

    Costas S. Iliopoulos

  • Department of Computing and Software Information Technology Building, McMaster University, Hamilton, Canada

    William F. Smyth

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation