Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2009/03/13
-
Journal
-
Indian UGC (journal)
-
Refrences32
-
Citations31
-
Frederic Dorn
-
Eelko Penninkx
-
Hans L. Bodlaender
-
Fedor V. Fomin
Cite
Dorn, Frederic, et al. “Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions”. Algorithmica, vol. 58, no. 3, 2009, pp. 790-1, https://doi.org/10.1007/s00453-009-9296-1.
Dorn, F., Penninkx, E., Bodlaender, H. L., & Fomin, F. V. (2009). Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica, 58(3), 790-810. https://doi.org/10.1007/s00453-009-9296-1
Dorn, Frederic, Eelko Penninkx, Hans L. Bodlaender, and Fedor V. Fomin. “Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions”. Algorithmica 58, no. 3 (2009): 790-810. https://doi.org/10.1007/s00453-009-9296-1.
Dorn F, Penninkx E, Bodlaender HL, Fomin FV. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica. 2009;58(3):790-81.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| The Bidimensionality Theory and Its Algorithmic Applications | The Computer Journal |
| 58 | 2008 |
| Subexponential parameterized algorithms | Computer Science Review |
| 18 | 2008 |
New upper bounds on the decomposability of planar graphs | Journal of Graph Theory |
| 23 | 2006 |
| Exact algorithms for the Hamiltonian cycle problem in planar graphs | Operations Research Letters |
| 13 | 2006 |
Subexponential parameterized algorithms on bounded-genus graphs and
H
-minor-free graphs | Journal of the ACM |
| 109 | 2005 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs | Algorithmica |
| 2023 | |
Upward Book Embeddability of st-Graphs: Complexity and Algorithms | Algorithmica |
| 2023 | |
| Counting Cycles on Planar Graphs in Subexponential Time | Algorithmica |
| 2023 | |
| Parameterized complexity of graph planarity with restricted cyclic orders | Journal of Computer and System Sciences |
| 2023 | |
| An ETH-Tight Exact Algorithm for Euclidean TSP | SIAM Journal on Computing |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 25
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Confronting intractability via parameters and was published in 2011. The most recent citation comes from a 2023 study titled Counting Cycles on Planar Graphs in Subexponential Time. This article reached its peak citation in 2023, with 5 citations. It has been cited in 14 different journals. Among related journals, the Algorithmica cited this research the most, with 8 citations. The chart below illustrates the annual citation trends for this article.