On the public citation graph

Parameterized complexity classes beyond para-NP

0 signed · 56 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1999.1691openalex-snapshot
The Closure of Monadic NP
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/11564751_73openalex-snapshot
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-09284-3_8openalex-snapshot
Fixed-Parameter Tractable Reductions to SAT
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_44openalex-snapshot
Linear Completeness Thresholds for Bounded Model Checking
inferredcites →https://doi.org/10.1007/978-3-642-60085-2_17openalex-snapshot
Stable Models and an Alternative Logic Programming Paradigm
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/978-3-662-46078-8_18openalex-snapshot
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(76)90062-1openalex-snapshot
Complete sets and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/j.artint.2012.07.006openalex-snapshot
On minimal constraint networks
inferredcites →https://doi.org/10.1016/j.jet.2006.04.008openalex-snapshot
The structure of strategy-proof social choice — Part I: General characterization and possibility results on median spaces
inferredcites →https://doi.org/10.1016/s0004-3702(02)00182-0openalex-snapshot
Fixed-parameter complexity in AI and nonmonotonic reasoning
inferredcites →https://doi.org/10.1016/s0890-5401(03)00161-5openalex-snapshot
Describing parameterized complexity classes
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1016/s1574-6526(07)x0300-6openalex-snapshot
Handbook of Knowledge Representation
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
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/1536616.1536637openalex-snapshot
Boolean satisfiability from theoretical hardness to practical success
inferredcites →https://doi.org/10.1145/200836.200838openalex-snapshot
The complexity of logic-based abduction
inferredcites →https://doi.org/10.1145/2043174.2043195openalex-snapshot
Answer set programming at a glance
inferredcites →https://doi.org/10.1145/230514.571645openalex-snapshot
Introduction to the Theory of Computation
inferredcites →https://doi.org/10.1145/582475.582484openalex-snapshot
SIGACT news complexity theory comun 37
inferredcites →https://doi.org/10.14288/1.0043924openalex-snapshot
Anatomy and Empirical Evaluation of Modern SAT Solvers
inferredcites →https://doi.org/10.1613/jair.3708openalex-snapshot
Complexity of Judgment Aggregation
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-131openalex-snapshot
Conflict-Driven Clause Learning SAT Solvers
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-457openalex-snapshot
Bounded Model Checking
inferredcites →https://doi.org/10.3233/faia336openalex-snapshot
Handbook of Satisfiability
inferredcites →https://doi.org/10.48550/arxiv.1301.1391openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferredcites →https://doi.org/10.48550/arxiv.1304.5961openalex-snapshot
Backdoors to Abduction
inferredcites →https://doi.org/10.48550/arxiv.1312.1672openalex-snapshot
The Parameterized Complexity of Reasoning Problems Beyond NP
inferredcites →https://doi.org/10.5860/choice.46-0942openalex-snapshot
Computational complexity: a conceptual perspective
inferredcites →https://doi.org/10.65109/fmhb6910openalex-snapshot
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_19openalex-snapshot
Reconstructing Sets of Strings from Their k-Way Projections: Algorithms & Complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_9openalex-snapshot
Parameterized Complexity of Some Prefix-Vocabulary Fragments of First-Order Logic
inferred← citeshttps://doi.org/10.1007/s00224-025-10233-yopenalex-snapshot
Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106229openalex-snapshot
The complexity of finding temporal separators under waiting time constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116157openalex-snapshot
On kernelization with access to NP-oracles
inferred← citeshttps://doi.org/10.1145/3292006.3300038openalex-snapshot
Results in Workflow Resiliency
inferred← citeshttps://doi.org/10.1613/jair.1.11864openalex-snapshot
The Parameterized Complexity of Motion Planning for Snake-Like Robots
inferred← citeshttps://doi.org/10.2139/ssrn.5083035openalex-snapshot
The GOOGLE and XPRIZE award for how to use quantum computers practically: The problem of the "P" versus "NP" outputs of any quantum computer and the pathway for its resolving
inferred← citeshttps://doi.org/10.3390/a12090188openalex-snapshot
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03852openalex-snapshot
A Parameterized Complexity View on Description Logic Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.1809.10106openalex-snapshot
Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding
inferred← citeshttps://doi.org/10.70675/5842ba53z380ez4b64z9aeczdee2a5b2e32fopenalex-snapshot
Fine-Grained and Parameterized Complexity of Graph Coloring Problems
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.