Table of Contents: “...Combinatorics and Algorithms -- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher -- Extended formulations via decision diagrams -- Greedy Gray codes for Dyck words and ballot sequences -- Efficiently-Verifiable Strong...”

Full text 

Table of Contents: “... -- Graph Algorithms -- Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs -- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width -- Shortest Longest-Path Graph Orientations -- Sink Location Problems...”

Full text 

Table of Contents: “...Algorithms and Data Structures -- Approximation and Online Algorithms -- Complexity Theory....”

Full text 

Table of Contents: “...Combinatorics and Graph Theory -- Parameterized Algorithms -- Automata Theory and Formal Languages -- and Game Theory and Fairness. ....”

Full text 

Table of Contents: “... -- Compatibility of convergence algorithms for autonomous mobile robots -- FnF-BFT: A BFT protocol with provable performance under attack -- Divide & Scale: Formalization and Roadmap to Robust Sharding -- Zero-Memory Graph Exploration with Unknown Inports -- The Energy...”

Full text 

Table of Contents: “...-Node-, H-Node- and H-Edge-Deletion Problems -- Parameterized algorithms for Eccentricity Shortest Path Problem -- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs -- Deterministic Performance Guarantees...”

Full text 

Table of Contents: “... -- Discrete and combinatorial optimization -- Constant-factor approximation algorithms for some maximin multiclustering problems -- Aggregation tree construction using hierarchical structures -- Enumeration and unimodular equivalence of empty delta-modular...”

Full text 

Subject (ZB): “...Algorithms....”

Full text 

Full text 

Table of Contents: “...Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions -- An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization -- Generalized Sorting with Predictions...”

Full text 

Full text 

Table of Contents: “... -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling...”

Full text 

Table of Contents: “...Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP...”

Full text 

Table of Contents: “...Topological Aspects -- Parameterized Complexity for Drawings -- Planar graphs -- Frameworks -- Algorithmics....”

Full text 

Table of Contents: “...Invited Papers -- Towards Subderivative-based Zeroing Neural Networks -- Mathematical Programming -- An Algorithm for Decentralized Multi-agent Feasibility Problems -- Online Optimization Problems with Functional Constraints under Relative Lipschitz...”

Full text 

Table of Contents: “...A stochastic algorithm for non-monotone DR-submodular maximziation over a convex set -- Flow shop scheduling problems with transportation constraints revisited -- LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data...”

Full text 

Subject (ZB): “...Algorithms....”

Full text 

Table of Contents: “... for graphs -- Comparability graphs among Cover-Incomparability graphs -- Complexity of Paired Domination in AT-free and Planar Graphs -- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs -- On Conflict-Free Spanning Tree: Algorithms...”

Full text 

Full text 

Table of Contents: “...Algorithms and Data Structures -- Cutting a tree with Subgraph Complementation is hard, except for some small trees -- Elastic-Degenerate String Matching with 1 Error -- Median and Hybrid Median K-Dimensional Trees -- Weighted Connected Matchings...”

Full text