On the public citation graph

Tight lower bounds for certain parameterized NP-hard problems

0 signed · 47 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.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/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s00453-001-0116-5openalex-snapshot
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
inferredcites →https://doi.org/10.1016/0020-0190(91)90003-zopenalex-snapshot
Characterizing parallel hierarchies by reducibilities
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0168-0072(94)00034-zopenalex-snapshot
Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
inferredcites →https://doi.org/10.1016/0893-6080(94)90082-5openalex-snapshot
The minimum feature set problem
inferredcites →https://doi.org/10.1016/s0022-0000(03)00074-6openalex-snapshot
On the existence of subexponential parameterized algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(03)00075-8openalex-snapshot
Solving large FPT problems on coarse-grained parallel machines
inferredcites →https://doi.org/10.1016/s0022-0000(03)00081-3openalex-snapshot
The k-Feature Set problem is W[2]-complete
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1016/s1571-0661(04)81014-4openalex-snapshot
Cutting Up Is Hard To Do
inferredcites →https://doi.org/10.1089/10665270252935430openalex-snapshot
Finding Motifs Using Random Projections
inferredcites →https://doi.org/10.1109/sfcs.1988.21960openalex-snapshot
Polynomial algorithm for the k-cut problem
inferredcites →https://doi.org/10.1287/moor.19.1.24openalex-snapshot
A Polynomial Algorithm for the k-cut Problem for Fixed k
inferredcites →https://doi.org/10.3929/ethz-a-003882170openalex-snapshot
Algorithms for building multiple sequence alignments and evolutionary trees

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11533719_98openalex-snapshot
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_24openalex-snapshot
On PTAS for Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_30openalex-snapshot
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_1openalex-snapshot
Universality, Tolerance, Chaos and Order
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_32openalex-snapshot
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/s10878-006-7137-6openalex-snapshot
On the computational hardness based on linear FPT-reductions
inferred← citeshttps://doi.org/10.1007/s11390-005-0003-7openalex-snapshot
Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.12.002openalex-snapshot
Length-bounded cuts: Proper interval graphs and structural parameters
inferred← citeshttps://doi.org/10.1016/j.orl.2007.02.008openalex-snapshot
Searching the k-change neighborhood for TSP is W[1]-hard
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.003openalex-snapshot
On miniaturized problems in parameterized complexity theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.007openalex-snapshot
Parameterized graph separation problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.008openalex-snapshot
Parameterized coloring problems on chordal graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxm035openalex-snapshot
Parameterized Complexity and Biopolymer Sequence Comparison
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.2007.69openalex-snapshot
A mobile ad hoc network with mobile satellite earth-stations
inferred← citeshttps://doi.org/10.1109/sfcs.2005.70openalex-snapshot
The Closest Substring problem with small distances
inferred← citeshttps://doi.org/10.1109/tcbb.2008.38openalex-snapshot
A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data
inferred← citeshttps://doi.org/10.1109/tst.2014.6867518openalex-snapshot
Parameterized algorithmics for computational social choice: Nine research challenges
inferred← citeshttps://doi.org/10.1137/100812653openalex-snapshot
Sparse Balanced Partitions and the Complexity of Subgraph Problems
inferred← citeshttps://doi.org/10.1145/1007352.1007391openalex-snapshot
Linear FPT reductions and computational lower bounds
inferred← citeshttps://doi.org/10.1145/1566374.1566424openalex-snapshot
An exact almost optimal algorithm for target set selection in social networks
inferred← citeshttps://doi.org/10.1145/1798596.1798597openalex-snapshot
Finding heaviest H -subgraphs in real weighted graphs, with applications
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.1587/transfun.e98.a.384openalex-snapshot
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth
inferred← citeshttps://doi.org/10.48550/arxiv.1206.2436openalex-snapshot
A Proof Checking View of Parameterized Complexity
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.