Skip to main content
SpringerLink
Log in

Fundamentals of Computation Theory

24th International Symposium, FCT 2023, Trier, Germany, September 18–21, 2023, Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Henning Fernau

    1. University of Trier, Trier, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Klaus Jansen

    1. University of Kiel, Kiel, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: FCT 2023.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Convergence of Distributions on Paths

    • Samy Abbes
    Pages 1-15

  3. Subhedge Projection for Stepwise Hedge Automata

    • Antonio Al Serhali, Joachim Niehren
    Pages 16-31

  4. The Rectilinear Convex Hull of Line Segments

    • Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara
    Pages 32-45

  5. Domino Snake Problems on Groups

    • Nathalie Aubrun, Nicolas Bitar
    Pages 46-59

  6. Parsing Unranked Tree Languages, Folded Once

    • Martin Berglund, Henrik Björklund, Johanna Björklund
    Pages 60-73

  7. The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze’s Conjecture Revisited

    • Johanna Björklund
    Pages 74-87

  8. Computing Subset Vertex Covers in H-Free Graphs

    • Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
    Pages 88-102

  9. On Computing Optimal Temporal Branchings

    • Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva
    Pages 103-117

  10. Contracting Edges to Destroy a Pattern: A Complexity Study

    • Dipayan Chakraborty, R. B. Sandeep
    Pages 118-131

  11. Distance-Based Covering Problems for Graphs of Given Cyclomatic Number

    • Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
    Pages 132-146

  12. An Efficient Computation of the Rank Function of a Positroid

    • Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef
    Pages 147-161

  13. Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time

    • William Evans, David Kirkpatrick
    Pages 162-175

  14. Complexity of Conformant Election Manipulation

    • Zack Fitzsimmons, Edith Hemaspaandra
    Pages 176-189

  15. \(\alpha \)-\(\beta \)-Factorization and the Binary Case of Simon’s Congruence

    • Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka
    Pages 190-204

  16. Bounds for c-Ideal Hashing

    • Fabian Frei, David Wehner
    Pages 205-220

  17. Parameterized Complexity of the \(\mathcal {T}_{h+1}\)-Free Edge Deletion Problem

    • Ajinkya Gaikwad, Soumen Maity
    Pages 221-233

  18. On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman

    • Joshua A. Grochow, Michael Levet
    Pages 234-247

  19. The Complexity of \((P_k, P_\ell )\)-Arrowing

    • Zohair Raza Hassan, Edith Hemaspaandra, Stanisław Radziszowski
    Pages 248-261

  20. On Computing a Center Persistence Diagram

    • Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama et al.
    Pages 262-275
Back to top

Other volumes

  1. Fundamentals of Computation Theory

Keywords

About this book

This book constitutes the proceedings of the 24th International Symposium on Fundamentals of Computation Theory, FCT 2023, held in Trier, Germany, in September 2023. The __ full papers included in this volume were carefully reviewed and selected from __ submissions. In addition, the book contains ____ invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.

Editors and Affiliations

  • University of Trier, Trier, Germany

    Henning Fernau

  • University of Kiel, Kiel, Germany

    Klaus Jansen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation