Algorithms for LS Vertex Cover achieve ℓ^{f(k)} n^{O(1)} time for ℓ equal to h-index, treewidth, modular-width, or a new modular-decomposition degree parameter, and extend to weighted d-improving swaps.
Comparison of phylogenetic trees
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
A multimodal alignment framework derives morphology-aware image embeddings as continuous traits for Bayesian phylogenetic reconstruction, improving topological agreement on the Rove-Tree-11 dataset.
citing papers explorer
-
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
Algorithms for LS Vertex Cover achieve ℓ^{f(k)} n^{O(1)} time for ℓ equal to h-index, treewidth, modular-width, or a new modular-decomposition degree parameter, and extend to weighted d-improving swaps.
-
Morphology-Aware Multimodal Representation Learning for Insect Phylogenetic Reconstruction
A multimodal alignment framework derives morphology-aware image embeddings as continuous traits for Bayesian phylogenetic reconstruction, improving topological agreement on the Rove-Tree-11 dataset.