000 04742nam a22006255i 4500
001 978-3-319-19315-1
003 DE-He213
005 20200421111652.0
007 cr nn 008mamaa
008 150606s2015 gw | s |||| 0|eng d
020 _a9783319193151
_9978-3-319-19315-1
024 7 _a10.1007/978-3-319-19315-1
_2doi
050 4 _aQA76.9.M35
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aCombinatorial Algorithms
_h[electronic resource] :
_b25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers /
_cedited by Kratochv�il Jan, Mirka Miller, Dalibor Froncek.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXIII, 377 p. 70 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8986
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 0 _aBioinformatics.
650 0 _aDiscrete mathematics.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aDiscrete Mathematics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aData Structures.
650 2 4 _aComputational Biology/Bioinformatics.
700 1 _aJan, Kratochv�il.
_eeditor.
700 1 _aMiller, Mirka.
_eeditor.
700 1 _aFroncek, Dalibor.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319193144
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8986
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-19315-1
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54454
_d54454