Amir Nikabadi

Publikationer pr. år

Longest Path Transversals in Claw-Free and $$P_5$$-Free Graphs
Lima, P. T. & Nikabadi, A., 18 maj 2025, Algorithms and Complexity. CICA 2025 udg. Springer, Bind 15679. s. 310-325 15 s. (Lecture Notes in Computer Science, Bind 15679).
Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Maximum List r-Colorable Induced Subgraphs in kP₃-Free Graphs.
Galby, E., Lima, P. T., Munaro, A. & Nikabadi, A., 1 okt. 2025, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 33rd Annual European Symposium on Algorithms (ESA 2025). s. 40:1-40:13
Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Åben adgang
Hitting all longest paths in $H$-free graphs and $H$-graphs
de Lima, P. T., Nikabadi, A. & Rzążewski, P., 20 okt. 2025, 14 s.
Publikation: Working paper › Preprint

Fil
Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
Galby, E., Lima, P. T., Munaro, A. & Nikabadi, A., 1 maj 2025, s. 1-20, 20 s.
Publikation: Working paper › Preprint

Fil

Personlig profil