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

Author:   M. Sohel Rahman ,  Kunihiko Sadakane ,  Wing-Kin Sung
Publisher:   Springer Nature Switzerland AG
Edition:   2020 ed.
Volume:   12049
ISBN:  

9783030398804


Pages:   350
Publication Date:   28 January 2020
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $155.22 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.

Full Product Details

Author:   M. Sohel Rahman ,  Kunihiko Sadakane ,  Wing-Kin Sung
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Edition:   2020 ed.
Volume:   12049
Weight:   0.557kg
ISBN:  

9783030398804


ISBN 10:   3030398803
Pages:   350
Publication Date:   28 January 2020
Audience:   Professional and scholarly ,  College/higher education ,  Professional & Vocational ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List