n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
Complexity of independent set reconfigurability problems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Empirical classification of search landscapes for two combinatorial problems across graph classes and two neighborhoods.
citing papers explorer
-
On (In)approximability of MaxMin Independent Set Reconfiguration
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
-
Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Empirical classification of search landscapes for two combinatorial problems across graph classes and two neighborhoods.