On the public citation graph

Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

0 signed · 40 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.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-03898-8_18openalex-snapshot
A Completeness Theory for Polynomial (Turing) Kernelization
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_46openalex-snapshot
On Problems without Polynomial Kernels (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-540-87531-4_10openalex-snapshot
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_32openalex-snapshot
Incompressibility through Colors and IDs
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_55openalex-snapshot
Preprocessing of Min Ones Problems: A Dichotomy
inferredcites →https://doi.org/10.1007/978-3-642-15155-2_43openalex-snapshot
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s00037-005-0195-9openalex-snapshot
Parameterized complexity of constraint satisfaction problems
inferredcites →https://doi.org/10.1016/j.ipl.2008.11.004openalex-snapshot
Finding paths of length k in time
inferredcites →https://doi.org/10.1016/j.jcss.2008.02.005openalex-snapshot
Structure identification of Boolean relations and plain bases for co-clones
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferredcites →https://doi.org/10.1016/j.jcss.2009.09.002openalex-snapshot
A kernelization algorithm for d-Hitting Set
inferredcites →https://doi.org/10.1016/j.tcs.2011.04.039openalex-snapshot
Kernel bounds for disjoint cycles and disjoint paths
inferredcites →https://doi.org/10.1016/s0304-3975(01)00146-3openalex-snapshot
On the Hamming distance of constraint satisfaction problems
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferredcites →https://doi.org/10.1109/ismvl.2009.10openalex-snapshot
Frozen Boolean Partial Co-clones
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/sfcs.2002.1181990openalex-snapshot
A dichotomy theorem for constraints on a three-element set
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.1137/1.9780898718546openalex-snapshot
Complexity Classifications of Boolean Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1137/s0097539799349948openalex-snapshot
The Approximability of Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems

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-032-11835-6_1openalex-snapshot
Boundaried Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_11openalex-snapshot
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-93800-4_15openalex-snapshot
Binary Solutions to Some Systems of Linear Equations
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.12.001openalex-snapshot
On the parameterized complexity of clustering problems for incomplete data
inferred← citeshttps://doi.org/10.1137/1.9781611973099.6openalex-snapshot
Kernelization of Packing Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch122openalex-snapshot
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
inferred← citeshttps://doi.org/10.1137/23m1553698openalex-snapshot
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints
inferred← citeshttps://doi.org/10.1145/3318464.3389721openalex-snapshot
On Multiple Semantics for Declarative Database Repairs
inferred← citeshttps://doi.org/10.1145/3349618openalex-snapshot
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
inferred← citeshttps://doi.org/10.1145/3389411openalex-snapshot
Sparsification of SAT and CSP Problems via Tractable Extensions
inferred← citeshttps://doi.org/10.1145/3624704openalex-snapshot
Optimal Polynomial-Time Compression for Boolean Max CSP
inferred← citeshttps://doi.org/10.1609/aaai.v35i8.16896openalex-snapshot
The Parameterized Complexity of Clustering Incomplete Data
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.27openalex-snapshot
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
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.