Coverart for item
The Resource Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers, Kratochvíl Jan, Mirka Miller, Dalibor Froncek (eds.), (electronic book)

Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers, Kratochvíl Jan, Mirka Miller, Dalibor Froncek (eds.), (electronic book)

Label
Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers
Title
Combinatorial algorithms
Title remainder
25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers
Statement of responsibility
Kratochvíl Jan, Mirka Miller, Dalibor Froncek (eds.)
Title variation
IWOCA 2014
Creator
Contributor
Editor
Subject
Genre
Language
eng
Summary
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
Member of
Cataloging source
GW5XE
Dewey number
511/.6
Illustrations
illustrations
Index
index present
LC call number
QA164
LC item number
.I58 2015eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2014
http://bibfra.me/vocab/lite/meetingName
International Workshop on Combinatorial Algorithms
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorDate
1949-
http://library.link/vocab/relatedWorkOrContributorName
  • Jan, Kratochvíl
  • Miller, Mirka
  • Froncek, Dalibor
Series statement
Lecture notes in computer science,
Series volume
8986
http://library.link/vocab/subjectName
  • Combinatorial analysis
  • Algorithms
  • Discrete Mathematics in Computer Science
  • Algorithm Analysis and Problem Complexity
  • Mathematical Logic and Formal Languages
  • Data Structures
  • Computational Biology/Bioinformatics
Label
Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers, Kratochvíl Jan, Mirka Miller, Dalibor Froncek (eds.), (electronic book)
Instantiates
Publication
Note
Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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 Algorithms for the Independent Feedback Vertex Set Problem -- Lossless seeds for searching short patterns with high error rates
Dimensions
unknown
Extent
1 online resource (xiii, 377 pages)
File format
unknown
Form of item
online
Isbn
9783319193144
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-19315-1
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
  • SPR910937002
  • ocn910937002
Label
Combinatorial algorithms : 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised selected papers, Kratochvíl Jan, Mirka Miller, Dalibor Froncek (eds.), (electronic book)
Publication
Note
Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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 Algorithms for the Independent Feedback Vertex Set Problem -- Lossless seeds for searching short patterns with high error rates
Dimensions
unknown
Extent
1 online resource (xiii, 377 pages)
File format
unknown
Form of item
online
Isbn
9783319193144
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-19315-1
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
  • SPR910937002
  • ocn910937002

Library Locations

Processing Feedback ...