The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Applications of a Planar Separator Theorem
Abstract
Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only $O(\sqrt n )$ vertices. This separator theorem, in combination with a divide-and-conquer strategy, leads to many new complexity results for planar graph problems. This paper describes some of these results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Self-citationNested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
Lipton, R. J., Rose, D. J., & Tarjan, R. E. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716027 · Cited by 560
Self-citationGraph-theoretic arguments in low-level complexity
Valiant, L. G. (1977) · Lecture Notes in Computer Science · doi:10.1007/3-540-08353-7_135 · Cited by 312
Triangulating a simple polygon
Garey, M. R., Johnson, D. S., Preparata, F. P., & Tarjan, R. E. (1978) · Information Processing Letters · doi:10.1016/0020-0190(78)90062-5 · Cited by 296
Self-citationHopcroft, J., Paul, W., & Valiant, L. (1977) · Journal of the ACM · doi:10.1145/322003.322015 · Cited by 253
Multidimensional Searching Problems
Dobkin, D., & Lipton, R. J. (1976) · SIAM Journal on Computing · doi:10.1137/0205015 · Cited by 248
Self-citationOn non-serial dynamic programming
Bertelè, U., & Brioschi, F. (1973) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(73)90016-2 · Cited by 229
Complete Register Allocation Problems
Sethi, R. (1975) · SIAM Journal on Computing · doi:10.1137/0204020 · Cited by 201
Computers and Mathematics with Applications
Hawkins, D. M. (1976) · Computers & Geosciences · doi:10.1016/0098-3004(76)90046-7 · Cited by 200
Cited by
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Survey of Vector Database Management Systems
Pan, J. J., Wang, J., & Li, G. (2023) · arXiv · doi:10.48550/arxiv.2310.14021 · Cited by 184
Metadata
- Authors
- Lipton, R. J., & Tarjan, R. E.
- Venue
- SIAM Journal on Computing
- Published
- 1980-08
- Volume
- 9
- Issue
- 3
- Pages
- 615-627
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1982180670
- Cited by
- 640
- References
- 14
- FWCI
- 15.75
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Applications of a Planar Separator Theorem. https://app.cochat.ai/papers/10.1137/0209046
- The paper
- Lipton, R. J., & Tarjan, R. E. (1980). Applications of a Planar Separator Theorem. SIAM Journal on Computing. https://doi.org/10.1137/0209046
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.
