[DMANET] FCT: Call for Participation

On September 18th-21st, 2023, the 24th International Symposium on Fundamentals of Computation Theory, FCT 2023 will take place in Trier, Germany. For updated information, see the conference webpage: https://www.uni-trier.de/index.php?id=71937&L=2

On September 22nd, we plan a workshop that should trigger common research. So, stay for one day longer!

News

* Registration is now open<https://docs.google.com/forms/d/e/1FAIpQLScP-eh6FVB74IawaDxQ1StJonTdN_MfOs5cl0ncEvR7VeGATg/viewform?usp=sf_link>. For the authors of accepted papers, we request that at least one author will register with "full registration". Non-full online registrations are for free. Only to fully-registered participants, printed proceedings can be delivered.

* List of accepted papers appears below.

* Titles of the invited talks have been added below to the speakers.

Invited Speakers

* Karl Bringmann, MPI Saarbrücken, Germany: Fine-Grained Complexity of Knapsack Problems

* Stefan Glock, Univ. Passau, Germany: Hamilton Cycles in Pseudorandom Graphs

* Lila Kari, Univ. Waterloo, Canada: Word Frequency and Machine Learning for Biodiversity Informatics

* Claire Mathieu, Univ. Sorbonne Paris, CNRS, France: Approximation Algorithms for Vehicle Routing

Accepted Papers

* Samy Abbes: Convergence of Distributions on Paths

* Antonio Al Serhali, Joachim Niehren: Subtree Projection for Stepwise Hedge Automata

* Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara: The Rectilinear Convex Hull of Line Segments

* Nicolas Bitar, Nathalie Aubrun: Domino Snake Problems on Groups

* Martin Berglund, Henrik Björklund, Johanna Björklund: Parsing Unranked Tree Languages, Folded Once

* Johanna Björklund: The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited

* Nick Brettell, Jelle Oostveen, Daniel Paulusma, Erik Jan van Leeuwen, Sukanya Pandey: Computing Subset Vertex Covers in H-Free Graphs

* Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva: On Computing Optimal Temporal Branchings

* Dipayan Chakraborty, RB Sandeep: Contracting Edges to Destroy a Pattern: A Complexity Study

* Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen: Distance-based Covering Problems for Graphs of Given Cyclomatic Number

* Lamar Chidiac, Santiago Guzman-Pro, Anthony Youssef, Winfried Hochstättler: An Efficient Computation of the Rank Function of a Positroid

* William Evans, David Kirkpatrick: Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time

* Zack Fitzsimmons, Edith Hemaspaandra: Complexity of Conformant Election Manipulation

* Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka: α-β-Factorization and the Binary Case of Simon's Congruence

* Fabian Frei, David Wehner: Bounds for c-Ideal Hashing

* Ajinkya Gaikwad, Soumen Maity: Parameterized Complexity of T_{h+1}-Free Edge Deletion Problem

* Michael Levet, Joshua A. Grochow: On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman

* Zohair Raza Hassan, Edith Hemaspaandra, Stanisław Radziszowski: The Complexity of (P_k, P_l)-Arrowing

* Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teyuyama, Binhai Zhu: On Computing a Center Persistence Diagram

* Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz: Robust Identification in the Limit from Incomplete Positive Data

* Feston Kastrati, Wendy Myrvold, Lucas Panjer, Aaron Williams: Cordial Forests

* Jeff Kinne, Arash Rafiey, Akbar Rafiey, Mohammad Sorkhpar: Vertex ordering with precedence constraints

* Dietrich Kuske, Chris Köcher: Forwards- and Backwards-Reachability for Cooperating Multi-Pushdown Systems

* Matyáš Křišťan, Jakub Svoboda: Shortest Dominating Set Reconfiguration under Token Sliding

* Van Bang Le, Christian Rosenke: Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

* Sewon Park: Verified Exact Real Computation with Nondeterministic Functions and Limits

* Uéverton Souza, Dieter Rautenbach, Johannes Rauch: Exact and Parameterized Algorithms for the Independent Cutset Problem

* Emmanuel Sam, Benjamin Bergougnoux, Petr Golovach, Nello Blaser, Nello Blaser: Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves

* Kodai Tanaka, Takaaki Mizuki: Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku

* Tomoyuki Yamakami: Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata




**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************