LEADER 05777nam 22007695 450 001 996465948603316 005 20230329144336.0 010 $a3-319-94667-6 024 7 $a10.1007/978-3-319-94667-2 035 $a(CKB)3850000000033210 035 $a(DE-He213)978-3-319-94667-2 035 $a(MiAaPQ)EBC6243936 035 $a(PPN)229502385 035 $a(EXLCZ)993850000000033210 100 $a20180703d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Algorithms$b[electronic resource] $e29th International Workshop, IWOCA 2018, Singapore, July 16?19, 2018, Proceedings /$fedited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XIX, 388 p. 78 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10979 311 $a3-319-94666-8 320 $aIncludes bibliographical references and index. 327 $aSome Recent New Directions in Multivariate Algorithmics -- Survey of some recent near polynomial time results for Parity Games -- Range Minimum Queries and Applications -- Collision-free Routing Problem with Restricted L-path -- Linear clique-width of bi-complement reducible graphs -- Linear Ramsey numbers -- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families -- Minimum Polygons for Fixed Visibility VC-Dimension -- Minsum k-Sink Problem on Dynamic Flow Path Networks -- Fully leafed induced subtrees -- Pattern matching for k--track permutations -- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs -- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs -- Covering with Clubs: Complexity and Approximability -- On the Expected Number of Distinct Gapped Palindromic Factors -- Computational Complexity of Robot Arm Simulation Problems -- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation -- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth -- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem -- Structural Parameterizations for Colorful Components -- Analysis of Information Leakage due to Operative Errors in Card-based Protocols -- Zero-Suppression and Computation Models -- The Crossing Number of Seq-Shellable Drawings of Complete Graphs -- Cryptographic limitations on polynomial-time a posteriori query learning -- Placing Segments On Parallel Arcs -- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem -- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression -- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation -- Separating Interaction Effects Using Locating and Detecting Arrays -- An Efficient Representation of Partitions of Integers -- How far from a worst solution a random solution of a k-CSP instance can be?. 330 $aThis book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomised algorithms, algorithms for big data analytics, and new paradigms of computation. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10979 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aData protection 606 $aSoftware engineering 606 $aImage processing?Digital techniques 606 $aComputer vision 606 $aData structures (Computer science) 606 $aInformation theory 606 $aDiscrete Mathematics in Computer Science 606 $aData and Information Security 606 $aSoftware Engineering 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 606 $aData Structures and Information Theory 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aData protection. 615 0$aSoftware engineering. 615 0$aImage processing?Digital techniques. 615 0$aComputer vision. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aData and Information Security. 615 24$aSoftware Engineering. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 615 24$aData Structures and Information Theory. 676 $a511.6 702 $aIliopoulos$b Costas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLeong$b Hon Wai$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSung$b Wing-Kin$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465948603316 996 $aCombinatorial Algorithms$92868813 997 $aUNISA