Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers /: 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers. (2015)
- Record Type:
- Book
- Title:
- Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers /: 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers. (2015)
- Main Title:
- Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers
- Other Titles:
- IWOCA 2014
- Further Information:
- Note: Jan Kratochvíl, Mirka Miller, Dalibor Froncek (eds.).
- Editors:
- Kratochvíl, Jan
Miller, Mirka, 1949-
Froncek, Dalibor - Other Names:
- International Workshop on Combinatorial Algorithms, 25th
- Contents:
- 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 AlgorithmsOn 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. … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2015
- Extent:
- 1 online resource (xiii, 377 pages), illustrations
- Subjects:
- 511/.6
Computer science
Combinatorial analysis -- Congresses
Algorithms -- Congresses
Algorithms
Combinatorial analysis
Computer Science
Engineering & Applied Sciences
Computer Science
Discrete Mathematics in Computer Science
Discrete Mathematics
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Data Structures
Computational Biology/Bioinformatics
Mathematics -- Discrete Mathematics
Computers -- Programming -- Algorithms
Mathematics -- Logic
Computers -- Data Modeling & Design
Computers -- Computer Science
Discrete mathematics
Algorithms & data structures
Mathematical theory of computation
Life sciences: general issues
Computational complexity
Computer software
Data structures (Computer science)
Bioinformatics
Computers -- Data Processing
Electronic books
Conference papers and proceedings
Electronic books - Languages:
- English
- ISBNs:
- 9783319193151
3319193155
3319193147
9783319193144 - Related ISBNs:
- 9783319193144
- Notes:
- Note: Online resource; title from PDF title page (SpringerLink, viewed June 11, 2015).
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.369880
- Ingest File:
- 02_349.xml