Amir Nikabadi
I am a PhD student at IT University of Copenhagen. My advisors are Paloma T. Lima and Thore Husfeldt.
I am currently studying structural graph theory, mostly induced subgraphs, and sometimes algorithms.
I am also interested in algebraic and combinatorial topology.
My email address is amir@itu.dk.
This is a link to my Google Scholar.
Embedded Files
Papers and preprints
Induced packing treewidth, with P. Rzążewski.
Clique-width and induced topological minors, with P. R. Bieliński, J. Czyżewska, M. Milanič, and P. Rzążewski.
The Gallai vertex problem is hard, with E. Rotenberg and L. Wulf.
Non-empty intersection of longest paths in P5-free and claw-free graphs, with P. T. Lima.
Counting equitable k-colorings in graphs of bounded clique-width, with Holger Dell, and Thore Husfeldt, MFCS 2026.
Upper clique transversal on interval graphs and beyond, with L. Jaffke, and P. T. Lima, MFCS 2026.
Hitting all longest paths in H-free graphs and H-graphs, with P. T. Lima, and P. Rzążewski, LATIN 2026.
Maximum list r-colorable induced subgraphs in kP3-free graphs, with E. Galby, P. T. Lima, and A. Munaro, ESA 2025.
On the parameterized complexity of sparsest cut and small-set expansion problems, with R. Javadi, Discrete Applied Mathematics.
Beyond distributed subgraph detection, with J. H. Korhonen, LIPIcs.
Google Sites
Report abuse