most citedEfficient Causal Graph Discovery Using Large Language Models

6 citations · 6 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DS2026

Packing Diverse Shortest Cycles

Akanksha Agrawal, Fedor V. Fomin, Petr A. Golovach +3

Bentert, Fomin, Golovach, Korhonen, Lochet, Panolan, Ramanujan, Saurabh, and Simonov (SODA 2025) initiated the parameterized study of Edge-Disjoint Shortest Cycle Packing: given a…

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.GT2024

Controlling Delegations in Liquid Democracy

Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain +2

In liquid democracy, agents can either vote directly or delegate their vote to a different agent of their choice. This results in a power structure in which certain agents possess…

cs.LG2024★ 6 cited

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…