In random order ......

(1) Improved Approximation for Unpopularity in (3,3)-Hypergraph Matching with one-sided preferences
Singh, Karmakar

(2) A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System
Shota, Haraguchi

(3) Guarding a 1.5D terrain with Imprecise Viewpoints
KEIKHA, L?ffler, Saumell, Valtr

(4) Parameterized Algorithms for Power Edge Set and Zero Forcing Set
Bhyravarapu, Kanesh, Kundu, Lokshtanov, Saurabh

(5) Exact Learning of Weighted Graphs Using Composite Queries
Goodrich, Liu, Panageas

(6) Monotone classes, even graphs and the Hamiltonian cycle problem
Lozin

(7) Extending simple monotone drawings
Soukup, Kyn?l

(8) Inverting Parameterized Burrows-Wheeler Transform
Kawanami, Iseri, I

(9) The Closed Geodetic Game: algorithms and strategies
Dailly, Gahlawat, Mar Myint

(10) ETH Lower Bounds for $n$-Queens: Time Waits for Nobody
Hardness Group, Brunner, Demaine, Gomez, Hecher, Zhang

(11) Guarding Terrains with Guards on a Line
Kang, Kim, Ahn

(12) Minimizing $\ell_2$ Norm of Flow Time by Starvation Mitigation
Kuo

(13) Covering vertices by $4^+$-paths: A simpler local search coupled with a more delicate amortization
Gong, Chen, Lin, Miyano, Ranjitkar

(14) Recoverable Robust Cardinality Constrained Maximization with Commitment of a Submodular Function
M\"{u}nch, Raach, de Vries

(15) Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs
Inamdar, Kanesh, Krithika, Mittal, Saurabh, Saurabh

(16) A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
Rahat, Hasan, Mondal

(17) Minimum-Complexity Graph Simplification under the Fr\'{e}chet Distance
Filtser, Mirzanezhad, Wenk

(18) Fast Pattern Matching with Epsilon Transitions
Cotumaccio

(19) Bicluster Editing with Overlaps: A Vertex Splitting Approach
Abu-Khzam, Isenmann, Merchad

(20) Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
Tate, Grochow

(21) Drawing Reeb Graphs
Chambers, Fasy, Hosseini Sereshgi, L?ffler

(22) Monotone Partitions of Simple Polygons
Lee, An, Kim, Ahn

(23) On Solving Simple Curved Nonograms
L?ffler, Rote, Terziadis, Weinberger

(24) Vector spaces of graphs closed under isomorphism
Lozin, Zakharova

(25) Average Sensitivity of Breadth-First Search Algorithms on Grids
Assari, Gu

(26) Optimal Random Bit Sampling for Set Partition-like Structures
Bodini, Durand

(27) Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
Gu, Liang

(28) Tile-based Knot Assembly with Celtic!
Knobel, Reyes, Santos, Wylie, Perez, Bajaj, Bajaj

(29) Linear Search with Probabilistic Detection and Variable Speeds
Coleman, Morales-Ponce

(30 Streaming Algorithms for Scheduling Jobs with Priorities
Fu, Huo, Zhao

(31) Permanent of bipartite graphs in terms of determinants
Chakrabartty, Singh

(32) On existence of subgroup magic rectangle
S, Venkatesan, Paramasivam