Improving performance of logical qubits by parameter tuning and topology compensation. - Jack Raymond; Ndiamé Ndiaye; Gautam Rayaprolu; Andrew D. King (QCE, 2020)

The Speed and Threshold of the Biased Perfect Matching Game. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (LAGOS, 2021)

The Speed and Threshold of the Biased Hamilton Cycle Game. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (LAGOS, 2021)

Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? - Ndiamé Ndiaye; Sergey Norin; Adrian Vetta (SAGT, 2021)

On depth-3 circuits and covering number: an explicit counter-example. - Lianna Hambardzumyan; Hamed Hatami; Ndiamé Ndiaye (CoRR, 2022)

The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems. - Sissi Jiang; Ndiamé Ndiaye; Adrian Vetta; Eggie Wu (WINE, 2023)

The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit Demand Agents. - Sissi Jiang; Ndiamé Ndiaye; Adrian Vetta; Eggie Wu (CoRR, 2023)

The speed and threshold of the biased perfect matching and Hamilton cycle games. - Noah Brüstle; Sarah Clusiau; Vishnu V. Narayan; Ndiamé Ndiaye; Bruce A. Reed; Ben Seamone (Discret. Appl. Math., 2023)

k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. - Max Dupré la Tour; Manuel Lafond; Ndiamé Ndiaye; Adrian Vetta (CoRR, 2024)

k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5. - Max Dupré la Tour; Manuel Lafond; Ndiamé Ndiaye; Adrian Vetta (ICALP, 2025)

The Popular Dimension of Matchings. - Frank Connor; Louis-Roy Langevin; Ndiamé Ndiaye; Agnes Totschnig; Rohit Vasishta; Adrian Vetta (CoRR, 2025)