Ndiamé Ndiaye

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
k-leaf powers cannot be characterized by a finite set of forbidden induced subgraphs for k 5	2026-09-29	Paper
The popular dimension of matchings	2026-07-17	Paper
Recognizing leaf powers and pairwise compatibility graphs is NP-complete	2026-07-13	Paper
The speed and threshold of the biased Hamilton cycle game Procedia Computer Science	2025-12-02	Paper
The speed and threshold of the biased perfect matching game Procedia Computer Science	2025-12-02	Paper
The Popular Dimension of Matchings (available as arXiv preprint)	2025-01-01	Paper
Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete (available as arXiv preprint)	2025-01-01	Paper
On the hardness of recognizing graphs of small mim-width and its variants (available as arXiv preprint)	2025-01-01	Paper
The price of anarchy of probabilistic serial in one-sided allocation problems	2024-09-20	Paper
k-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k \geq 5 (available as arXiv preprint)	2024-01-01	Paper
Optimizing the CGMS upper bound on Ramsey numbers (available as arXiv preprint)	2024-01-01	Paper
On depth-3 circuits and covering number: an explicit counter-example	2022-10-15	Paper
Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? (available as arXiv preprint)	2022-06-01	Paper
On depth-3 circuits and covering number: an explicit counter-example (available as arXiv preprint)	2022-01-01	Paper
The Speed and Threshold of the Biased Perfect Matching Game	2020-12-08	Paper
The Speed and Threshold of the Biased Hamilton Cycle Game	2020-12-08	Paper

Research outcomes over time

This page was built for person: Ndiamé Ndiaye