Author

Danny Mittal

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

On the Strong Matroid Secretary Conjecture and Beyond

The strong matroid secretary conjecture asserts that every matroid admits a $1/e$-competitive secretary algorithm, matching the classical single-choice guarantee. We formulate a finite linear program whose value is the optimal ordinal competitive ratio of any fixed matroid; for all matroids of positive rank on seven el...

Hamed Abdi, Kiarash Banihashem, Mohammadtaghi Hajiaghayi et al. · 5 citations · ⚡1

Preprint Aug 2026

Computing All Optimal Partial $p$-Wasserstein Matchings on the Line

For $p \ge 1$, the $p$-Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p$th power of their distance. For discrete distributions in one dimension, full transport is especially simple: after sorting, mass is matche...

Sebastian Angrick, Jacobus Conradi, Mónika Csikós et al. · 0 citations

#machine learning Preprint Sep 2026

Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation

Graph Neural Networks (GNNs) are widely used for representation learning on graphs, but most methods assume static topologies, making them inefficient on evolving networks where edges change over time. Existing dynamic approaches either model graph evolution through temporal GNN architectures without focusing on effici...

Kiarash Banihashem, Mohammadtaghi Hajiaghayi, Mahdi JafariRaviz et al. · 0 citations