On the public citation graph
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
0 signed · 75 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.1006/inco.2000.2958openalex-snapshot
Reduction Algorithms for Graphs of Small Treewidth
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-3-540-68891-4_4openalex-snapshot
The Induced Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/978-3-540-92248-3_18openalex-snapshot
Parameterized Complexity for Domination Problems on Degenerate Graphs
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_27openalex-snapshot
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_51openalex-snapshot
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
inferredcites →https://doi.org/10.1007/978-3-642-11269-0_20openalex-snapshot
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_10openalex-snapshot
Tight Bounds for Linkages in Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_17openalex-snapshot
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
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.1007/s00453-008-9204-0openalex-snapshot
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
inferredcites →https://doi.org/10.1007/s00493-003-0037-9openalex-snapshot
Local Tree-Width, Excluded Minors, and Approximation Algorithms
inferredcites →https://doi.org/10.1016/j.dam.2012.05.016openalex-snapshot
Kernelization hardness of connectivity problems in d -degenerate graphs
inferredcites →https://doi.org/10.1016/j.ejc.2012.12.004openalex-snapshot
Constant-factor approximation of the domination number in sparse graphs
inferredcites →https://doi.org/10.1016/j.ic.2013.11.006openalex-snapshot
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
inferredcites →https://doi.org/10.1016/j.ic.2014.12.008openalex-snapshot
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferredcites →https://doi.org/10.1016/j.jctb.2011.02.008openalex-snapshot
Contraction obstructions for treewidth
inferredcites →https://doi.org/10.1016/j.jctb.2016.10.001openalex-snapshot
Irrelevant vertices for the planar Disjoint Paths Problem
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.1016/s0304-0208(08)73549-7openalex-snapshot
On Hadwiger's Number and the Stability Number
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1090/s0894-0347-1990-1065053-0openalex-snapshot
A Separator Theorem for Nonplanar Graphs
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0001openalex-snapshot
INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferredcites →https://doi.org/10.1093/comjnl/bxm033openalex-snapshot
The Bidimensionality Theory and Its Algorithmic Applications
inferredcites →https://doi.org/10.1109/focs.2012.71openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1109/sfcs.1989.63528openalex-snapshot
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
inferredcites →https://doi.org/10.1137/05064299xopenalex-snapshot
Improved Approximation Algorithms for Minimum Weight Vertex Separators
inferredcites →https://doi.org/10.1137/050646354openalex-snapshot
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/120892234openalex-snapshot
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
inferredcites →https://doi.org/10.1137/140997889openalex-snapshot
Hitting Forbidden Minors: Approximation and Kernelization
inferredcites →https://doi.org/10.1137/s0097539702419649openalex-snapshot
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
inferredcites →https://doi.org/10.1137/s0097539795289859openalex-snapshot
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
inferredcites →https://doi.org/10.1145/1077464.1077468openalex-snapshot
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
inferredcites →https://doi.org/10.1145/1101821.1101823openalex-snapshot
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
inferredcites →https://doi.org/10.1145/1250790.1250801openalex-snapshot
Fourier meets möbius: fast subset convolution
inferredcites →https://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
inferredcites →https://doi.org/10.1145/2390176.2390187openalex-snapshot
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
inferredcites →https://doi.org/10.1145/2629620openalex-snapshot
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1145/2797140openalex-snapshot
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
inferredcites →https://doi.org/10.1145/3108239openalex-snapshot
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
inferredcites →https://doi.org/10.1145/990308.990309openalex-snapshot
Polynomial-time data reduction for dominating set
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.4230/lipics.stacs.2013.92openalex-snapshot
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
inferredcites →https://doi.org/10.4230/lipics.stacs.2016.0openalex-snapshot
Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.48550/arxiv.1209.0129openalex-snapshot
A stronger structure theorem for excluded topological minors
inferredcites →https://doi.org/10.5555/1070432.1070514openalex-snapshot
Bidimensionality: new connections between FPT algorithms and PTASs
inferredcites →https://doi.org/10.5555/1496770.1496894openalex-snapshot
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
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_16openalex-snapshot
A Retrospective on (Meta) Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_16openalex-snapshot
On the Parameterized Complexity of the Expected Coverage Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_1openalex-snapshot
On the Parameterized Complexity of Connected Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00224-022-10073-0openalex-snapshot
On the Parameterized Complexity of the Expected Coverage Problem
inferred← citeshttps://doi.org/10.1007/s00453-016-0231-yopenalex-snapshot
On Kernelization and Approximation for the Vector Connectivity Problem
inferred← citeshttps://doi.org/10.1007/s00453-022-00965-5openalex-snapshot
Twin-width and Polynomial Kernels
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.045openalex-snapshot
A linear kernel for planar red–blue dominating set
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103309openalex-snapshot
Kernelization and approximation of distance- r independent sets on nowhere dense graphs
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.1016/j.physa.2019.123340openalex-snapshot
Identification of key nodes and vital edges in aviation network based on minimum connected dominating set
inferred← citeshttps://doi.org/10.1137/1.9781611973075.43openalex-snapshot
Bidimensionality and Kernels
inferred← citeshttps://doi.org/10.1137/1.9781611977073.79openalex-snapshot
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
inferred← citeshttps://doi.org/10.1137/22m1491721openalex-snapshot
Further Exploiting c -Closure for FPT Algorithms and Kernels for Domination Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1809.05675openalex-snapshot
Kernelization and approximation of distance-$r$ independent sets on nowhere dense 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.