default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd FCT 2021: Athens, Greece
- Evripidis Bampis
, Aris Pagourtzis:
Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings. Lecture Notes in Computer Science 12867, Springer 2021, ISBN 978-3-030-86592-4
Invited Papers
- Hugo Gimbert, Claire Mathieu, Simon Mauras:
Two-Sided Matching Markets with Strongly Correlated Preferences. 3-17 - Nobuko Yoshida, Fangyi Zhou, Francisco Ferreira:
Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types. 18-35
Contributed Papers
- Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith:
First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. 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. 53-66 - Max Bender, Jacob Gilbert, Kirk Pruhs:
A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider. 67-84 - Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová:
Computational Complexity of Covering Disconnected Multigraphs. 85-99 - Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula:
The Complexity of Bicriteria Tree-Depth. 100-113 - Nicolas Bousquet, Alice Joffard:
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. 114-134 - Jin-Yi Cai, Austen Z. Fan, Yin Liu:
Bipartite 3-Regular Counting Problems with Mixed Signs. 135-148 - Miroslav Chodil, Antonín Kucera:
The Satisfiability Problem for a Quantitative Fragment of PCTL. 149-161 - Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi:
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. 162-175 - Christophe Crespelle:
Linear-Time Minimal Cograph Editing. 176-189 - Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi:
Regular Model Checking with Regular Relations. 190-203 - Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset Problem for Trees. 204-216 - David Eppstein, Siddharth Gupta, Elham Havvaei:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. 217-229 - Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. 230-244 - Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimizing Regular Expressions Without Kleene Star. 245-258 - Kristoffer Arnsfelt Hansen, Troels Bjerre Lund:
Computational Complexity of Computing a Quasi-Proper Equilibrium. 259-271 - Stefan Hoffmann:
Computational Complexity of Synchronization Under Sparse Regular Constraints. 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. 287-300 - Allen Ibiapina, Ana Silva:
Mengerian Temporal Graphs Revisited. 301-313 - Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman:
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. 314-326 - Jesper Jansson, Wing Lik Lee:
Fast Algorithms for the Rooted Triplet Distance Between Caterpillars. 327-340 - Peter Leupold, Sebastian Maneth:
Deciding Top-Down Determinism of Regular Tree Languages. 341-353 - Joseph Livesey, Dominik Wojtczak:
Propositional Gossip Protocols. 354-370 - Markus Lohrey:
Complexity of Word Problems for HNN-Extensions. 371-384 - Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken:
On Finding Separators in Temporal Split and Permutation Graphs. 385-398 - Marc Neveling, Jörg Rothe, Robin Weishaupt:
The Possible Winner Problem with Uncertain Weights Revisited. 399-412 - Jelle J. Oostveen, Erik Jan van Leeuwen:
Streaming Deletion Problems Parameterized by Vertex Cover. 413-426 - S. Raja, G. V. Sumukha Bharadwaj:
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits. 427-439 - Maciej Skorski:
Concentration of the Collision Estimator. 440-456 - Kyrill Winkler, Ulrich Schmid, Thomas Nowak:
Valency-Based Consensus Under Message Adversaries Without Limit-Closure. 457-474
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-07 00:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
