- Henning Fernau
, Klaus Jansen
:
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings. Lecture Notes in Computer Science 14292, Springer 2023, ISBN 978-3-031-43586-7 [contents] - 2021
- Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith:
First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. FCT 2021: 39-52 - Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski
, Alexander Löser, Marcus Wilhelm:
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. FCT 2021: 53-66 - Max Bender, Jacob Gilbert, Kirk Pruhs
:
A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider. FCT 2021: 67-84 - Jan Bok
, Jirí Fiala, Nikola Jedlicková
, Jan Kratochvíl
, Michaela Seifrtová
:
Computational Complexity of Covering Disconnected Multigraphs. FCT 2021: 85-99 - Piotr Borowiecki
, Dariusz Dereniowski, Dorota Osula:
The Complexity of Bicriteria Tree-Depth. FCT 2021: 100-113 - Nicolas Bousquet, Alice Joffard:
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. FCT 2021: 114-134 - Jin-Yi Cai, Austen Z. Fan
, Yin Liu:
Bipartite 3-Regular Counting Problems with Mixed Signs. FCT 2021: 135-148 - Miroslav Chodil
, Antonín Kucera
:
The Satisfiability Problem for a Quantitative Fragment of PCTL. FCT 2021: 149-161 - Alessio Conte
, Roberto Grossi
, Grigorios Loukides
, Nadia Pisanti
, Solon P. Pissis
, Giulia Punzi
:
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. FCT 2021: 162-175 - Christophe Crespelle:
Linear-Time Minimal Cograph Editing. FCT 2021: 176-189 - Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi:
Regular Model Checking with Regular Relations. FCT 2021: 190-203 - Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset Problem for Trees. FCT 2021: 204-216 - David Eppstein, Siddharth Gupta, Elham Havvaei:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. FCT 2021: 217-229 - Henning Fernau
, Kshitij Gajjar
:
The Space Complexity of Sum Labelling. FCT 2021: 230-244 - Hugo Gimbert, Claire Mathieu, Simon Mauras:
Two-Sided Matching Markets with Strongly Correlated Preferences. FCT 2021: 3-17 - Hermann Gruber
, Markus Holzer
, Simon Wolfsteiner:
On Minimizing Regular Expressions Without Kleene Star. FCT 2021: 245-258 - Kristoffer Arnsfelt Hansen
, Troels Bjerre Lund:
Computational Complexity of Computing a Quasi-Proper Equilibrium. FCT 2021: 259-271 - Stefan Hoffmann
:
Computational Complexity of Synchronization Under Sparse Regular Constraints. FCT 2021: 272-286 - Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle:
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT 2021: 287-300 - Allen Ibiapina
, Ana Silva
:
Mengerian Temporal Graphs Revisited. FCT 2021: 301-313 - Ashwin Jacob
, Diptapriyo Majumdar, Venkatesh Raman:
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. FCT 2021: 314-326 - Jesper Jansson, Wing Lik Lee:
Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. FCT 2021: 327-340 - Peter Leupold, Sebastian Maneth:
Deciding Top-Down Determinism of Regular Tree Languages. FCT 2021: 341-353 - Joseph Livesey, Dominik Wojtczak
:
Propositional Gossip Protocols. FCT 2021: 354-370 - Markus Lohrey:
Complexity of Word Problems for HNN-Extensions. FCT 2021: 371-384 - Nicolas Maack, Hendrik Molter
, Rolf Niedermeier
, Malte Renken
:
On Finding Separators in Temporal Split and Permutation Graphs. FCT 2021: 385-398 - Marc Neveling, Jörg Rothe
, Robin Weishaupt:
The Possible Winner Problem with Uncertain Weights Revisited. FCT 2021: 399-412 - Jelle J. Oostveen, Erik Jan van Leeuwen:
Streaming Deletion Problems Parameterized by Vertex Cover. FCT 2021: 413-426 - S. Raja, G. V. Sumukha Bharadwaj:
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. FCT 2021: 427-439