Amir Nikabadi

According to our database, Amir Nikabadi authored at least 9 papers between 2021 and 2026.

Collaborative distances:

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

2026

Clique-width and induced topological minors.

Pawel Rafal Bielinski, Jadwiga Czyzewska, Martin Milanic, Amir Nikabadi, Pawel Rzazewski

CoRR, May, 2026

The Gallai Vertex Problem is Θ₂^p-Complete.

Amir Nikabadi, Eva Rotenberg, Lasse Wulf

CoRR, May, 2026

Equitable coloring of large bipartite graphs.

Amir Nikabadi

CoRR, April, 2026

2025

Hitting all longest paths in H-free graphs and H-graphs.

Paloma Thomé de Lima, Amir Nikabadi, Pawel Rzazewski

CoRR, October, 2025

Maximum list <i>r</i>-colorable induced subgraphs in kP₃-free graphs.

Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi

CoRR, May, 2025

Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs.

Esther Galby, Paloma T. Lima, Andrea Munaro, Amir Nikabadi

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Longest Path Transversals in Claw-Free and P₅-Free Graphs.

Paloma T. Lima, Amir Nikabadi

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems.

Ramin Javadi, Amir Nikabadi

Discret. Appl. Math., 2024

2021

Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.

Amir Nikabadi, Janne H. Korhonen

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021