Amir Nikabadi

Research activity per year

Hitting all longest paths in $H$-free graphs and $H$-graphs
de Lima, P. T., Nikabadi, A. & Rzążewski, P., 20 Oct 2025, 14 p.
Research output: Working paper › Preprint

File
Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs.
Galby, E., Lima, P. T., Munaro, A. & Nikabadi, A., 1 Oct 2025, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Vol. 33rd Annual European Symposium on Algorithms (ESA 2025). p. 40:1-40:13
Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Open Access
Longest Path Transversals in Claw-Free and $$P_5$$-Free Graphs
Lima, P. T. & Nikabadi, A., 18 May 2025, Algorithms and Complexity. CICA 2025 ed. Springer, Vol. 15679. p. 310-325 15 p. (Lecture Notes in Computer Science, Vol. 15679).
Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
Galby, E., Lima, P. T., Munaro, A. & Nikabadi, A., 1 May 2025, p. 1-20, 20 p.
Research output: Working paper › Preprint

File

Personal profile