Skip to main content
  • Conference proceedings
  • © 2021

Fundamentals of Computation Theory

23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12867)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): FCT: International Symposium on Fundamentals of Computation Theory

Conference proceedings info: FCT 2021.

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-86593-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (32 papers)

  1. Front Matter

    Pages i-xix
  2. Invited Papers

    1. Front Matter

      Pages 1-1
    2. Two-Sided Matching Markets with Strongly Correlated Preferences

      • Hugo Gimbert, Claire Mathieu, Simon Mauras
      Pages 3-17
    3. Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session Types

      • Nobuko Yoshida, Fangyi Zhou, Francisco Ferreira
      Pages 18-35
  3. Contributed Papers

    1. Front Matter

      Pages 37-37
    2. First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words

      • Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith
      Pages 39-52
    3. From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization

      • Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
      Pages 53-66
    4. Computational Complexity of Covering Disconnected Multigraphs

      • Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová
      Pages 85-99
    5. The Complexity of Bicriteria Tree-Depth

      • Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
      Pages 100-113
    6. TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs

      • Nicolas Bousquet, Alice Joffard
      Pages 114-134
    7. Bipartite 3-Regular Counting Problems with Mixed Signs

      • Jin-Yi Cai, Austen Z. Fan, Yin Liu
      Pages 135-148
    8. The Satisfiability Problem for a Quantitative Fragment of PCTL

      • Miroslav Chodil, Antonín Kučera
      Pages 149-161
    9. Beyond the BEST Theorem: Fast Assessment of Eulerian Trails

      • Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi
      Pages 162-175
    10. Linear-Time Minimal Cograph Editing

      • Christophe Crespelle
      Pages 176-189
    11. Regular Model Checking with Regular Relations

      • Vrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi
      Pages 190-203
    12. Minimum Consistent Subset Problem for Trees

      • Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
      Pages 204-216
    13. The Space Complexity of Sum Labelling

      • Henning Fernau, Kshitij Gajjar
      Pages 230-244
    14. On Minimizing Regular Expressions Without Kleene Star

      • Hermann Gruber, Markus Holzer, Simon Wolfsteiner
      Pages 245-258

Other Volumes

  1. Fundamentals of Computation Theory

    23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings

About this book

This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.


Keywords

  • adaptive algorithms
  • artificial intelligence
  • automata theory
  • computer systems
  • directed graphs
  • fuzzy sets
  • graph g
  • graph theory
  • graphic methods
  • polynomial approximation
  • signal processing
  • theoretical computer science

Editors and Affiliations

  • Sorbonne University, Paris, France

    Evripidis Bampis

  • National Technical University of Athens, Athens, Greece

    Aris Pagourtzis

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-86593-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)