On the public citation graph

W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications

https://doi.org/10.1007/11533719_98
0 signed · 32 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/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1006/jcss.1996.0058openalex-snapshot
On Limited Nondeterminism and the Complexity of the V-C Dimension
inferredcites →https://doi.org/10.1006/jcss.1997.1490openalex-snapshot
On Fixed-Parameter Tractability and Approximability of NP Optimization Problems
inferredcites →https://doi.org/10.1006/jcss.1999.1626openalex-snapshot
On the Complexity of Database Queries
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/11533719_98openalex-snapshot
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/s0020-0190(97)00164-6openalex-snapshot
On the efficiency of polynomial time approximation schemes
inferredcites →https://doi.org/10.1016/s0022-0000(03)00078-3openalex-snapshot
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
inferredcites →https://doi.org/10.1016/s0304-3975(01)00343-7openalex-snapshot
The inapproximability of non-NP-hard optimization problems
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1109/ccc.2004.1313826openalex-snapshot
Tight lower bounds for certain parameterized NP-hard problems
inferredcites →https://doi.org/10.1109/ccc.2004.37openalex-snapshot
Tight lower bounds for certain parameterized NP-hard problems
inferredcites →https://doi.org/10.1109/lics.2004.1319633openalex-snapshot
Model-checking problems as a basis for parameterized intractability
inferredcites →https://doi.org/10.1109/lics.2004.25openalex-snapshot
Model-checking problems as a basis for parameterized intractability
inferredcites →https://doi.org/10.1145/1007352.1007391openalex-snapshot
Linear FPT reductions and computational lower bounds
inferredcites →https://doi.org/10.1145/375551.375564openalex-snapshot
The parameterized complexity of database queries

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470892107.ch2openalex-snapshot
Efficient Restricted‐Case Algorithms for Problems in Computational Biology
inferred← citeshttps://doi.org/10.1007/11809678_16openalex-snapshot
Lower Bounds and Parameterized Approach for Longest Common Subsequence
inferred← citeshttps://doi.org/10.1007/978-3-030-48516-0_6openalex-snapshot
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_31openalex-snapshot
A Lower Bound on Approximation Algorithms for the Closest Substring Problem
inferred← citeshttps://doi.org/10.1007/s00453-008-9223-xopenalex-snapshot
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.001openalex-snapshot
Tight lower bounds for certain parameterized NP-hard problems
inferred← citeshttps://doi.org/10.1109/ccc.2004.37openalex-snapshot
Tight lower bounds for certain parameterized NP-hard problems
inferred← citeshttps://doi.org/10.1109/imsccs.2006.84openalex-snapshot
Maximum Common Subgraph: Upper Bound and Lower Bound Results
inferred← citeshttps://doi.org/10.1109/imsccs.2008.26openalex-snapshot
Addressing Bio-sequence and Bio-structure Problems
inferred← citeshttps://doi.org/10.1186/1471-2105-7-s4-s6openalex-snapshot
Maximum common subgraph: some upper bound and lower bound results
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4433openalex-snapshot
Arc-preserving subsequences of arc-annotated sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1507.07459openalex-snapshot
On local search and LP and SDP relaxations for k-Set Packing
showing the first 12 of 13 · page through all 13
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.