Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Algorithms

25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Kratochvíl Jan

    1. Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Mirka Miller

    1. University of Newcastle, Newcastle, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Dalibor Froncek

    1. University of Minnesota, Duluth Department of Mathematics, Duluth, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

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 EPUB and 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 (32 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism

    • Faisal N. Abu-Khzam, Édouard Bonnet, Florian Sikora
    Pages 1-12

  3. Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem

    • Anna Adamaszek, Guillaume Blin, Alexandru Popa
    Pages 13-23

  4. Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk

    • Mousa Alfalayleh, Ljiljana Brankovic
    Pages 24-36

  5. On the Galois Lattice of Bipartite Distance Hereditary Graphs

    • Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
    Pages 37-48

  6. Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance

    • Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth
    Pages 49-61

  7. Border Correlations, Lattices, and the Subgraph Component Polynomial

    • Francine Blanchet-Sadri, Michelle Cordier, Rachel Kirsch
    Pages 62-73

  8. Computing Minimum Length Representations of Sets of Words of Uniform Length

    • Francine Blanchet-Sadri, Andrew Lohr
    Pages 74-85

  9. Computing Primitively-Rooted Squares and Runs in Partial Words

    • Francine Blanchet-Sadri, Jordan Nikkel, J. D. Quigley, Xufan Zhang
    Pages 86-97

  10. 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle

    • Ilkyoo Choi, Jan Ekstein, Přemysl Holub, Bernard Lidický
    Pages 98-109

  11. Computing Heat Kernel Pagerank and a Local Clustering Algorithm

    • Fan Chung, Olivia Simpson
    Pages 110-121

  12. A \(\varGamma \)-magic Rectangle Set and Group Distance Magic Labeling

    • Sylwia Cichacz
    Pages 122-127

  13. Solving Matching Problems Efficiently in Bipartite Graphs

    • Selma Djelloul
    Pages 128-139

  14. A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras

    • Stephane Durocher, Saeed Mehrabi
    Pages 140-152

  15. On Decomposing the Complete Graph into the Union of Two Disjoint Cycles

    • Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden
    Pages 153-163

  16. Reconfiguration of Vertex Covers in a Graph

    • Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
    Pages 164-175

  17. Space Efficient Data Structures for Nearest Larger Neighbor

    • Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti
    Pages 176-187

  18. Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory

    • Gerold Jäger, Marcin Peczarski
    Pages 188-199

  19. On Maximum Common Subgraph Problems in Series-Parallel Graphs

    • Nils Kriege, Florian Kurpicz, Petra Mutzel
    Pages 200-212

  20. Profile-Based Optimal Matchings in the Student/Project Allocation Problem

    • Augustine Kwanashie, Robert W. Irving, David F. Manlove, Colin T. S. Sng
    Pages 213-225
Back to top

Keywords

About this book

This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.

Editors and Affiliations

  • Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic

    Kratochvíl Jan

  • University of Newcastle, Newcastle, Australia

    Mirka Miller

  • University of Minnesota, Duluth Department of Mathematics, Duluth, USA

    Dalibor Froncek

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation