WALCOM: Algorithms and Computation

14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings

AvM. Sohel Rahman,Kunihiko Sadakane

Häftad, Engelska, 2020

Del 12049 i serien Lecture Notes in Computer Science

725 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2020-01-28
Mått:155 x 235 x 20 mm
Vikt:552 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:350
Förlag:Springer Nature Switzerland AG
ISBN:9783030398804

Utforska kategorier

Innehållsförteckning

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.