On the public citation graph
The complexity of problems concerning graphs with regularities
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10856-4_70openalex-snapshot
The complexity of manipulating hierarchically defined sets of rectangles
inferredcites →https://doi.org/10.1007/bf01683259openalex-snapshot
New problems complete for nondeterministic log space
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/s0022-0000(75)80014-6openalex-snapshot
On tape-bounded complexity classes and multihead finite automata
inferredcites →https://doi.org/10.1016/s0022-0000(75)80050-xopenalex-snapshot
Space-bounded reducibility among combinatorial problems
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11537311_8openalex-snapshot
Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_71openalex-snapshot
Hierarchical planarity testing algorithms
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_50openalex-snapshot
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_13openalex-snapshot
Arithmetic Circuits and Polynomial Replacement Systems
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_59openalex-snapshot
On Reachability in Graphs with Bounded Independence Number
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_47openalex-snapshot
Augmentation problems on hierarchically defined graphs
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_63openalex-snapshot
The complexity of approximating PSPACE-complete problems for hierarchical specifications
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_38openalex-snapshot
Hierarchically specified unit disk graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_30openalex-snapshot
The Complexity of Algorithmic Problems on Succinct Instances
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_11openalex-snapshot
Arithmetic Circuits with Division
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_33openalex-snapshot
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_29openalex-snapshot
A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_23openalex-snapshot
The Complexity of Membership Problems for Circuits over Sets of Integers
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_40openalex-snapshot
Complexity of Linear Connectivity Problems in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_28openalex-snapshot
Easy Problems for Grid-Structured Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_12openalex-snapshot
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_29openalex-snapshot
On the Complexity of Kings
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_15openalex-snapshot
Equivalence Problems for Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_21openalex-snapshot
Satisfiability of Algebraic Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/bf00289117openalex-snapshot
The complexity of combinatorial problems with succinct input representation
inferred← citeshttps://doi.org/10.1007/bf01928922openalex-snapshot
The computational complexity of graph problems with succinct multigraph representation
inferred← citeshttps://doi.org/10.1007/bfb0039598openalex-snapshot
The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems
inferred← citeshttps://doi.org/10.1007/s00224-007-2034-7openalex-snapshot
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/s00224-008-9144-8openalex-snapshot
Equivalence Problems for Circuits over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90004-3openalex-snapshot
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
inferred← citeshttps://doi.org/10.1016/j.dam.2010.04.001openalex-snapshot
Satisfiability of algebraic circuits over sets of natural numbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.017openalex-snapshot
The complexity of membership problems for circuits over sets of integers
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.038openalex-snapshot
Linear connectivity problems in directed hypergraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.001openalex-snapshot
Computational complexity of long paths and cycles in faulty hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.032openalex-snapshot
Parsing Boolean grammars over a one-letter alphabet using online convolution
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.025openalex-snapshot
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80023-1openalex-snapshot
Alternation with restrictions on looping
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80009-2openalex-snapshot
A note on succinct representations of graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00008-4openalex-snapshot
Hierarchically specified unit disk graphs
inferred← citeshttps://doi.org/10.1051/ita/1987210404191openalex-snapshot
The difference and truth-table hierarchies for NP
inferred← citeshttps://doi.org/10.1093/comjnl/bxm052openalex-snapshot
Width Parameters Beyond Tree-width and their Applications
inferred← citeshttps://doi.org/10.1137/s0097539705447013openalex-snapshot
The Complexity of Computing the Size of an Interval
inferred← citeshttps://doi.org/10.1137/s0097539795285254openalex-snapshot
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
inferred← citeshttps://doi.org/10.1145/195058.195233openalex-snapshot
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
inferred← citeshttps://doi.org/10.1145/65950.65952openalex-snapshot
Hierarchical planarity testing algorithms
inferred← citeshttps://doi.org/10.31274/rtd-180813-12666openalex-snapshot
Efficient processing of hierarchical graphs
inferred← citeshttps://doi.org/10.4230/dagsemproc.10501.3openalex-snapshot
Parsing Unary Boolean Grammars Using Online Convolution
inferred← citeshttps://doi.org/10.48550/arxiv.1504.04181openalex-snapshot
Constraint Satisfaction Problems around Skolem Arithmetic
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.