Ndiamé Ndiaye
Orcid: 0000-0002-4920-6566
According to our database1,
Ndiamé Ndiaye
authored at least 11 papers
between 2020 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025
2024
<i>k</i>-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5.
CoRR, 2024
2023
Discret. Appl. Math., June, 2023
CoRR, 2023
Proceedings of the Web and Internet Economics - 19th International Conference, 2023
2022
2021
Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
Improving performance of logical qubits by parameter tuning and topology compensation.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020