On the public citation graph

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

0 signed · 30 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.1002/net.3230010302openalex-snapshot
The steiner problem in graphs
inferredcites →https://doi.org/10.1007/978-3-642-27875-4openalex-snapshot
Sparsity (Graphs, Structures, and Algorithms)
inferredcites →https://doi.org/10.1016/0022-4049(91)90078-gopenalex-snapshot
Classification theory and the number of non-isomorphic models
inferredcites →https://doi.org/10.1016/0097-3165(72)90019-2openalex-snapshot
On the density of families of sets
inferredcites →https://doi.org/10.1016/j.ejc.2006.07.013openalex-snapshot
Grad and classes with bounded expansion I. Decompositions
inferredcites →https://doi.org/10.1016/j.ejc.2006.07.014openalex-snapshot
Grad and classes with bounded expansion II. Algorithmic aspects
inferredcites →https://doi.org/10.1016/j.ejc.2011.01.006openalex-snapshot
On nowhere dense graphs
inferredcites →https://doi.org/10.1016/j.ejc.2013.06.048openalex-snapshot
Interpreting nowhere dense graph classes as a classical notion of model theory
inferredcites →https://doi.org/10.1016/j.jcss.2009.10.005openalex-snapshot
Homomorphism preservation on quasi-wide classes
inferredcites →https://doi.org/10.1016/j.jcss.2016.09.002openalex-snapshot
Kernelization using structural parameters on sparse graph classes
inferredcites →https://doi.org/10.1016/s0095-8956(03)00042-xopenalex-snapshot
Graph Minors. XVI. Excluding a non-planar graph
inferredcites →https://doi.org/10.1090/s0002-9947-2013-05820-5openalex-snapshot
Regularity lemmas for stable graphs
inferredcites →https://doi.org/10.1137/120892234openalex-snapshot
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
inferredcites →https://doi.org/10.1145/2591796.2591851openalex-snapshot
Deciding first-order properties of nowhere dense graphs
inferredcites →https://doi.org/10.1145/990308.990309openalex-snapshot
Polynomial-time data reduction for dominating set
inferredcites →https://doi.org/10.2140/pjm.1972.41.247openalex-snapshot
A combinatorial problem; stability and order for models and theories in infinitary languages
inferredcites →https://doi.org/10.2178/jsl/1278682204openalex-snapshot
First order properties on nowhere dense structures
inferredcites →https://doi.org/10.4064/fm-100-2-101-107openalex-snapshot
Stable graphs
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents

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-031-06678-8_22openalex-snapshot
Harmless Sets in Sparse Classes
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/s00236-025-00490-2openalex-snapshot
Data reduction for directed feedback vertex set on graphs without long induced cycles
inferred← citeshttps://doi.org/10.1016/j.cosrev.2024.100663openalex-snapshot
A survey on the parameterized complexity of reconfiguration problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100855openalex-snapshot
On the generalized coloring numbers
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103747openalex-snapshot
On solution discovery via reconfiguration
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103782openalex-snapshot
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
inferred← citeshttps://doi.org/10.1103/rpl7-ylg8openalex-snapshot
Classical Algorithms for Measurement-Adaptive Gaussian Circuits
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch141openalex-snapshot
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
inferred← citeshttps://doi.org/10.37236/11063openalex-snapshot
Bounds on Half Graph Orders in Powers of Sparse Graphs
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.