Computing and Combinatorics

Complexity and Approximation.- Complexity and Enumeration in Models of Genome Rearrangement.- Conditional automatic complexity and its metrics.- Streaming and Query Once Space Complexity of Longest Increasing Subsequence.- Approximating Decision Trees with Priority Hypotheses.- Approximating the $lambda$-low-density Value.- Exponential Time Complexity of the Complex Weighted Boolean #CSP.- Hardness and approximation for the star $p$-hub routing cost problem in $Delta_beta$-metric graphs.- Graph Algorithms.- Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs.- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width.- Shortest Longest-Path Graph Orientations.- Sink Location Problems in Dynamic Flow Grid Networks.- List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs.- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs.- Sum-of-Local-Effects Data Structures for Separable Graphs.- Applied Algorithms.- Variants of Euclidean k-center Clusterings.- Red-black Spanners for Mixed-charging Vehicular Networks.- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds via Locally-iterative Algorithms.- On Detecting Some Defective Items in Group Testing.- An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression.- Multi-Load Agent Path Finding for Online Pickup and Delivery Problem.- Improved Sourcewise Roundtrip Spanners with Constant Stretch.- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy Preservation.- The k edge-vertex domination problem.- Resource-Adaptive Newton's Method for Distributed Learning.- DR-submodular Function Maximization with Adaptive Stepsize.- On the Routing Problems in Graphs with Ordered Forbidden