3 papers
cs.DS2026
Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm
Fedor V. Fomin, Petr A. Golovach, Yash Hiren More
In the Ultrametric Violation Distance problem, we are given a set of distances between points, and the goal is to modify the minimum number of distances so that the resulting s…
cs.DS2026
Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
Tian Bai, Fedor V. Fomin, Petr A. Golovach +2
Rank aggregation seeks a representative permutation for a collection of rankings and plays a central role in areas such as social choice, information retrieval, and computational b…
cs.LG2026
Efficient Causal Graph Discovery Using Large Language Models
Thomas Jiralerspong, Xiaoyin Chen, Yash More +2
We propose a novel framework that leverages LLMs for full causal graph discovery. While previous LLM-based methods have used a pairwise query approach, this requires a quadratic nu…