Combinatorial Algorithms 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings /

This 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 d...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Iliopoulos, Costas (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Leong, Hon Wai (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sung, Wing-Kin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
Έκδοση:1st ed. 2018.
Σειρά:Theoretical Computer Science and General Issues ; 10979
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05565nam a2200589 4500
001 978-3-319-94667-2
003 DE-He213
005 20191021221756.0
007 cr nn 008mamaa
008 180703s2018 gw | s |||| 0|eng d
020 |a 9783319946672  |9 978-3-319-94667-2 
024 7 |a 10.1007/978-3-319-94667-2  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.M35  
072 7 |a PBD  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a PBD  |2 thema 
072 7 |a UYAM  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Combinatorial Algorithms  |h [electronic resource] :  |b 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings /  |c edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung. 
250 |a 1st ed. 2018. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2018. 
300 |a XIX, 388 p. 78 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 10979 
505 0 |a Some 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?. 
520 |a This 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. 
650 0 |a Computer science-Mathematics. 
650 0 |a Computer security. 
650 0 |a Software engineering. 
650 0 |a Optical data processing. 
650 0 |a Data structures (Computer science). 
650 1 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
650 2 4 |a Systems and Data Security.  |0 http://scigraph.springernature.com/things/product-market-codes/I28060 
650 2 4 |a Software Engineering.  |0 http://scigraph.springernature.com/things/product-market-codes/I14029 
650 2 4 |a Computer Imaging, Vision, Pattern Recognition and Graphics.  |0 http://scigraph.springernature.com/things/product-market-codes/I22005 
650 2 4 |a Data Structures and Information Theory.  |0 http://scigraph.springernature.com/things/product-market-codes/I15009 
700 1 |a Iliopoulos, Costas.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Leong, Hon Wai.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Sung, Wing-Kin.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319946665 
776 0 8 |i Printed edition:  |z 9783319946689 
830 0 |a Theoretical Computer Science and General Issues ;  |v 10979 
856 4 0 |u https://doi.org/10.1007/978-3-319-94667-2  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)