3 citations · 5 across the 7 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
The Computational Complexity of Almost Stable Clustering with Penalties
Kamyar Khodamoradi, Farnam Mansouri, Sandra Zilles
We investigate the complexity of stable (or perturbation-resilient) instances of and clustering problems in metrics with smal…
cs.CC2023
Independent set in -Claw-Free Graphs: Conditional -boundedness and the Power of LP/SDP Relaxations
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi +1
This paper studies -claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight i…