StringologyTimes

Data Structures and Algorithms: 2019/6/29-31

1: Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time
2: Algorithms for weighted independent transversals and strong colouring
3: Min-Max Correlation Clustering via MultiCut
4: Approximate Inference in Structured Instances with Noisy Categorical Observations
5: Upper Bounding the Graph Edit Distance Based on Rings and Machine Learning
6: Streaming Quantiles Algorithms with Small Space and Update Time
7: Asynchronous Behavior Trees with Memory aimed at Aerial Vehicles with Redundancy in Flight Controller
8: Most abundant isotope peaks and efficient selection on $Y=X_1+X_2+\cdots + X_m$
9: Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View
10: Waiting is not easy but worth it: the online TSP on the line revisited