Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2011/02/01
-
Journal
-
Indian UGC (journal)
-
Refrences31
-
Citations17
-
René van Bevern
-
Hannes Moser
-
Rolf Niedermeier
Cite
van Bevern, René, et al. “Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion”. Algorithmica, vol. 62, no. 3-4, 2011, pp. 930-5, https://doi.org/10.1007/s00453-011-9492-7.
van Bevern, R., Moser, H., & Niedermeier, R. (2011). Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica, 62(3-4), 930-950. https://doi.org/10.1007/s00453-011-9492-7
van Bevern, René, Hannes Moser, and Rolf Niedermeier. “Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion”. Algorithmica 62, no. 3-4 (2011): 930-50. https://doi.org/10.1007/s00453-011-9492-7.
van Bevern R, Moser H, Niedermeier R. Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion. Algorithmica. 2011;62(3-4):930-5.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A kernelization algorithm for d-Hitting Set | Journal of Computer and System Sciences |
| 53 | 2010 |
| Fixed-Parameter Algorithms for Cluster Vertex Deletion | Theory of Computing Systems |
| 41 | 2010 |
| A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing | SIAM Journal on Discrete Mathematics |
| 20 | 2010 |
| Parameterized graph cleaning problems | Discrete Applied Mathematics |
| 3 | 2009 |
| On problems without polynomial kernels | Journal of Computer and System Sciences |
| 183 | 2009 |
Refrences Analysis
The category
Science: Mathematics 12
is the most frequently represented among the references in this article. It primarily includes studies from The Journal of Mathematical Sociology and Discrete Applied Mathematics. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Learning driven three-phase search for the maximum independent union of cliques problem | Computers & Operations Research |
| 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 | |
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size | Algorithmica |
| 1 | 2022 |
| Polyhedral properties of the induced cluster subgraphs | Discrete Applied Mathematics |
| 4 | 2021 |
| Hardness and tractability of the γ-Complete Subgraph problem | Information Processing Letters |
| 1 | 2021 |
Citations Analysis
The category
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods 10
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Parameterized Complexity of Eulerian Deletion Problems and was published in 2012. The most recent citation comes from a 2024 study titled Learning driven three-phase search for the maximum independent union of cliques problem. This article reached its peak citation in 2018, with 5 citations. It has been cited in 11 different journals, 9% of which are open access. Among related journals, the Algorithmica cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.