Algorithms and Complexity

.- Exact and Approximate High-Multiplicity Scheduling on Identical Machines. .- Unit refutations in Horn constraint systems. .- On Exact Learning of $d$-Monotone Functions. .- Computational Complexity of Combinatorial Distance Matrix Realisation. .- Online Range Assignment Problems. .- General Position Subset Selection in Line Arrangements. .- Branching Programs with Extended Memory: New Insights. .- Tatami Printer: Physical ZKPs for Tatami Puzzles. .- On the Price of Anarchy in Packet Routing Games with FIFO. .- On the Computational Complexity of Graph Reconstruction. .- Efficient Certifying Algorithms for Linear Classification. .- Improved Sublinear-time Moment Estimation using Weighted Sampling. .- Structural Parameterizations of Locating-Dominating Set and Test Cover. .- Improved bounds for group testing in arbitrary hypergraphs. .- A Parameterized Perspective of All-Colors. .- On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane. .- Degree Realization by Bipartite Cactus Graphs. .- On Two Simple[st] Learning Tasks. .- Dynamic Filter and Retrieval with One Access to Modifiable Memory. .- Longest path transversals in claw-free and $P 5$-free graphs. .- Realizing Graphs with Cut Constraints. .- On The Computational Complexity of Games with Uncertainty.