Conference Program

The $b$-branching Problem in Digraphs

Quantum vs. Classical Proofs and Subset Verification

Interval-Like Graphs and Digraphs

Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups

Double Threshold Digraphs

On efficiently solvable cases of Quantum k-SAT

Recovering sparse graphs

Quantum generalizations of the polynomial hierarchy with applications to QMA(2)

Faster Exploration of Degree-Bounded Temporal Graphs

On the Complexity of Team Logic and its Two-Variable Fragment

The Complexity of Finding Small Separators in Temporal Graphs

A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

Team Semantics for the Specification and Verification of Hyperproperties

A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms

Linking Focusing and Resolution with Selection

On Pseudodeterministic Approximation Algorithms

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction

Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations

One-sided error communication complexity of Gap Hamming Distance

Maximum Rooted Connected Expansion

Simultaneous Multiparty Communication Protocols for Composed Functions

Directed Graph Minors and Serial-Parallel Width

On Hadamard Series and Rotating Q-Automata

Reconfiguration of graph minors

Polynomial-time equivalence testing for deterministic fresh-register automata

New Results on Directed Edge Dominating Set

Sliding windows over context-free languages

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems

Consistency for counting quantifiers

Lagrange’s Theorem for Binary Squares

Counting Homomorphisms to Trees Modulo a Prime

Fast entropy-bounded string dictionary look-up with mismatches

Why are CSPs Based on Partition Schemes Computationally Hard?

Consensus Strings with Small Maximum Distance and Small Distance Sum

A Subquadratic Algorithm for 3XOR

The Complexity of Transducer Synthesis from Multi-Sequential Specifications

Generalized budgeted submodular set function maximization

The complexity of disjunctive linear Diophantine constraints

Pricing Problems with Buyer Preselection

Plain stopping time and conditional complexities revisited

Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials

On W[1]-Hardness as Evidence for Intractability

Online Maximum Matching with Recourse

Timed Network Games with Clocks

Car-Sharing between Two Locations: Online Scheduling with Two Servers

Spanning-Tree Games

Maximum Area Axis-Aligned Square Packings

Concurrent games and semi-random determinacy

Hardness Results for Consensus-Halving

Optimal Strategies in Pushdown Reachability Games

Pairing heaps: the forward variant

Probabilistic Secret Sharing

Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays

Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph

Balanced connected partitioning of unweighted grid graphs

Balance Problems for Integer Circuits

Treewidth-Two Graphs as a Free Algebra

Expressive power, satisfiability and equivalence of circuits over nilpotent algebras

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs

Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds

Listing Subgraphs by Cartesian Decomposition

Depth Two Majority Circuits for Majority and List Expanders

Graph Similarity and Approximate Isomorphism

Complexity of Preimage Problems for Deterministic Finite Automata

From expanders to hitting distributions and simulation theorems

On randomized generation of slowly synchronizing automata

Enumerating Minimal Transversals of Hypergraphs Without Small Holes

Finding Short Synchronizing Words for Prefix Codes

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Testing Simon’s congruence

Collective fast delivery by energy-efficient agents

Projection Theorems Using Effective Dimension

Shape Recognition by a Finite Automaton Robot

Tree Tribes and lower bounds for Switching Lemmas

Tight bounds for deterministic $h$-shot broadcast in ad-hoc directed radio networks

Results on the Dimension Spectra of Planar Lines

Average-case polynomial-time computability of Hamiltonian dynamics

Give Me Some Slack: Efficient Sliding Window Measurements

Average case analysis of leaf-centric binary tree sources

A Two-Sided Error Distributed Property Tester For Conductance

Largest Weight Common Subtree Embeddings with Distance Penalties

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors