| 2026 | ICALP | On the Hardness of Recognizing Graphs of Small Mim-Width and Its Variants. | Max Dupr la Tour, Manuel Lafond, Ndiam Ndiaye |
| 2026 | SODA | Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete. | Max Dupr la Tour, Manuel Lafond, Ndiam Ndiaye |
| 2025 | ICALP | 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 |
| 2021 | LAGOS | The Speed and Threshold of the Biased Perfect Matching Game. | Noah Brstle, Sarah Clusiau, Vishnu V. Narayan, Ndiam Ndiaye, Bruce A. Reed, Ben Seamone |
| 2021 | LAGOS | The Speed and Threshold of the Biased Hamilton Cycle Game. | Noah Brstle, Sarah Clusiau, Vishnu V. Narayan, Ndiam Ndiaye, Bruce A. Reed, Ben Seamone |
| 2021 | SAGT | Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? | Ndiam Ndiaye, Sergey Norin, Adrian Vetta |
| 2020 | QCE | Improving performance of logical qubits by parameter tuning and topology compensation. | Jack Raymond, Ndiam Ndiaye, Gautam Rayaprolu, Andrew D. King |