On biconnected and fragile subgraphs of low diameter

Article Properties
Cite
Yezerska, Oleksandra, et al. “On Biconnected and Fragile Subgraphs of Low Diameter”. European Journal of Operational Research, vol. 263, no. 2, 2017, pp. 390-0, https://doi.org/10.1016/j.ejor.2017.05.020.
Yezerska, O., Mahdavi Pajouh, F., & Butenko, S. (2017). On biconnected and fragile subgraphs of low diameter. European Journal of Operational Research, 263(2), 390-400. https://doi.org/10.1016/j.ejor.2017.05.020
Yezerska, Oleksandra, Foad Mahdavi Pajouh, and Sergiy Butenko. “On Biconnected and Fragile Subgraphs of Low Diameter”. European Journal of Operational Research 263, no. 2 (2017): 390-400. https://doi.org/10.1016/j.ejor.2017.05.020.
Yezerska O, Mahdavi Pajouh F, Butenko S. On biconnected and fragile subgraphs of low diameter. European Journal of Operational Research. 2017;263(2):390-40.
Journal Categories
Technology
Engineering (General)
Civil engineering (General)
Technology
Manufactures
Production management
Operations management
Technology
Technology (General)
Industrial engineering
Management engineering
Refrences
Title Journal Journal Categories Citations Publication Date
On provably best construction heuristics for hard combinatorial optimization problems

Networks
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Technology: Manufactures: Production management. Operations management
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
6 2016
On the 2-Club Polytope of Graphs

Operations Research
  • Technology: Manufactures: Production management. Operations management
  • Social Sciences: Commerce: Business: Personnel management. Employment management
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
9 2016
On clique relaxation models in network analysis European Journal of Operational Research
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering
  • Technology: Engineering (General). Civil engineering (General)
79 2013
Algorithms for the maximum k-club problem in graphs Journal of Combinatorial Optimization
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Science: Mathematics
15 2013
Identifying large robust network clusters via new compact formulations of maximum k-club problems European Journal of Operational Research
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering
  • Technology: Engineering (General). Civil engineering (General)
48 2012
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 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
On Fault-Tolerant Low-Diameter Clusters in Graphs

INFORMS Journal on Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Manufactures: Production management. Operations management
  • 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
Finding influential groups in networked systems: The most degree-central clique problem Omega
  • Technology: Manufactures: Production management. Operations management
  • Social Sciences: Commerce: Business: Personnel management. Employment management
  • Social Sciences: Industries. Land use. Labor: Management. Industrial management
  • Social Sciences: Commerce: Business
  • Social Sciences: Economic theory. Demography: Economics as a science
11 2021
On the maximum small-world subgraph problem European Journal of Operational Research
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering
  • Technology: Engineering (General). Civil engineering (General)
3 2020
Citations Analysis
The category Technology: Manufactures: Production management. Operations management 6 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Minimum cost edge blocker clique problem and was published in 2019. 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 2 citations. It has been cited in 5 different journals. 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