MFCS 2022: 47TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

This page contains an index consisting of author-provided keywords.

$
$k$-path	Approximation algorithms for covering vertices by long paths
(
(un)boundedness	Countdown mu-calculus
*
*-autonomous categories	Higher-order causal theories are models of BV-logic
3
3-swap neighborhood	Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard
3OV	New Lower Bounds and Upper Bounds for Listing Avoidable Vertices
A
abelian group	The Hamilton compression of highly symmetric graphs
adapting to changing preferences	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
adaptive hom algorithms	On Algorithms Based on Finitely Many Homomorphism Counts
agent	Tree exploration in dual-memory model
Algebraic branching programs	Rabbits approximate, cows compute exactly!
algebraic circuits	Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
Algebraic complexity classes	Rabbits approximate, cows compute exactly!
Algebraic complexity theory	Rabbits approximate, cows compute exactly!
Algebraic formulas	Rabbits approximate, cows compute exactly!
algorithm	New Lower Bounds and Upper Bounds for Listing Avoidable Vertices
algorithms	SAT-based Circuit Local Improvement
algorithms for finite groups	Membership problems in finite groups
ambiguity-limited NP	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
amortized analysis	Approximation algorithms for covering vertices by long paths
Analysis of Boolean Functions	Algebraic Representations of Unique Bipartite Perfect Matching
approximate graph isomorphism	Graph Similarity Based on Matrix Norms
Approximate Realization	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph
approximation algorithm	Constant-factor approximation algorithm for binary search in trees with monotonic query times Improved Approximation Algorithms for the Traveling Tournament Problem Approximation algorithms for covering vertices by long paths
Automata	Countdown mu-calculus On extended boundary sequences of morphic and Sturmian words Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order
automata theory	Regular Monoidal Languages
automated synthesis	On Synthesizing Computable Skolem Functions for First Order Logic
avoidable vertex	New Lower Bounds and Upper Bounds for Listing Avoidable Vertices
B
Balls	Sample compression schemes for balls in graphs
Band matrices	Rabbits approximate, cows compute exactly!
Biclique partition number	On the Binary and Boolean Rank of Regular Matrices
Bigraphic Sequences	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph
Binary rank	On the Binary and Boolean Rank of Regular Matrices
binary search	Constant-factor approximation algorithm for binary search in trees with monotonic query times
Bipartite Graphs	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph
Bipartite Perfect Matching	Algebraic Representations of Unique Bipartite Perfect Matching
Bitonic st-Ordering	On Upward-Planar L-Drawings of Graphs
Blocker problems	Reducing the Vertex Cover Number via Edge Contractions
Boolean circuit	Enumeration Classes Defined by Circuits
Boolean rank	On the Binary and Boolean Rank of Regular Matrices
Boolean satisfiability problem	Higher-Order Quantified Boolean Satisfiability
Boundary sequences	On extended boundary sequences of morphic and Sturmian words
branching algorithm	An exact algorithm for Knot-free Vertex Deletion
bundled fragment	Generalized Bundled Fragments of First-order Modal Logic
C
cartesian restriction categories	Regular Monoidal Languages
Category Theory	Non-Determinism in Lindenmayer Systems and Global Transformations
causality	Higher-order causal theories are models of BV-logic
Cayley graph	The Hamilton compression of highly symmetric graphs
Chromatic number	On the Binary and Boolean Rank of Regular Matrices
circle graphs	Extending Partial Representations of Circle Graphs in Near-Linear Time
circuits	SAT-based Circuit Local Improvement CNF Encodings of Parity
Claw-free graphs	Conflict-free Coloring on Claw-free graphs and Interval graphs
Clifford group	Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
CLTL	Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order
Cluster vertex deletion	Complexity of the Cluster Vertex Deletion problem on H-free graphs
CNF	CNF Encodings of Parity
Coalition Formation	Boundaries to Single-Agent Stability in Additively Separable Hedonic Games
Coherent control	Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
cohomology	Cohomology in Constraint Satisfaction and Structure Isomorphism
Combinatorial reconfiguration	Independent set reconfiguration on directed graphs
communication complexity	Automating OBDD proofs is NP-hard
Comonads	Comonadic semantics for hybrid logic
Compact semialgebraic sets	Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set
complete sets	Oracle with P = NP ∩ coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP
Completeness	LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
complexity	Generalized Bundled Fragments of First-order Modal Logic
Complexity dichotomy	Bounded Degree Nonnegative Counting CSP Complexity of the Cluster Vertex Deletion problem on H-free graphs
complexity measure	On the Number of Quantifiers as a Complexity Measure
complexity theory	SAT-based Circuit Local Improvement
Composition Method	On Uniformization in the Full Binary Tree
computable functions	On Synthesizing Computable Skolem Functions for First Order Logic
computational complexity	Complexity of the Cluster Vertex Deletion problem on H-free graphs Oracle with P = NP ∩ coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP Enumeration Classes Defined by Circuits
computational complexity theory	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
Computational Counting Complexity	Bounded Degree Nonnegative Counting CSP
computational social choice	Fixed-point cycles and approximate EFX allocations
Conflict-Free Coloring	Conflict-free Coloring on Claw-free graphs and Interval graphs
constraint satisfaction problems	Bounded Degree Nonnegative Counting CSP Cohomology in Constraint Satisfaction and Structure Isomorphism
Constraints	Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order
Continuant	Rabbits approximate, cows compute exactly!
continuity	Continuous rational functions are deterministic regular
counting classes	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
Counting complexity	Weighted counting of matchings in unbounded-treewidth graph families
Counting CSP	Bounded Degree Nonnegative Counting CSP
Craig Interpolation Property	Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
D
d-Hitting Set	On Kernels for d-Path Vertex Cover
d-Path Vertex Cover	On Kernels for d-Path Vertex Cover
Data Languages	Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order
decidability	Generalized Bundled Fragments of First-order Modal Logic
Degree Sequences	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph
descriptive complexity	Cohomology in Constraint Satisfaction and Structure Isomorphism
Determinant versus permanent	Rabbits approximate, cows compute exactly!
deterministic algorithms	Tree exploration in dual-memory model
Determinization	A robust class of languages of 2-nested words Continuous rational functions are deterministic regular
Directed graph	Independent set reconfiguration on directed graphs
Directed Graphs	On Upward-Planar L-Drawings of Graphs
Discrete linear dynamical systems	Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set
distance realization	Graph Realization of Distance Sets
Dynamic algorithms	On Dynamic α + 1 Arboricity Decomposition and Out-Orientation
dynamic data structure	Computing the Minimum Bottleneck Moving Spanning Tree
E
Edge contraction	Reducing the Vertex Cover Number via Edge Contractions
EFX	Fixed-point cycles and approximate EFX allocations
elementary diagram	On Synthesizing Computable Skolem Functions for First Order Logic
encoding	CNF Encodings of Parity
enumeration problem	Enumeration Classes Defined by Circuits
Equilibria	Not all Strangers are the Same: The Impact of Tolerance in Schelling Games
Exact algorithm	An exact algorithm for Knot-free Vertex Deletion
Exact Matching	Exact Matching in Graphs of Bounded Independence Number
Expansion Lemma	On Kernels for d-Path Vertex Cover
Exponential Local-Global Principle	Skolem Meets Schanuel
expressive power	Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
F
facility location	Dispersing Obnoxious Facilities on Graphs by Rounding Distances
fair allocation	Fixed-point cycles and approximate EFX allocations
Feedback Vertex Set	Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
Fibonacci sequence	Weighted counting of matchings in unbounded-treewidth graph families
fine-grained complexity	New Lower Bounds and Upper Bounds for Listing Avoidable Vertices
finite model property	Generalized Bundled Fragments of First-order Modal Logic
Finite model theory	Cohomology in Constraint Satisfaction and Structure Isomorphism Comonadic semantics for hybrid logic
first order logic	On Synthesizing Computable Skolem Functions for First Order Logic
first-order modal logic	Generalized Bundled Fragments of First-order Modal Logic
fixed-point	Fixed-point cycles and approximate EFX allocations
fixpoints	Countdown mu-calculus
fluted fragment	Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
foremost temporal path	The complexity of computing optimum labelings for temporal connectivity
formal language theory	Regular Monoidal Languages
G
Game Theory	Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs
games	Countdown mu-calculus
Global Transformations	Non-Determinism in Lindenmayer Systems and Global Transformations
Graph algorithm	Independent set reconfiguration on directed graphs
Graph arboricity	On Dynamic α + 1 Arboricity Decomposition and Out-Orientation
Graph Coloring	Conflict-free Coloring on Claw-free graphs and Interval graphs
Graph Drawing	RAC Drawings of Graphs with Low Degree On Upward-Planar L-Drawings of Graphs
graph exploration	Tree exploration in dual-memory model
Graph Homomorphisms	Bounded Degree Nonnegative Counting CSP
graph labeling	The complexity of computing optimum labelings for temporal connectivity
graph matching	Graph Similarity Based on Matrix Norms
Graph of addition	On extended boundary sequences of morphic and Sturmian words
Graph problems	Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard
Graph Realization	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph Graph Realization of Distance Sets
graph search	Constant-factor approximation algorithm for binary search in trees with monotonic query times
graph similarity	Graph Similarity Based on Matrix Norms
Graphic Sequences	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph
Graphical Language	LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
Graphs	Sample compression schemes for balls in graphs
Gray code	The Hamilton compression of highly symmetric graphs
group theory	Streaming word problems
guarded fragment	Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
H
Hamilton cycle	The Hamilton compression of highly symmetric graphs
Hedonic Games	Boundaries to Single-Agent Stability in Additively Separable Hedonic Games
heuristics	SAT-based Circuit Local Improvement
Higher-order Boolean functions	Higher-Order Quantified Boolean Satisfiability
hom algorithms	On Algorithms Based on Finitely Many Homomorphism Counts
homomorphism numbers	On Algorithms Based on Finitely Many Homomorphism Counts
Hybrid logic	Comonadic semantics for hybrid logic
hypercube	The Hamilton compression of highly symmetric graphs
I
identity problem	On the Identity Problem for Unitriangular Matrices of Dimension Four
incremental algorithms	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
Independence number	Exact Matching in Graphs of Bounded Independence Number
Independent set	Independent set reconfiguration on directed graphs
Indexed languages	A robust class of languages of 2-nested words
infinite words	Continuous rational functions are deterministic regular
intersection non-emptiness problems	Membership problems in finite groups
Interval graphs	Conflict-free Coloring on Claw-free graphs and Interval graphs
J
Johnson graph	The Hamilton compression of highly symmetric graphs
K
k-bend Drawings	RAC Drawings of Graphs with Low Degree
Kernelization	On Kernels for d-Path Vertex Cover
knapsack	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
knapsack problems in groups	Membership problems in finite groups
Knot-free graphs	An exact algorithm for Knot-free Vertex Deletion
L
Language theory	A Complexity Approach to Tree Algebras: the Polynomial Case
learning automata	Learning Deterministic Visibly Pushdown Automata under Accessible Stack
lifting	Automating OBDD proofs is NP-hard
Lindenmayer Systems	Non-Determinism in Lindenmayer Systems and Global Transformations
linear dynamical systems	The Pseudo-Reachability Problem for Affine Dynamical Systems
linear logic	Higher-order causal theories are models of BV-logic
Linear Optical Circuits	LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits
Linear Recurrence Sequences	A Universal Skolem Set of Positive Lower Density On the Skolem Problem for Reversible Sequences
local improvement	Approximation algorithms for covering vertices by long paths
Local search	Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard
logic	Countdown mu-calculus
lower bound	Tree exploration in dual-memory model
lower bounds	Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits On Dynamic α + 1 Arboricity Decomposition and Out-Orientation CNF Encodings of Parity
M
master lists	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
Matchings	Weighted counting of matchings in unbounded-treewidth graph families
matrix multiplication	New Lower Bounds and Upper Bounds for Listing Avoidable Vertices
matrix semigroups	On the Identity Problem for Unitriangular Matrices of Dimension Four
memory	Tree exploration in dual-memory model
Metric Dimension	Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
minimal elimination ordering	New Lower Bounds and Upper Bounds for Listing Avoidable Vertices
minimisation	Learning Deterministic Visibly Pushdown Automata under Accessible Stack
minimum spanning tree	Computing the Minimum Bottleneck Moving Spanning Tree
Mobius Function	Algebraic Representations of Unique Bipartite Perfect Matching
modal logic	Countdown mu-calculus
model checking	The Pseudo-Reachability Problem for Affine Dynamical Systems Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
Model comparison game	Comonadic semantics for hybrid logic
model theory	Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
Monadic Second-Order Logic	On Uniformization in the Full Binary Tree
monoidal categories	Regular Monoidal Languages
moving points	Computing the Minimum Bottleneck Moving Spanning Tree
mu-calculus	Countdown mu-calculus
multi-structural games	On the Number of Quantifiers as a Complexity Measure
Multigraph Realization	On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph
N
Narayana's cow sequence	Rabbits approximate, cows compute exactly!
Nested words	A robust class of languages of 2-nested words
network design	Graph Realization of Distance Sets
Nominal automata	A Complexity Approach to Tree Algebras: the Polynomial Case
Non-deterministic communication complexity	On the Binary and Boolean Rank of Regular Matrices
Non-deterministic Dynamical Systems	Non-Determinism in Lindenmayer Systems and Global Transformations
non-elementary complexity	Higher-Order Quantified Boolean Satisfiability
Non-separating path	Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets
Nonnegative Counting CSP	Bounded Degree Nonnegative Counting CSP
NP-hardness	The Complexity of Periodic Energy Minimisation Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
number of quantifiers	On the Number of Quantifiers as a Complexity Measure
number-in-hand communication	Automating OBDD proofs is NP-hard
Numeration systems	On extended boundary sequences of morphic and Sturmian words
O
Optical Quantum Computing	LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits
Optimisation of periodic structures	The Complexity of Periodic Energy Minimisation
oracle construction	Oracle with P = NP ∩ coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP
ordered fragments	Towards a Model Theory of Ordered Logics: Expressivity and Interpolation
P
p-adic Schanuel Conjecture	Skolem Meets Schanuel
P-printable sets	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
packing	Dispersing Obnoxious Facilities on Graphs by Rounding Distances
Padovan sequence	Rabbits approximate, cows compute exactly!
Parameterized complexity	On Kernels for d-Path Vertex Cover Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters Dispersing Obnoxious Facilities on Graphs by Rounding Distances Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets Exact Matching in Graphs of Bounded Independence Number Reducing the Vertex Cover Number via Edge Contractions
parity	CNF Encodings of Parity
parity games	Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
partial representation extension	Extending Partial Representations of Circle Graphs in Near-Linear Time
Partially Ordered Sets	Algebraic Representations of Unique Bipartite Perfect Matching
Path cover	Approximation algorithms for covering vertices by long paths
Pentadiagonal matrices	Rabbits approximate, cows compute exactly!
Perfect Matching	Exact Matching in Graphs of Bounded Independence Number
permutahedron	The Hamilton compression of highly symmetric graphs
Planar graphs	On Dynamic α + 1 Arboricity Decomposition and Out-Orientation
Planar L-Drawings	On Upward-Planar L-Drawings of Graphs
PLS-completeness	Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard
polynomial calculus	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
polynomials	Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
postselection	Space-Bounded Unitary Quantum Computation with Postselection
Prefix	Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order
Presburger arithmetic	Higher-Order Quantified Boolean Satisfiability
Price of anarchy	Not all Strangers are the Same: The Impact of Tolerance in Schelling Games
Price of stability	Not all Strangers are the Same: The Impact of Tolerance in Schelling Games
probabilistic coherence spaces	Higher-order causal theories are models of BV-logic
Program termination	Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set
progress measure	Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
promise classes	Oracle with P = NP ∩ coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP
proof barrier	Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
proof complexity	Oracle with P = NP ∩ coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP Automating OBDD proofs is NP-hard
Proper Sample Compression Schemes	Sample compression schemes for balls in graphs
Q
quantum channels	Higher-order causal theories are models of BV-logic
quantum complexity theory	Space-Bounded Unitary Quantum Computation with Postselection
Quantum Computing	LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits Complete ZX-calculi for the stabiliser fragment in odd prime dimensions Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
Qudit quantum computing	Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
Qudit Stabilizer	Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
query complexity	Constant-factor approximation algorithm for binary search in trees with monotonic query times
R
RAC Graphs	RAC Drawings of Graphs with Low Degree
Ramsey-theory	Fixed-point cycles and approximate EFX allocations
range distance realization	Graph Realization of Distance Sets
rank logic	Cohomology in Constraint Satisfaction and Structure Isomorphism
rational functions	Continuous rational functions are deterministic regular
reachability	On the Number of Quantifiers as a Complexity Measure
Reachability Problem	Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs
reachability problems	The Pseudo-Reachability Problem for Affine Dynamical Systems
recognition algorithm	Extending Partial Representations of Circle Graphs in Near-Linear Time
Regular matrices	On the Binary and Boolean Rank of Regular Matrices
Resource Optimisation	Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
rooted trees	On the Number of Quantifiers as a Complexity Measure
roots of unity	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Rotor Walk	Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs
Rotor-routing	Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs
S
s-t connectivity	On the Number of Quantifiers as a Complexity Measure
S-Unit Equations	A Universal Skolem Set of Positive Lower Density
SAT	SAT-based Circuit Local Improvement
SAT-solvers	SAT-based Circuit Local Improvement
Schelling games	Not all Strangers are the Same: The Impact of Tolerance in Schelling Games
Series-Parallel Graphs	On Upward-Planar L-Drawings of Graphs
sheaf theory	Cohomology in Constraint Satisfaction and Structure Isomorphism
Sieve Methods	A Universal Skolem Set of Positive Lower Density
Skolem Conjecture	Skolem Meets Schanuel
Skolem function	On Synthesizing Computable Skolem Functions for First Order Logic
Skolem Problem	A Universal Skolem Set of Positive Lower Density Skolem Meets Schanuel
space-bounded computation	Space-Bounded Unitary Quantum Computation with Postselection
split decomposition tree	Extending Partial Representations of Circle Graphs in Near-Linear Time
Sports scheduling	Improved Approximation Algorithms for the Traveling Tournament Problem
Stability	Boundaries to Single-Agent Stability in Additively Separable Hedonic Games
Stable Marriage	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
Stable Roommates	Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
Steiner Tree problem	The complexity of computing optimum labelings for temporal connectivity
Straight-line Drawings	RAC Drawings of Graphs with Low Degree
strategy iteration	Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
streaming algorithms	Streaming word problems
streaming string transducers	Continuous rational functions are deterministic regular
string diagrams	Regular Monoidal Languages
Strings	Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order
structural complexity theory	Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
structure isomorphism	Cohomology in Constraint Satisfaction and Structure Isomorphism
Sturmian words	On extended boundary sequences of morphic and Sturmian words
Subset problems	Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets
Suffix	Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order
sum-of-squares	On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
T
tableaux	Generalized Bundled Fragments of First-order Modal Logic
temporal connectivity	The complexity of computing optimum labelings for temporal connectivity
Temporal graph	The complexity of computing optimum labelings for temporal connectivity
Tetradiagonal matrices	Rabbits approximate, cows compute exactly!
The Skolem Problem	On the Skolem Problem for Reversible Sequences
tiling problems	The Complexity of Periodic Energy Minimisation
Token sliding	Independent set reconfiguration on directed graphs
Traveling Tournament Problem	Improved Approximation Algorithms for the Traveling Tournament Problem
tree	Tree exploration in dual-memory model
Tree algebra	A Complexity Approach to Tree Algebras: the Polynomial Case
Tree-like Multigraph	Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs
trees	On the Number of Quantifiers as a Complexity Measure
Treewidth	Weighted counting of matchings in unbounded-treewidth graph families
Tridiagonal matrices	Rabbits approximate, cows compute exactly!
two-way transducers	Continuous rational functions are deterministic regular
U
undecidability	The Complexity of Periodic Energy Minimisation
Uniform termination bounds	Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set
Uniformization	On Uniformization in the Full Binary Tree
Unique Matching	Algebraic Representations of Unique Bipartite Perfect Matching
unit-disk range emptiness query	Computing the Minimum Bottleneck Moving Spanning Tree
unitriangular matrices	On the Identity Problem for Unitriangular Matrices of Dimension Four
universal trees	Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
Upward-Planarity	On Upward-Planar L-Drawings of Graphs
V
value iteration	Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
van Benthem-Rosen theorem	Comonadic semantics for hybrid logic
VC-dimension	Sample compression schemes for balls in graphs
Verification	On the Skolem Problem for Reversible Sequences
Vertex cover	Complexity of the Cluster Vertex Deletion problem on H-free graphs Reducing the Vertex Cover Number via Edge Contractions
vertex-transitive	The Hamilton compression of highly symmetric graphs
visibly pushdown automata	Learning Deterministic Visibly Pushdown Automata under Accessible Stack
W
weak k-EXP hierarchies	Higher-Order Quantified Boolean Satisfiability
Weisfeiler-Leman algorithm	Cohomology in Constraint Satisfaction and Structure Isomorphism
word problems	Streaming word problems
Z
zero-sum cycle	Fixed-point cycles and approximate EFX allocations
ZX-calculus	Complete ZX-calculi for the stabiliser fragment in odd prime dimensions

Disclaimer | Powered by EasyChair Smart Program