The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Approximation Algorithms for NP-Hard Problems
(1997) · ACM SIGACT News · doi:10.1145/261342.571216 · Cited by 3,103
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
Graph Drawing: Algorithms for the Visualization of Graphs
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1998) · Iris (Roma Tre University) · Cited by 1,977
Optimization, approximation, and complexity classes
Papadimitriou, C. H., & Yannakakis, M. (1991) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(91)90023-x · Cited by 1,653 · cited 1×
“More precisely, if P � NP, then DOMINATING SET has no polynomial time approximation scheme, see p. 503 of [6], since it is hard for the approximation class MAX SNP defined in [ 41 ].”
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Bodlaender, H. L. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793251219 · Cited by 1,542
Self-citationProof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
A partial k-arboretum of graphs with bounded treewidth
Bodlaender, H. L. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00228-4 · Cited by 1,202
Self-citationApproximation algorithms for NP-complete problems on planar graphs
Baker, B. S. (1994) · Journal of the ACM · doi:10.1145/174644.174650 · Cited by 947
On the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1994) · Journal of the ACM · doi:10.1145/185675.306789 · Cited by 872
Treewidth: Algorithmic techniques and results
Bodlaender, H. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0029946 · Cited by 289
Self-citationNon deterministic polynomial optimization problems and their approximations
Paz, A., & Moran, S. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90081-5 · Cited by 183
Parameterized Computational Feasibility
Downey, R. G., & Fellows, M. R. (1995) · Feasible Mathematics II · doi:10.1007/978-1-4612-2566-9_7 · Cited by 164
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
Cai, L., & Juedes, D. W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-48224-5_23 · Cited by 37
Cited by
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
Self-citationPARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
Self-citationSimulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Strong computational lower bounds via parameterized complexity
Chen, J., Huang, X., Kanj, I. A., & Xia, G. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2006.04.007 · Cited by 255
Metadata
- Authors
- Alber, J., Bodlaender, H. L., Fernau, H., Kloks, T., & Niedermeier, R.
- Venue
- Algorithmica
- Published
- 2002-08-01
- Volume
- 33
- Issue
- 4
- Pages
- 461-493
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W1983156760
- Cited by
- 304
- References
- 13
- FWCI
- 21.63
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.