Polynomial Bounds for the Grid-Minor Theorem
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2016/12/17
-
Journal
-
Indian UGC (journal)
-
Refrences36
-
Citations27
-
Chandra Chekuri University of Illinois, Urbana-Champaign, Urbana, IL
-
Julia Chuzhoy Toyota Technological Institute at Chicago, Chicago IL
Abstract
Cite
Chekuri, Chandra, and Julia Chuzhoy. “Polynomial Bounds for the Grid-Minor Theorem”. Journal of the ACM, vol. 63, no. 5, 2016, pp. 1-65, https://doi.org/10.1145/2820609.
Chekuri, C., & Chuzhoy, J. (2016). Polynomial Bounds for the Grid-Minor Theorem. Journal of the ACM, 63(5), 1-65. https://doi.org/10.1145/2820609
Chekuri, Chandra, and Julia Chuzhoy. “Polynomial Bounds for the Grid-Minor Theorem”. Journal of the ACM 63, no. 5 (2016): 1-65. https://doi.org/10.1145/2820609.
1.
Chekuri C, Chuzhoy J. Polynomial Bounds for the Grid-Minor Theorem. Journal of the ACM. 2016;63(5):1-65.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Menger-type results for three or more vertices | 1996 | |||
| Proof of a conjecture of P | 1970 | |||
| Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS’12) | 2012 | |||
| Graph Theory | ||||
| Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics | 2003 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
On tree decompositions whose trees are minors | Journal of Graph Theory |
| 2024 | |
| On the parameterized complexity of freezing dynamics | Advances in Applied Mathematics |
| 2024 | |
| Tight Bound on Treedepth in Terms of Pathwidth and Longest Path | Combinatorica |
| 1 | 2023 |
| Edge-treewidth: Algorithmic and combinatorial properties | Discrete Applied Mathematics |
| 2023 | |
| Grid induced minor theorem for graphs of small degree | Journal of Combinatorial Theory, Series B |
| 6 | 2023 |
Citations Analysis
The category
Science: Mathematics 22
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A Tight Erdös--Pósa Function for Wheel Minors and was published in 2018. The most recent citation comes from a 2024 study titled On the parameterized complexity of freezing dynamics. This article reached its peak citation in 2020, with 6 citations. It has been cited in 16 different journals, 6% of which are open access. Among related journals, the SIAM Journal on Discrete Mathematics cited this research the most, with 6 citations. The chart below illustrates the annual citation trends for this article.