WALCOM : Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings /: Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings. (2020)

• Record Type: Book
• Further Information: Note: M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung.
• Editors: Rahman, M. Sohel; Sadakane, Kunihiko; Sung, Wing-Kin
• Contents: Drawing Planar Graphs.- Space Efficient Separator Algorithms for Planar Graphs.- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks.- Optimum Algorithm for the Mutual Visibility Problem.- Routing in Histograms.- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips.- Shortest Covers of All Cyclic Shifts of a String.- Packing Trees into 1-planar Graphs.- Angle Covers: Algorithms and Complexity.- Fast Multiple Pattern Cartesian Tree Matching.- Generalized Dictionary Matching under Substring Consistent Equivalence Relations.- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons.- Maximum Bipartite Subgraph of Geometric Intersection Graphs.- The Stub Resolution of 1-planar Graphs.- Dispersion of Mobile Robots on Grids.- Packing and Covering with Segments.- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration.- Partitioning a graph into complementary subgraphs.- On the Maximum Edge-Pair Embedding Bipartite Matching.- Packing Arc-Disjoint Cycles in Bipartite Tournaments.- Matching random colored points with rectangles.- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams.- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs.- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs.- Faster Privacy-Preserving Computation of Edit Distance with Moves.- Parameterized Algorithms for the Happy Set Problem.- An Experimental Study of a 1-planarity Testing and Embedding Algorithm.- Trichotomy for the recon guration problem of integer linear systems.- Train Scheduling: Hardness and Algorithms.
• Publisher Details: Cham : Springer
• Publication Date: 2020
• Copyright Date: 2020
• Extent: 1 online resource (350 pages)
• Subjects: Computer science; Algorithms; Data structures (Computer science); Artificial intelligence; Computers -- Information Theory; Computers -- Data Processing; Computers -- Intelligence (AI) & Semantics; Algorithms & data structures; Mathematical theory of computation; Artificial intelligence; Computers -- Programming -- Algorithms; Computer science--Mathematics
• Languages: English
• ISBNs: 9783030398811
• Related ISBNs: 9783030398804
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.