Ndiamé Ndiaye

Orcid: 0000-0002-4920-6566

According to our database1, Ndiamé Ndiaye authored at least 9 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
<i>k</i>-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5.
CoRR, 2024

2023
The speed and threshold of the biased perfect matching and Hamilton cycle games.
Discret. Appl. Math., June, 2023

The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit Demand Agents.
CoRR, 2023

The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

2022
On depth-3 circuits and covering number: an explicit counter-example.
CoRR, 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

The Speed and Threshold of the Biased Hamilton Cycle Game.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

The Speed and Threshold of the Biased Perfect Matching Game.
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


  Loading...