Tight Running Time Lower Bounds for Vertex Deletion Problems

Article Properties
Abstract
Cite
Komusiewicz, Christian. “Tight Running Time Lower Bounds for Vertex Deletion Problems”. ACM Transactions on Computation Theory, vol. 10, no. 2, 2018, pp. 1-18, https://doi.org/10.1145/3186589.
Komusiewicz, C. (2018). Tight Running Time Lower Bounds for Vertex Deletion Problems. ACM Transactions on Computation Theory, 10(2), 1-18. https://doi.org/10.1145/3186589
Komusiewicz, Christian. “Tight Running Time Lower Bounds for Vertex Deletion Problems”. ACM Transactions on Computation Theory 10, no. 2 (2018): 1-18. https://doi.org/10.1145/3186589.
Komusiewicz C. Tight Running Time Lower Bounds for Vertex Deletion Problems. ACM Transactions on Computation Theory. 2018;10(2):1-18.
Journal Category
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Refrences
Title Journal Journal Categories Citations Publication Date
Lower bounds based on the exponential time hypothesis 2011
Johnson and Mario Szegedy 1999
The Nature of Computation, Logic, Algorithms, Applications
Fomin and Dieter Kratsch 2010
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
Citations
Title Journal Journal Categories Citations Publication Date
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs

 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
 2024
Fine-grained complexity of rainbow coloring and its variants 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
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

 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)
 2 2020
Split Contraction

 ACM Transactions on Computation Theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 5 2019
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software3
Science: Mathematics: Instruments and machines: Electronic computers. Computer science3
Science: Mathematics2
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware2
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
Technology: Engineering (General). Civil engineering (General)1
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 3 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Split Contraction and was published in 2019. 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 1 citations. It has been cited in 4 different journals. Among related journals, the Theory of Computing Systems cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year