Titlebook: LATIN 2024: Theoretical Informatics; 16th Latin American José A. Soto,Andreas Wiese Conference proceedings 2024 The Editor(s) (if applicab

傻

奇怪

手段

The Hardness of Local Certification of Finite-State Dynamics First, we study the problem . on arbitrary graphs and show that every PLS has certificates of size . (up to logarithmic factors). Then, we turn to the restriction of the problem on graphs of maximum degree .. Roughly, we show that the problem admits a PLS with certificates of size ., while every PL

Commonwealth

Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardnessnd .. For any graph ., we have . and .. First, we explore the connection of . problem to the well-known problem .. Note that . is known to be NP-Complete for . 3.. We generalize this result by proving that both the problems . and . are NP-Complete, and do not admit any subexponential-time algorithms

斜坡

A BWT-Based Algorithm for Random de Bruijn Sequence Constructionnd on a laptop computer for orders up to 23, including outputting the sequence. It can be straightforwardly extended to any constant-size alphabet. To the best of our knowledge, this is the first practical algorithm for generating random dB sequences which is capable of producing . dB sequences. Apa

煞费苦心

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fastmber of suffixes with an LCP value greater than . is in ., matching the time of optimal yet much more complicated algorithms [Gawrychowski and Kociumaka, SODA 2017; Birenzwige et al., SODA 2020]; and . in the sense that they can be implemented using . . machine words. We also show that our second al

Canopy

Faster Combinatorial ,-Clique Algorithmsve the state-of-the-art (even of non-combinatorial algorithms) for generalizations of the .-Clique problem. In particular, we give the first . algorithm for .-clique in hypergraphs and an . algorithm for listing . triangles in a graph.

倔强不能

On Approximate Colored Path Countingn ., where . is an arbitrary constant in (0, 1); our solution not only has faster query time but also always returns a .-approximation. When designing .-approximate solutions, our techniques also yield an .(.)-word structure that can answer a colored type-2 path counting query in . time; this query

诱骗

刺耳

Gonzalo Navarro,Cristian Urbinae subject such as the collection, representation, management, and methods of extracting grammatical information from discourse and conversational data as well as the relationship between questionnaire-based elicitation, text-based elicitation, and philology, and the need for combinations of these me