Combinatorial Algorithms: 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings...

— —

Costas Iliopoulos Hon Wai Leong

Combinatorial Algorithms

Name: Combinatorial Algorithms
Price: 101.37 AUD
Availability: OutOfStock
ISBN: 9783319946665

29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings

Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung

$126.95 $101.37

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We will update you on expected arrival time to us. If this delay is too long, please let us know within 2 business days and we can give you options regarding cancelling or adjusting your order. More details on cancelling your order can be found in our Terms of Trade.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer International Publishing AG
04 July 2018

Discrete mathematics; Combinatorics & graph theory; Algorithms & data structures; Maths for computer scientists

Series: Lecture Notes in Computer Science

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.

Edited by: Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung
Imprint: Springer International Publishing AG
Country of Publication: Switzerland
Edition: 2018 ed.
Volume: 10979
Dimensions: Height: 235mm, Width: 155mm,
Weight: 623g
ISBN: 9783319946665
ISBN 10: 3319946668
Series: Lecture Notes in Computer Science
Pages: 388
Publication Date: 04 July 2018
Audience: Professional and scholarly , College/higher education , Undergraduate , Further / Higher Education
Format: Paperback
Publisher's Status: Active

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?.