On the public citation graph
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
0 signed · 210 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.10068openalex-snapshot
Simple analysis of graph tests for linearity and PCP
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/3-540-18170-9_185openalex-snapshot
The complexity of symmetric boolean functions
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-0-387-68361-4_9openalex-snapshot
A Note on Elkin’s Improvement of Behrend’s Construction
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
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/s00224-010-9270-yopenalex-snapshot
Lower Bounds for Kernelizations and Other Preprocessing Procedures
inferredcites →https://doi.org/10.1007/s00493-007-2160-5openalex-snapshot
Complexity measures of sign matrices
inferredcites →https://doi.org/10.1007/s004930070001openalex-snapshot
Efficient Testing of Large Graphs
inferredcites →https://doi.org/10.1016/0022-0000(80)90060-4openalex-snapshot
The node-deletion problem for hereditary properties is NP-complete
inferredcites →https://doi.org/10.1016/0022-0000(83)90013-2openalex-snapshot
On self-reducibility and weak P-selectivity
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.cosrev.2007.09.001openalex-snapshot
Invitation to fixed-parameter algorithms
inferredcites →https://doi.org/10.1016/j.disopt.2013.02.001openalex-snapshot
Two edge modification problems without polynomial kernels
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.008openalex-snapshot
Testing subgraphs in directed graphs
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.jcss.2010.12.001openalex-snapshot
A generalization of Nemhauser and Trotterʼs local optimization theorem
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.1017/s0308210511001648openalex-snapshot
Improved bound for complexity of matrix multiplication
inferredcites →https://doi.org/10.1017/s0963548306007759openalex-snapshot
A Characterization of Easily Testable Induced Subgraphs
inferredcites →https://doi.org/10.1017/s0963548307008644openalex-snapshot
A Note on Freĭman's Theorem in Vector Spaces
inferredcites →https://doi.org/10.1017/s0963548309009821openalex-snapshot
Freiman's Theorem in Finite Fields via Extremal Set Theory
inferredcites →https://doi.org/10.1073/pnas.28.12.561openalex-snapshot
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
inferredcites →https://doi.org/10.1073/pnas.32.12.331openalex-snapshot
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
inferredcites →https://doi.org/10.1090/s0894-0347-04-00464-3openalex-snapshot
The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
inferredcites →https://doi.org/10.1090/s0894-0347-99-00305-7openalex-snapshot
Sharp thresholds of graph properties, and the $k$-sat problem
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1109/ccc.2006.6openalex-snapshot
A Duality between Clause Width and Clause Density for SAT
inferredcites →https://doi.org/10.1109/ccc.2008.21openalex-snapshot
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly
inferredcites →https://doi.org/10.1109/focs.2012.71openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.1137/060668092openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
inferredcites →https://doi.org/10.1137/07067917xopenalex-snapshot
Testing Triangle-Freeness in General Graphs
inferredcites →https://doi.org/10.1137/1.9780898715859openalex-snapshot
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/s0097539703434231openalex-snapshot
Random k ‐SAT: Two Moments Suffice to Cross a Sharp Threshold
inferredcites →https://doi.org/10.1142/s0129054195000214openalex-snapshot
NONDETERMINISTICALLY SELECTIVE SETS
inferredcites →https://doi.org/10.1145/1132516.1132553openalex-snapshot
The PCP theorem by gap amplification
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/2213977.2214056openalex-snapshot
Multiplying matrices faster than coppersmith-winograd
inferredcites →https://doi.org/10.1145/2344422.2344428openalex-snapshot
Kernel(s) for problems with no kernel
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/780542.780577openalex-snapshot
The threshold for random k-SAT is 2 k (ln 2 - O(k))
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.5860/choice.46-0942openalex-snapshot
Computational complexity: a conceptual perspective
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-17402-6_1openalex-snapshot
Quadratic Vertex Kernel for Split Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_30openalex-snapshot
Subset Feedback Vertex Set in Chordal and Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_41openalex-snapshot
Lower Bounds for the Happy Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_9openalex-snapshot
A Turing Kernelization Dichotomy for Structural Parameterizations of $$\mathcal {F}$$ -Minor-Free Deletion
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_16openalex-snapshot
A Retrospective on (Meta) Kernelization
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-030-42071-0_8openalex-snapshot
Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_16openalex-snapshot
A Multistage View on 2-Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_1openalex-snapshot
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_4openalex-snapshot
On Fair Covering and Hitting Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_12openalex-snapshot
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_13openalex-snapshot
Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_24openalex-snapshot
Polynomial Kernels with Reachability for Weighted d-Matroid Intersection
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_16openalex-snapshot
AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_18openalex-snapshot
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-18263-6_13openalex-snapshot
The Minimum Feasible Tileset Problem
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-98355-4_19openalex-snapshot
What Is Known About Vertex Cover Kernelization?
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_65openalex-snapshot
A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_38openalex-snapshot
On a Generalization of Nemhauser and Trotter’s Local Optimization Theorem
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_33openalex-snapshot
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
inferred← citeshttps://doi.org/10.1007/978-3-662-53536-3_15openalex-snapshot
Vertex Cover Structural Parameterization Revisited
inferred← citeshttps://doi.org/10.1007/s00037-016-0128-9openalex-snapshot
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions
inferred← citeshttps://doi.org/10.1007/s00224-017-9805-6openalex-snapshot
A Randomized Polynomial Kernel for Subset Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/s00224-018-9858-1openalex-snapshot
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators
inferred← citeshttps://doi.org/10.1007/s00224-022-10076-xopenalex-snapshot
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00236-025-00490-2openalex-snapshot
Data reduction for directed feedback vertex set on graphs without long induced cycles
inferred← citeshttps://doi.org/10.1007/s00236-025-00498-8openalex-snapshot
Parameterized lower bounds for the weighted vertex cover problem in trees
inferred← citeshttps://doi.org/10.1007/s00453-015-0110-yopenalex-snapshot
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
inferred← citeshttps://doi.org/10.1007/s00453-015-9986-9openalex-snapshot
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
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-017-0315-3openalex-snapshot
Approximability of Clique Transversal in Perfect Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0419-4openalex-snapshot
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization
inferred← citeshttps://doi.org/10.1007/s00453-018-0431-8openalex-snapshot
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00578-5openalex-snapshot
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
inferred← citeshttps://doi.org/10.1007/s00453-019-00590-9openalex-snapshot
Subset Feedback Vertex Set in Chordal and Split Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00660-yopenalex-snapshot
Best-Case and Worst-Case Sparsifiability of Boolean CSPs
inferred← citeshttps://doi.org/10.1007/s00453-020-00708-4openalex-snapshot
On the Approximate Compressibility of Connected Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00453-022-00979-zopenalex-snapshot
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00453-022-00984-2openalex-snapshot
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
inferred← citeshttps://doi.org/10.1007/s00453-022-00986-0openalex-snapshot
Dynamic Kernels for Hitting Sets and Set Packing
inferred← citeshttps://doi.org/10.1007/s00453-022-01040-9openalex-snapshot
A Polynomial Kernel for Bipartite Permutation Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-024-01246-zopenalex-snapshot
Parameterized Complexity of Streaming Diameter and Connectivity Problems
inferred← citeshttps://doi.org/10.1007/s11432-023-4080-3openalex-snapshot
On optimal streaming kernelization algorithms
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
inferred← citeshttps://doi.org/10.1016/j.dam.2023.12.016openalex-snapshot
Kernelization for feedback vertex set via elimination distance to a forest
inferred← citeshttps://doi.org/10.1016/j.dam.2025.03.023openalex-snapshot
Preprocessing complexity for some graph problems parameterized by structural parameters
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.008openalex-snapshot
Kernelization of compressing two-dimensional routing tables with order
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105998openalex-snapshot
Optimal-size problem kernels for d-Hitting Set in linear time and space
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.12.002openalex-snapshot
On polynomial kernels for sparse integer linear programs
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.08.003openalex-snapshot
On a generalization of Nemhauser and Trotter's local optimization theorem
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.10.008openalex-snapshot
Turing kernelization for finding long paths and cycles in restricted graph classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.07.008openalex-snapshot
Kernels for deletion to classes of acyclic digraphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.005openalex-snapshot
A Turing kernelization dichotomy for structural parameterizations of F -Minor-Free Deletion
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.103479openalex-snapshot
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103532openalex-snapshot
Preprocessing to reduce the search space: Antler structures for feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103574openalex-snapshot
Minimum separator reconfiguration
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103757openalex-snapshot
Kernelization for orthogonality dimension
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103861openalex-snapshot
A refined kernel for d-Hitting Set
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.222openalex-snapshot
Preprocessing complexity for some graph problems parameterized by structural parameters
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.031openalex-snapshot
A 13k-kernel for planar feedback vertex set via region decomposition
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.024openalex-snapshot
On the kernelization complexity of string problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.018openalex-snapshot
Kernels for packing and covering problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.001openalex-snapshot
Quadratic vertex kernel for split vertex deletion
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.009openalex-snapshot
Polynomial kernels for hitting forbidden minors under structural parameterizations
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.10.022openalex-snapshot
Sparsification lower bound for linear spanners in directed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.017openalex-snapshot
On some FPT problems without polynomial Turing compressions
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114326openalex-snapshot
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116157openalex-snapshot
On kernelization with access to NP-oracles
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00138openalex-snapshot
Why we couldn’t prove SETH hardness of the Closest Vector Problem for even norms!
inferred← citeshttps://doi.org/10.1137/1.9781611973099.6openalex-snapshot
Kernelization of Packing Problems
inferred← citeshttps://doi.org/10.1137/1.9781611973730.82openalex-snapshot
Parameterized Streaming: Maximal Matching and Vertex Cover
inferred← citeshttps://doi.org/10.1137/1.9781611975031.23openalex-snapshot
Subquadratic Kernels for Implicit 3-H itting S et and 3-S et P acking Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch139openalex-snapshot
Kernelization for Graph Packing Problems via Rainbow Matching
inferred← citeshttps://doi.org/10.1137/130947076openalex-snapshot
Known Algorithms for Edge Clique Cover are Probably Optimal
inferred← citeshttps://doi.org/10.1137/16m1088740openalex-snapshot
Fractals for Kernelization Lower Bounds
inferred← citeshttps://doi.org/10.1137/16m1100794openalex-snapshot
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
inferred← citeshttps://doi.org/10.1137/16m1104585openalex-snapshot
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
inferred← citeshttps://doi.org/10.1137/17m112035xopenalex-snapshot
Approximation and Kernelization for Chordal Vertex Deletion
inferred← citeshttps://doi.org/10.1137/17m1136614openalex-snapshot
Kernelization of Cycle Packing with Relaxed Disjointness Constraints
inferred← citeshttps://doi.org/10.1137/17m1154370openalex-snapshot
Rank Vertex Cover as a Natural Problem for Algebraic Compression
inferred← citeshttps://doi.org/10.1137/20m1335285openalex-snapshot
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
inferred← citeshttps://doi.org/10.1137/20m1353782openalex-snapshot
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
inferred← citeshttps://doi.org/10.1137/21m1400766openalex-snapshot
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
inferred← citeshttps://doi.org/10.1137/21m1449476openalex-snapshot
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
inferred← citeshttps://doi.org/10.1137/23m1589347openalex-snapshot
Search-Space Reduction via Essential Vertices
inferred← citeshttps://doi.org/10.1142/s021819591750008xopenalex-snapshot
Finding Points in General Position
inferred← citeshttps://doi.org/10.1145/1806689.1806725openalex-snapshot
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
inferred← citeshttps://doi.org/10.1145/3029051openalex-snapshot
Uniform Kernelization Complexity of Hitting Forbidden Minors
inferred← citeshttps://doi.org/10.1145/3108239openalex-snapshot
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
inferred← citeshttps://doi.org/10.1145/3155298openalex-snapshot
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
inferred← citeshttps://doi.org/10.1145/3284356openalex-snapshot
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
inferred← citeshttps://doi.org/10.1145/3293466openalex-snapshot
Subquadratic Kernels for Implicit 3-H itting S et and 3-S et P acking Problems
inferred← citeshttps://doi.org/10.1145/3349618openalex-snapshot
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
inferred← citeshttps://doi.org/10.1145/3357713.3384275openalex-snapshot
All non-trivial variants of 3-LDT are equivalent
inferred← citeshttps://doi.org/10.1145/3389411openalex-snapshot
Sparsification of SAT and CSP Problems via Tractable Extensions
inferred← citeshttps://doi.org/10.1145/3390887openalex-snapshot
Representative Sets and Irrelevant Vertices
inferred← citeshttps://doi.org/10.1145/3395037openalex-snapshot
Dynamic Parameterized Problems and Algorithms
inferred← citeshttps://doi.org/10.1145/3439801openalex-snapshot
Data Reduction for Maximum Matching on Real-World Graphs
inferred← citeshttps://doi.org/10.1145/3571075openalex-snapshot
Polynomial Kernel for Interval Vertex Deletion
inferred← citeshttps://doi.org/10.1145/3612938openalex-snapshot
Sparsification Lower Bounds for List H -Coloring
inferred← citeshttps://doi.org/10.1145/3624704openalex-snapshot
Optimal Polynomial-Time Compression for Boolean Max CSP
inferred← citeshttps://doi.org/10.1145/3774904.3792250openalex-snapshot
Sustained Vertex Cover on Temporal Graphs
inferred← citeshttps://doi.org/10.1287/opre.2019.1970openalex-snapshot
Why Is Maximum Clique Often Easy in Practice?
inferred← citeshttps://doi.org/10.14279/depositonce-4131openalex-snapshot
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
inferred← citeshttps://doi.org/10.2139/ssrn.6174521openalex-snapshot
Kernelization for list H-coloring for graphs with small vertex cover
inferred← citeshttps://doi.org/10.2139/ssrn.6854324openalex-snapshot
Kernelization for Graph Packing and Hitting Problems via Rainbow Matching
inferred← citeshttps://doi.org/10.3384/diss.diva-122827openalex-snapshot
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
inferred← citeshttps://doi.org/10.3390/a16030144openalex-snapshot
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
inferred← citeshttps://doi.org/10.4230/lipics.esa.2018.53openalex-snapshot
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.32openalex-snapshot
Faster FPT Algorithm for 5-Path Vertex Cover
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.36openalex-snapshot
On Kernelization for Edge Dominating Set under Structural Parameters
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02821openalex-snapshot
Positive 1-in-3-SAT admits a non-trivial Kernel
inferred← citeshttps://doi.org/10.48550/arxiv.1811.09429openalex-snapshot
What is known about Vertex Cover Kernelization?
inferred← citeshttps://doi.org/10.48550/arxiv.2005.03986openalex-snapshot
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03279openalex-snapshot
Polynomial Turing Kernels for Clique with an Optimal Number of Queries
inferred← citeshttps://doi.org/10.7155/jgaa.00413openalex-snapshot
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
inferred← citeshttps://doi.org/10.7916/d8zp45ktopenalex-snapshot
Unconditional Lower Bounds in Complexity Theory
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.