Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond (abstract)

Finding Induced Subgraphs from Graphs with Small Mim-Width (abstract)

Stability in Graphs with Matroid Constraints (abstract)

The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs (abstract)

Machine-learning augmented enumeration for integer optimization, and beyond

Approximation Algorithms for the Airport and Railway Problem (abstract)

A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree (abstract)

Range Reporting for Time Series via Rectangle Stabbing (abstract)

Optimal in-Place Compaction of Sliding Cubes (abstract)

Dynamic L-Budget Clustering of Curves (abstract)

Delaunay Triangulations in the Hilbert Metric (abstract)

Deterministic Cache-Oblivious Funnelselect (abstract)

Daisy Bloom Filters (abstract)

Correlation Clustering with Vertex Splitting (abstract)

Optimizing Symbol Visibility Through Displacement (abstract)

Optimizing Visibility-Based Search in Polygonal Domains (abstract)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints (abstract)

No-Dimensional Tverberg Partitions Revisited (abstract)

Turán-type problems in Theoretical Computer Science (abstract)

Approximating Minimum Sum Coloring with Bundles (abstract)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads (abstract)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman (abstract)

Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion (abstract)

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs (abstract)

Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model (abstract)

Toward Grünbaum's Conjecture (abstract)

On the Independence Number of 1-Planar Graphs (abstract)

Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes (abstract)

Destroying Densest Subgraphs Is Hard (abstract)

Size-Constrained Weighted Ancestors with Applications (abstract)

Path-Reporting Distance Oracles with Linear Size (abstract)

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage (abstract)

Local Spanners Revisited (abstract)

Well-structured graphs through the lens of logic

Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion (abstract)

Parameterized Complexity of Submodular Minimization Under Uncertainty (abstract)

On the Online Weighted Non-Crossing Matching Problem (abstract)

Online Bin Covering with Frequency Predictions (abstract)

Eliminating Crossings in Ordered Graphs (abstract)

Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects (abstract)

Recognition and Proper Coloring of Unit Segment Intersection Graphs (abstract)

Sparsity-Parameterised Dynamic Edge Colouring (abstract)

Arboricity-Dependent Algorithms for Edge Coloring (abstract)