A greedy online algorithm achieves optimal competitive ratio ζ for independent set on bounded-kissing-number graphs, while randomized geometric algorithms yield polylog-competitive ratios for unit balls in R^3 and α-fat objects.
Garey and David S
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete, implying PSPACE-completeness for spanning subgraph reconfiguration of (i,j)-bicliques and for two-component connected-components reconfiguration under all token rules.
citing papers explorer
-
Online Algorithms for Geometric Independent Set
A greedy online algorithm achieves optimal competitive ratio ζ for independent set on bounded-kissing-number graphs, while randomized geometric algorithms yield polylog-competitive ratios for unit balls in R^3 and α-fat objects.
-
Biclique Reconfiguration in Bipartite Graphs
Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete, implying PSPACE-completeness for spanning subgraph reconfiguration of (i,j)-bicliques and for two-component connected-components reconfiguration under all token rules.