Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A more effective linear kernelization for cluster editing | Theoretical Computer Science |
| 40 | 2009 |
Going weighted: Parameterized algorithms for cluster editing | Theoretical Computer Science |
| 24 | 2009 |
Clustering with qualitative information | Journal of Computer and System Sciences |
| 79 | 2005 |
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation | Theory of Computing Systems |
| 47 | 2005 |
Correlation clustering | 2004 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Asymptotic bounds for clustering problems in random graphs | Networks |
| 2023 | |
2k-Vertex Kernels for Cluster Deletion and Strong Triadic Closure | Journal of Computer Science and Technology |
| 2023 | |
A survey of parameterized algorithms and the complexity of edge modification | Computer Science Review |
| 1 | 2023 |
(1,1)-Cluster Editing is polynomial-time solvable | Discrete Applied Mathematics |
| 2023 | |
On the parameterized complexity of s-club cluster deletion problems | Theoretical Computer Science |
| 2023 |