Cover-Free Families and Generalizations Based on Hypergraphs (abstract)

On the Structure of Hamiltonian Graphs with Small Independence Number (abstract)

Parameterized Upper Bounds for Path-Consistent Hub Labeling (abstract)

Perfect Roman Domination: Aspects of Enumeration and Parameterization (abstract)

Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional (abstract)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension (abstract)

Matchings in hypercubes extend to long cycles (abstract)

The Hamiltonian cycle problem and monotone classes (abstract)

The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots (abstract)

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation (abstract)

Linear Search for an Escaping Target with Unknown Speed (abstract)

Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar (abstract)

Star-Forest Decompositions of Complete Graphs (abstract)

Bamboo Garden Trimming Problem (abstract)

Resolving Sets in Temporal Graphs (abstract)

Broadcasting in Star of Cliques (abstract)

Approximate realizations for outerplanaric degree sequences (abstract)

Detecting $K_{2,3}$ as an induced minor (abstract)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints (abstract)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls (abstract)

Directed Path Partition Problems on Directed Acyclic Graphs (abstract)

Improving Online Bin Covering with Little Advice (abstract)

Dominance for Enclosure Problems (abstract)

The Bottom-Left Algorithm for the Strip Packing Problem (abstract)

Efficient Computation of Crossing Components and Shortcut Hulls (abstract)

Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems (abstract)

An Improved Bound for Equitable Proper Labellings (abstract)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space (abstract)

Approximate cycle double cover (abstract)

Maximizing Minimum Cycle Bases Intersection (abstract)

ED-strings Similarities for PanGenomes Comparison (abstract)

On computing sets of integers with maximum number of pairs summing to powers of 2 (abstract)

Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers (abstract)

Simple random sampling of binary forests with fixed number of nodes and trees (abstract)

Approximation Algorithms for Node-Weighted Directed Steiner Problems (abstract)

Complexity Framework for Forbidden Subgraphs~IV: The Steiner Forest Problem (abstract)

Approximating Spanning Tree Congestion on Bounded Degree Graphs (abstract)

Minimizing distances between vertices and edges through tree $t$-spanners (abstract)

Computing maximal palindromes in non-standard matching models (abstract)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space (abstract)

Computing Longest Common Subsequence under Cartesian-Tree Matching Model (abstract)

Lower Bounds for Leaf Rank of Leaf Powers (abstract)