Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.
Automatic sequences in negative bases and proofs of some conjectures of Shevelev
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.
citing papers explorer
-
Colorful Minors
Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.
-
Deconstructing Subset Construction -- Reducing While Determinizing
Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.