Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs

Article Properties
Cite
Hartung, Sepp, et al. “Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs”. Journal of Graph Algorithms and Applications, vol. 19, no. 1, 2015, pp. 155-90, https://doi.org/10.7155/jgaa.00352.
Hartung, S., Komusiewicz, C., & Nichterlein, A. (2015). Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Journal of Graph Algorithms and Applications, 19(1), 155-190. https://doi.org/10.7155/jgaa.00352
Hartung, Sepp, Christian Komusiewicz, and André Nichterlein. “Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs”. Journal of Graph Algorithms and Applications 19, no. 1 (2015): 155-90. https://doi.org/10.7155/jgaa.00352.
Hartung S, Komusiewicz C, Nichterlein A. Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Journal of Graph Algorithms and Applications. 2015;19(1):155-90.
Journal Category
Science
Mathematics
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
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
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs European Journal of Operational Research
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering
  • Technology: Engineering (General). Civil engineering (General)
 2 2022
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies Journal of Computer and System Sciences
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • 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
 1 2022
Hardness and tractability of the γ-Complete Subgraph problem 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
 1 2021
Citations Analysis
Category Category Repetition
Technology: Engineering (General). Civil engineering (General)6
Science: Mathematics: Instruments and machines: Electronic computers. Computer science6
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software6
Technology: Manufactures: Production management. Operations management4
Technology: Technology (General): Industrial engineering. Management engineering4
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware4
Science: Mathematics4
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods2
Technology: Technology (General): Industrial engineering. Management engineering: Information technology1
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication1
Science: Science (General): Cybernetics: Information theory1
Social Sciences: Commerce: Business: Personnel management. Employment management1
The category Technology: Engineering (General). Civil engineering (General) 6 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled On the 2-Club Polytope of Graphs 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 2022, with 3 citations. It has been cited in 8 different journals, 12% of which are open access. Among related journals, the European Journal of Operational Research cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year