Amir Nikabadi

activity

20192026

most citedOn the Parameterized Complexity of Sparsest Cut and Small-set Expansion Problems

1 citations · 1 across the 11 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

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

Paloma T. de Lima, Amir Nikabadi, Paweł Rzążewski

The \textit{longest path transversal number} of a connected graph $G$ , denoted by $l pt (G)$ , is the minimum size of a set of vertices of $G$ that intersects all longest paths in $G$ …

math.CO2025

Maximum list $r$ -colorable induced subgraphs in $k P_{3}$ -free graphs

Esther Galby, Paloma T. Lima, Andrea Munaro +1

We show that, for every fixed positive integers $r$ and $k$ , \textsc{Max-Weight List $r$ -Colorable Induced Subgraph} admits a polynomial-time algorithm on $k P_{3}$ -free graphs. This…

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

Maximum list r-colorable induced subgraphs in kP3​-free graphs

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

Maximum list $r$ -colorable induced subgraphs in $k P_{3}$ -free graphs