Fixed-Parameter Algorithms for Cluster Vertex Deletion
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2008/10/15
-
Journal
-
Indian UGC (journal)
-
Refrences38
-
Citations41
-
Falk Hüffner
-
Christian Komusiewicz
-
Hannes Moser
-
Rolf Niedermeier
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Techniques for Practical Fixed-Parameter Algorithms | The Computer Journal |
| 16 | 2008 |
| Parameterized algorithms for feedback set problems and their duals in tournaments | Theoretical Computer Science |
| 29 | 2006 |
| Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation | Theory of Computing Systems |
| 47 | 2005 |
| Cluster graph modification problems | Discrete Applied Mathematics |
| 107 | 2004 |
| Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems | Algorithmica |
| 40 | 2004 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs | Theory of Computing Systems |
| 2024 | |
| Learning driven three-phase search for the maximum independent union of cliques problem | Computers & Operations Research |
| 2024 | |
| s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs | Discrete Applied Mathematics |
| 2024 | |
| Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU | Journal of Computer and System Sciences |
| 2024 | |
| Algorithms for 2-club cluster deletion problems using automated generation of branching rules | Theoretical Computer Science |
| 2024 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 28
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Confronting intractability via parameters and was published in 2011. The most recent citation comes from a 2024 study titled Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. This article reached its peak citation in 2024, with 5 citations. It has been cited in 18 different journals. Among related journals, the Algorithmica cited this research the most, with 6 citations. The chart below illustrates the annual citation trends for this article.