Combinatorial Algorithms
Description
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.
More details
Other editions
Additional editions
Content
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk.- On the Galois Lattice of Bipartite Distance Hereditary Graphs.- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance.- Border Correlations, Lattices and the Subgraph Component Polynomial.- Computing Minimum Length Representations of Sets of Words of Uniform Length.- Computing Primitively-Rooted Squares and Runs in Partial Words.- 3-coloring triangle-free planar graphs with a precolored 9-cycle.- Computing Heat Kernel Pagerank and a Local Clustering Algorithm.- Solving Matching Problems Efficiently in Bipartite Graphs.- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.- On decomposing the complete graph into the union of two disjoint cycles.- Reconfiguration of Vertex Covers in a Graph.- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory.- On Maximum Common Subgraph Problems in Series-Parallel Graphs.- Profile-based optimal matchings in the Student/Project Allocation Problem.- The Min-Max Edge q-Coloring Problem.- Speeding up Graph Algorithms via Switching Classes.- Metric Dimension for Amalgamations of Graphs.- Deterministic Algorithms for the Independent Feedback Vertex Set Problem.- Lossless seeds for searching short patterns with high error rates.