LEADER 05478nam 22008535 450 001 9910483048203321 005 20251226195153.0 010 $a3-319-19315-5 024 7 $a10.1007/978-3-319-19315-1 035 $a(CKB)3710000000436862 035 $a(SSID)ssj0001547021 035 $a(PQKBManifestationID)16141578 035 $a(PQKBTitleCode)TC0001547021 035 $a(PQKBWorkID)14795963 035 $a(PQKB)11001651 035 $a(DE-He213)978-3-319-19315-1 035 $a(MiAaPQ)EBC6283612 035 $a(MiAaPQ)EBC5586337 035 $a(Au-PeEL)EBL5586337 035 $a(OCoLC)910937002 035 $a(PPN)186399286 035 $a(EXLCZ)993710000000436862 100 $a20150606d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Algorithms $e25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers /$fedited by Kratochvíl Jan, Mirka Miller, Dalibor Froncek 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XIII, 377 p. 70 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8986 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-319-19314-7 320 $aIncludes bibliographical references and index. 327 $aOn 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8986 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aMachine theory 606 $aArtificial intelligence$xData processing 606 $aBioinformatics 606 $aDiscrete Mathematics in Computer Science 606 $aDiscrete Mathematics 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aData Science 606 $aComputational and Systems Biology 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aArtificial intelligence$xData processing. 615 0$aBioinformatics. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aDiscrete Mathematics. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 615 24$aData Science. 615 24$aComputational and Systems Biology. 676 $a511.6 702 $aJan$b Kratochvíl$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMiller$b Mirka$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFroncek$b Dalibor$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483048203321 996 $aCombinatorial Algorithms$92868813 997 $aUNINA