Multivariate Algorithmics for Finding Cohesive Subnetworks

Article Properties
Cite
Komusiewicz, Christian. “Multivariate Algorithmics for Finding Cohesive Subnetworks”. Algorithms, vol. 9, no. 1, 2016, p. 21, https://doi.org/10.3390/a9010021.
Komusiewicz, C. (2016). Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms, 9(1), 21. https://doi.org/10.3390/a9010021
Komusiewicz, Christian. “Multivariate Algorithmics for Finding Cohesive Subnetworks”. Algorithms 9, no. 1 (2016): 21. https://doi.org/10.3390/a9010021.
Komusiewicz C. Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms. 2016;9(1):21.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Technology (General)
Industrial engineering
Management engineering
Refrences
Title Journal Journal Categories Citations Publication Date
Local Density 2004
Alliances in graphs Journal of Combinatorial Mathematics and Combinatorial Computing 2004
Graph-theoretic clique relaxations and applications 2013
Trusses: Cohesive Subgraphs for Social Network Analysis 2008
Social Network Analysis: Methods and Applications 1994
Citations
Title Journal Journal Categories Citations Publication Date
The Parameterized Complexity of s-Club with Triangle and Seed Constraints

Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2023
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
2023
Computing the k densest subgraphs of a graph Information Processing Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Information technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
  • Science: Science (General): Cybernetics: Information theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2023
On the parameterized complexity of s-club cluster deletion problems Theoretical Computer Science
  • 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
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2023
On the Tractability of Covering a Graph with 2-Clubs

Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
2022
Citations Analysis
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 11 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue and was published in 2016. The most recent citation comes from a 2023 study titled The Parameterized Complexity of s-Club with Triangle and Seed Constraints. This article reached its peak citation in 2023, with 4 citations. It has been cited in 14 different journals, 14% of which are open access. Among related journals, the Theoretical Computer Science cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year