Ndiamé Ndiaye

According to our database, Ndiamé Ndiaye authored at least 13 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete.

Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

On the hardness of recognizing graphs of small mim-width and its variants.

Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye

CoRR, December, 2025

The Popular Dimension of Matchings.

Frank Connor, Louis-Roy Langevin, Ndiamé Ndiaye, Agnes Totschnig, Rohit Vasishta, Adrian Vetta

Proceedings of the Web and Internet Economics - 21st International Conference, 2025

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

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.

Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye, Adrian Vetta

CoRR, 2024

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., June, 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 Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems.

Sissi Jiang, Ndiamé Ndiaye, Adrian Vetta, Eggie Wu

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

2022

On depth-3 circuits and covering number: an explicit counter-example.

Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye

CoRR, 2022

2021

Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?

Ndiamé Ndiaye, Sergey Norin, Adrian Vetta

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 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

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

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

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.

Jack Raymond, Ndiamé Ndiaye, Gautam Rayaprolu, Andrew D. King

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020