FCT B

31 papers

YearTitle / Authors
2023An Efficient Computation of the Rank Function of a Positroid.
Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef
2023Bounds for c-Ideal Hashing.
Fabian Frei, David Wehner
2023Complexity of Conformant Election Manipulation.
Zack Fitzsimmons, Edith Hemaspaandra
2023Computing Optimal Leaf Roots of Chordal Cographs in Linear Time.
Van Bang Le, Christian Rosenke
2023Computing Subset Vertex Covers in H-Free Graphs.
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023Contracting Edges to Destroy a Pattern: A Complexity Study.
Dipayan Chakraborty, R. B. Sandeep
2023Convergence of Distributions on Paths.
Samy Abbes
2023Cordial Forests.
Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams
2023Distance-Based Covering Problems for Graphs of Given Cyclomatic Number.
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
2023Domino Snake Problems on Groups.
Nathalie Aubrun, Nicolas Bitar
2023Exact and Parameterized Algorithms for the Independent Cutset Problem.
Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza
2023Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems.
Chris Köcher, Dietrich Kuske
2023Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings
Henning Fernau, Klaus Jansen
2023Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves.
Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
2023Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time.
William S. Evans, David G. Kirkpatrick
2023On Computing Optimal Temporal Branchings.
Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva
2023On Computing a Center Persistence Diagram.
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
2023On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman.
Joshua A. Grochow, Michael Levet
2023Parameterized Complexity of the
Ajinkya Gaikwad, Soumen Maity
2023Parsing Unranked Tree Languages, Folded Once.
Martin Berglund, Henrik Björklund, Johanna Björklund
2023Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata.
Tomoyuki Yamakami
2023Robust Identification in the Limit from Incomplete Positive Data.
Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz
2023Shortest Dominating Set Reconfiguration Under Token Sliding.
Jan Matyás Kristan, Jakub Svoboda
2023Subhedge Projection for Stepwise Hedge Automata.
Antonio Al Serhali, Joachim Niehren
2023The Complexity of (P
Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski
2023The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited.
Johanna Björklund
2023The Rectilinear Convex Hull of Line Segments.
Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara
2023Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku.
Kodai Tanaka, Takaaki Mizuki
2023Verified Exact Real Computation with Nondeterministic Functions and Limits.
Sewon Park
2023Vertex Ordering with Precedence Constraints.
Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar
2023α-β-Factorization and the Binary Case of Simon's Congruence.
Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka