Exact Algorithms via Monotone Local Search
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2019/03/08
-
Journal
-
Indian UGC (journal)
-
Refrences50
-
Citations7
-
Fedor V. Fomin University of Bergen, Bergen, Norway
-
Serge Gaspers UNSW Sydney 8 Data61, CSIRO, Australia
-
Daniel Lokshtanov University of Bergen, Bergen, Norway
-
Saket Saurabh University of Bergen, Norway 8 Institute of Mathematical Sciences, Chennai, India
Abstract
Cite
Fomin, Fedor V., et al. “Exact Algorithms via Monotone Local Search”. Journal of the ACM, vol. 66, no. 2, 2019, pp. 1-23, https://doi.org/10.1145/3284176.
Fomin, F. V., Gaspers, S., Lokshtanov, D., & Saurabh, S. (2019). Exact Algorithms via Monotone Local Search. Journal of the ACM, 66(2), 1-23. https://doi.org/10.1145/3284176
Fomin, Fedor V., Serge Gaspers, Daniel Lokshtanov, and Saket Saurabh. “Exact Algorithms via Monotone Local Search”. Journal of the ACM 66, no. 2 (2019): 1-23. https://doi.org/10.1145/3284176.
Fomin FV, Gaspers S, Lokshtanov D, Saurabh S. Exact Algorithms via Monotone Local Search. Journal of the ACM. 2019;66(2):1-23.
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 |
|---|---|---|---|---|
| Complexity and completeness of finding another solution and its application to puzzles. IEICE | 2003 | |||
| On maximal transitive subtournaments. Proc. Edinburgh | 1971 | |||
| Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS’16) | 2016 | |||
| Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS’15) | 2015 | |||
| Proceedings of the 21st Annual European Symposium on Algorithms (ESA’13) | 2013 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs | Discrete Applied Mathematics |
| 2024 | |
| Exact algorithms for restricted subset feedback vertex set in chordal and split graphs | Theoretical Computer Science |
| 2024 | |
Dynamic thresholding search for the feedback vertex set problem | PeerJ Computer Science |
| 2023 | |
| A tight approximation algorithm for the cluster vertex deletion problem | Mathematical Programming |
| 2 | 2022 |
| Exact algorithms for counting 3-colorings of graphs | Discrete Applied Mathematics |
| 2022 |
Citations Analysis
The category
Science: Mathematics 5
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Subset Feedback Vertex Set in Chordal and Split Graphs and was published in 2019. The most recent citation comes from a 2024 study titled s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. This article reached its peak citation in 2024, with 2 citations. It has been cited in 5 different journals, 20% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.