The challenge of stability, accuracy and robustness in data-driven AI

Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets (abstract)

Knowledge Neurons in the Knowledge Graph-based Link Prediction Models (abstract)

Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking (abstract)

The Computational Complexity of Equilibria with Strategic Constraints (abstract)

Quantum Algorithm for the Multiple String Matching Problem (abstract)

Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere (abstract)

Expected Density of Random Minimizers (abstract)

Forest Covers and Bounded Forest Covers (abstract)

On the periodic decompositions of multidimensional configurations (abstract)

Maximal $\alpha$-gapped Repeats in a Fibonacci String (abstract)

Incremental computation of the set of period sets (abstract)

Outer-(ap)RAC Graphs (abstract)

Temporal Graph Realization Problems

Holey graphs: very large Betti numbers are testable (abstract)

Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints (abstract)

Exact characterizations of non-commutative algebraic complexity without homogeneity (abstract)

A SUBSET-SUM Characterisation of the A-Hierarchy (abstract)

Reachability in temporal graphs under perturbation (abstract)

The Complexity of Graph Exploration Games (abstract)

Multi-Agent Search-Type Problems on Polygons (abstract)

Distance Vector Domination (abstract)

Pathways to Tractability for Geometric Thickness (abstract)

Visual Complexity of Point Set Mappings (abstract)

Minimum Monotone Spanning Trees (abstract)

Representing Hypergraphs by Point-Line Incidences (abstract)

Distributed Computing by Mobile Robots: Exploring the Computational Landscape

Online $b$-Matching with Stochastic Rewards (abstract)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees (abstract)

Online Busy Time Scheduling with Untrusted Prediction (abstract)

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem (abstract)

Packed Acyclic Deterministic Finite Automata (abstract)

Fast Practical Compression of Deterministic Finite Automata (abstract)

On Pumping Problems for Unary Regular Languages (abstract)

On Computational Completeness of Semi-Conditional Matrix Grammars (abstract)

Massively Parallel Maximum Coverage Revisited (abstract)

DAG Scheduling in the BSP Model (abstract)

Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds (abstract)

Dynamic Range Minimum Queries on the Ultra-Wide Word RAM (abstract)

Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs

Generation of Cycle Permutation Graphs and Permutation Snarks (abstract)

Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs (abstract)

Sufficient conditions for polynomial-time detection of induced minors (abstract)

Shortest Longest-Path Graph Orientations for Trees (abstract)

Orienteering (with Time Windows) on Restricted Graph Classes (abstract)

On the Structural Parameterized Complexity of Defective Coloring (abstract)

Parameterized Complexity of Generalizations of Edge Dominating Set (abstract)

Disjoint covering of bipartite graphs with $s$-clubs (abstract)

Roman Hitting Set (abstract)

On the Complexity of Minimum Membership Dominating Set (abstract)

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints (abstract)

Colorful 3-Rainbow Domination (abstract)