On the public citation graph

Co-Nondeterminism in Compositions

0 signed · 67 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/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-22993-0_45openalex-snapshot
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem
inferredcites →https://doi.org/10.1007/978-3-642-31155-0_32openalex-snapshot
Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs
inferredcites →https://doi.org/10.1016/0097-3165(75)90071-0openalex-snapshot
Ramsey's theorem—A new lower bound
inferredcites →https://doi.org/10.1016/0304-3975(83)90020-8openalex-snapshot
Some consequences of non-uniform conditions on uniform classes
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.2010.06.007openalex-snapshot
Infeasibility of instance compression and succinct PCPs for NP
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)00414-5openalex-snapshot
Parameterized complexity of finding subgraphs with hereditary properties
inferredcites →https://doi.org/10.1109/focs.2009.46openalex-snapshot
(Meta) Kernelization
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
inferredcites →https://doi.org/10.1137/060668092openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
inferredcites →https://doi.org/10.1137/1.9781611973075.43openalex-snapshot
Bidimensionality and Kernels
inferredcites →https://doi.org/10.1137/1.9781611973099openalex-snapshot
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/1.9781611973099.6openalex-snapshot
Kernelization of Packing Problems
inferredcites →https://doi.org/10.1137/1.9781611973099.9openalex-snapshot
Weak Compositions and Their Applications to Polynomial Lower Bounds for Kernelization
inferredcites →https://doi.org/10.1145/1132516.1132611openalex-snapshot
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
inferredcites →https://doi.org/10.1145/1233481.1233493openalex-snapshot
Invitation to data reduction and problem kernelization
inferredcites →https://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferredcites →https://doi.org/10.1145/1806689.1806725openalex-snapshot
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
inferredcites →https://doi.org/10.4007/annals.2009.170.941openalex-snapshot
A new upper bound for diagonal Ramsey numbers
inferredcites →https://doi.org/10.4230/lipics.stacs.2009.1843openalex-snapshot
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
inferredcites →https://doi.org/10.48550/arxiv.1011.4224openalex-snapshot
Cross-Composition: A New Technique for Kernelization Lower Bounds
inferredcites →https://doi.org/10.5555/1873601.1873644openalex-snapshot
Bidimensionality and kernels

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-030-42071-0_3openalex-snapshot
Hans Bodlaender and the Theory of Kernelization Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_1openalex-snapshot
Lower Bounds for Kernelization
inferred← citeshttps://doi.org/10.1007/s00453-016-0189-9openalex-snapshot
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
inferred← citeshttps://doi.org/10.1007/s00453-022-01088-7openalex-snapshot
Essentially Tight Kernels for (Weakly) Closed Graphs
inferred← citeshttps://doi.org/10.1017/9781107415157openalex-snapshot
Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781107415157.002openalex-snapshot
Acknowledgements
inferred← citeshttps://doi.org/10.1017/9781107415157.003openalex-snapshot
What Is a Kernel?
inferred← citeshttps://doi.org/10.1017/9781107415157.004openalex-snapshot
Warm Up
inferred← citeshttps://doi.org/10.1017/9781107415157.005openalex-snapshot
Inductive Priorities
inferred← citeshttps://doi.org/10.1017/9781107415157.006openalex-snapshot
Crown Decomposition
inferred← citeshttps://doi.org/10.1017/9781107415157.007openalex-snapshot
Expansion Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.008openalex-snapshot
Linear Programming
inferred← citeshttps://doi.org/10.1017/9781107415157.009openalex-snapshot
Hypertrees
inferred← citeshttps://doi.org/10.1017/9781107415157.010openalex-snapshot
Sunflower Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.011openalex-snapshot
Modules
inferred← citeshttps://doi.org/10.1017/9781107415157.012openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1017/9781107415157.013openalex-snapshot
Representative Families
inferred← citeshttps://doi.org/10.1017/9781107415157.014openalex-snapshot
Greedy Packing
inferred← citeshttps://doi.org/10.1017/9781107415157.015openalex-snapshot
Euler–s Formula
inferred← citeshttps://doi.org/10.1017/9781107415157.016openalex-snapshot
Introduction to Treewidth
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.018openalex-snapshot
Surgery on Graphs
inferred← citeshttps://doi.org/10.1017/9781107415157.019openalex-snapshot
Framework
inferred← citeshttps://doi.org/10.1017/9781107415157.020openalex-snapshot
Instance Selectors
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1017/9781107415157.022openalex-snapshot
Polynomial Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781107415157.023openalex-snapshot
Extending Distillation
inferred← citeshttps://doi.org/10.1017/9781107415157.024openalex-snapshot
Turing Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.025openalex-snapshot
Lossy Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.026openalex-snapshot
Open Problems
inferred← citeshttps://doi.org/10.1017/9781107415157.027openalex-snapshot
Graphs and SAT Notation
inferred← citeshttps://doi.org/10.1017/9781107415157.028openalex-snapshot
Problem Definitions
inferred← citeshttps://doi.org/10.1017/9781107415157.029openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1017/9781107415157.030openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1109/focs.2012.71openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferred← citeshttps://doi.org/10.1142/s0129054121500027openalex-snapshot
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms
inferred← citeshttps://doi.org/10.1145/2635820openalex-snapshot
FPT is characterized by useful obstruction sets
inferred← citeshttps://doi.org/10.1145/2832912openalex-snapshot
Point Line Cover
inferred← citeshttps://doi.org/10.1145/3108239openalex-snapshot
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
inferred← citeshttps://doi.org/10.48550/arxiv.1609.05472openalex-snapshot
Frameworks for Solving Turing Kernel Lower Bound Problem and Finding Natural Candidate Problems in NP-intermediate
inferred← citeshttps://doi.org/10.5555/2722129.2722171openalex-snapshot
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
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.