Computing and Combinatorics

Subspace approximation with outliers.- Linear-time Algorithms for Eliminating Claws in Graphs.- A new lower bound for the eternal vertex cover number of graphs.- Bounded-Degree Spanners in the Presence of Polygonal Obstacles.- End-Vertices of AT-free Bigraphs.- Approaching Optimal Duplicate Detection in a Sliding Window.- Computational Complexity Characterization of Protecting Elections from Bribery.- Coding with Noiseless Feedback over the Z-channel.- Path-monotonic Upward Drawings of Plane Graphs.- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-e cient ShortestPath Queries in Road Networks.- Visibility polygon queries among dynamic polygonal obstacles in plane.- How Hard is Completeness Reasoning for Conjunctive Queries?.- Imbalance Parameterized by Twin Cover Revisited.-Local Routing in a Tree Metric 1-Spanner.- Deep Specification Mining with Attention.- Constructing Independent Spanning Trees in Alternating Group Networks.-W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension.- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane.-Quantum Speedup for the Minimum Steiner Tree Problem.- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families.- Approximation algorithms for car-sharing problems.-Realization Problems on Reachability Sequences.- Power of Decision Trees with Monotone Queries.- Computing a maximum clique in geometric superclasses of disk graphs.- Visibility.-Tight approximation for the minimum bottleneck generalized matching problem.- Graph Classes and Approximability of the Happy Set Problem.- A Simple Primal-Dual Approximation Algorithm for 2-Edge-ConnectedSpanning Subgraphs.- Uniqueness of $DP$-Nash Subgraphs and $D$-sets.- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs.- Constructing Tree Decompositions of Graphs with Bounded Gonality.-Election Control through Social In uence with Unknown Preferences.- New