DescriptionThis book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019.The 21 full papers included in this volume were carefully reviewed and selected from 45 submissions. In addition, the book contains 3 invited talks in full-paper length. The papers were organized in topical sections named: formal methods, complexity, and algorithms.Table of ContentsFront MatterInvited PapersFront MatterAlgebraic Theory of Promise Constraint Satisfaction Problems, First StepsSome Observations on Dynamic Random Walks and Network RenormalizationHighly Succinct Dynamic Data StructuresFormal MethodsFront MatterWinning Strategies for Streaming Rewriting GamesNominal Syntax with Atom Substitutions: Matching, Unification, RewritingTwo Characterizations of Finite-State DimensionLargest Common Prefix of a Regular Tree LanguageComplexityFront MatterOn Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph PropertiesDeterministic Preparation of Dicke StatesOptimal Channel Utilization with Limited FeedbackRETRACTED CHAPTER: Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an OracleAlgorithmsFront MatterAn Efficient Algorithm for the Fast Delivery ProblemExtension of Some Edge Graph Problems: Standard and Parameterized ComplexitySpace Efficient Algorithms for Breadth-Depth SearchCircular Pattern Matching with k Mismatches Succinct Representations of Finite GroupsOn the Tractability of Covering a Graph with 2-ClubsOn Cycle Transversals and Their Connected Variants in the Absence of a Small Linear ForestMaximum Rectilinear Convex SubsetsComputing Digraph Width Measures on Directed Co-graphsFault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared ChannelRare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern GraphsBivariate B-Splines from Convex Pseudo-circle ConfigurationsThe Fault-Tolerant Metric Dimension of CographsRetraction Note to: Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an OracleBack MatterEditors BiographyLeszek Antoni Gąsieniec University of Liverpool, Liverpool, UKJesper Jansson Hong Kong Polytechnic University, Hong Kong, ChinaChristos Levcopoulos Lund University, Lund, Sweden