FCT 2021 Accepted Papers (in submission order)
Jin-Yi Cai, Austen Fan and Yin Liu. Bipartite 3-Regular Counting Problems with Mixed Signs
Bharat Adsul, Saptarshi Sarkar and A V Sreejith. First-Order logic and its Infinitary Quantifier Extensions over Countable Words Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis and Giulia Punzi. Beyond the BEST Theorem: Fast Assessment of Eulerian Trails Christophe Crespelle. Linear-Time Minimal Cograph Editing
Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl and Michaela Seifrtová. Computational Complexity of Covering Disconnected Multigraphs Peter Leupold and Sebastian Maneth. Deciding Top-Down Determinism of Regular Tree Languages Jesper Jansson and Wing Lik Lee. Fast Algorithms for the Rooted Triplet Distance Between Caterpillars Marc Neveling, Jörg Rothe and Robin Weishaupt. The Possible Winner Problem with Uncertain Weights Revisited
Sanjana Dey, Anil Maheshwari and Subhas Nandy. Minimum Consistent Subset of Trees Allen Ibiapina and Ana Silva. Mengerian Temporal Graphs Revisited
Nicolas Maack, Hendrik Molter, Rolf Niedermeier and Malte Renken. On Finding Separators in Temporal Split and Permutation Graphs Max Bender, Kirk Pruhs and Jacob Gilbert. A Poly-Log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider Stefan Hoffmann. Computational Complexity of Synchronization under Sparse Regular Constraints
Nicolas Bousquet and Alice Joffard. TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul and Jan Arne Telle. On Dasgupta’s hierarchical clustering objectiveand its relation to other graph parameter
Miroslav Chodil and Antonin Kucera. The Satisfiability Problem for a Quantitave Fragment of PCTL S Raja and G. V. Sumukha Bharadwaj. On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits