WALCOM: Algorithms and Computation
Springer International Publishing (Verlag)
978-3-030-39880-4 (ISBN)
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.
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.
| Erscheinungsdatum | 31.01.2020 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | XIII, 350 p. 140 illus., 55 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 557 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • Applications • approximation algorithms • approximation algorithms analysis • Artificial Intelligence • Bipartite Graphs • Computer Science • conference proceedings • data structures design and analysis • distributed algorithms • dsign and analysis of algorithms • graph algorithms analysis • Graphic methods • graph theory • Informatics • Mathematical Optimization • online algorithms • parameterized complexity and exact algorithms • planar graph • polynomial-time algorithms • randomness, geometry and discrete structures • Research • Robotics • robots • Theory of Computation |
| ISBN-10 | 3-030-39880-3 / 3030398803 |
| ISBN-13 | 978-3-030-39880-4 / 9783030398804 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
