On the public citation graph
The parameterised complexity of counting connected subgraphs and graph motifs
0 signed · 60 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.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-36136-7_40openalex-snapshot
Approximation Algorithms for Some Parameterized Counting Problems
inferredcites →https://doi.org/10.1007/978-3-540-69068-9_6openalex-snapshot
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_48openalex-snapshot
Understanding the Complexity of Induced Subgraph Isomorphisms
inferredcites →https://doi.org/10.1007/bf00531932openalex-snapshot
On the foundations of combinatorial theory I. Theory of M�bius Functions
inferredcites →https://doi.org/10.1007/s00453-011-9600-8openalex-snapshot
Finding and Counting Vertex-Colored Subtrees
inferredcites →https://doi.org/10.1016/0024-3795(95)00349-5openalex-snapshot
On meet matrices on posets
inferredcites →https://doi.org/10.1016/j.apal.2005.06.010openalex-snapshot
Parameterized counting problems
inferredcites →https://doi.org/10.1016/j.jcss.2010.07.003openalex-snapshot
Upper and lower bounds for finding connected motifs in vertex-colored graphs
inferredcites →https://doi.org/10.1016/j.tcs.2004.08.008openalex-snapshot
The complexity of counting homomorphisms seen from the other side
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
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/ccc.2007.21openalex-snapshot
On Parameterized Path and Chordless Path Problems
inferredcites →https://doi.org/10.1109/sfcs.1983.35openalex-snapshot
Monte-Carlo algorithms for enumeration and reliability problems
inferredcites →https://doi.org/10.1109/tcbb.2006.55openalex-snapshot
Motif Search in Graphs: Application to Metabolic Networks
inferredcites →https://doi.org/10.1137/s0097539703427203openalex-snapshot
The Parameterized Complexity of Counting Problems
inferredcites →https://doi.org/10.1142/9789812770998_0007openalex-snapshot
WEAK PATTERN MATCHING IN COLORED GRAPHS: MINIMIZING THE NUMBER OF CONNECTED COMPONENTS
inferredcites →https://doi.org/10.1155/2009/616234openalex-snapshot
Assessing the Exceptionality of Coloured Motifs in Networks
inferredcites →https://doi.org/10.1186/1687-4153-2009-616234openalex-snapshot
Assessing the Exceptionality of Coloured Motifs in Networks
inferredcites →https://doi.org/10.48550/arxiv.1105.0477openalex-snapshot
The parameterized complexity of k-edge induced subgraphs
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-06222-4_7openalex-snapshot
Business Network Analytics: From Graphs to Supernetworks
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_37openalex-snapshot
The Hardness of Sampling Connected Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_15openalex-snapshot
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_15openalex-snapshot
On the Perception of Small Sub-graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-39817-4_13openalex-snapshot
On Counting Parameterized Matching and Packing
inferred← citeshttps://doi.org/10.1007/s00453-018-0404-yopenalex-snapshot
Randomised Enumeration of Small Witnesses Using a Decision Oracle
inferred← citeshttps://doi.org/10.1007/s00453-020-00676-9openalex-snapshot
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
inferred← citeshttps://doi.org/10.1007/s00453-021-00894-9openalex-snapshot
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness
inferred← citeshttps://doi.org/10.1007/s00493-016-3338-5openalex-snapshot
The parameterised complexity of counting even and odd induced subgraphs
inferred← citeshttps://doi.org/10.1007/s00778-024-00890-9openalex-snapshot
Estimating simplet counts via sampling
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100344openalex-snapshot
Compactors for parameterized counting problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100837openalex-snapshot
Parameterised counting complexity theory
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.019openalex-snapshot
The challenges of unbounded treewidth in parameterised subgraph counting problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.022openalex-snapshot
Parameterized counting matching and packing: A family of hard problems that admit FPTRAS
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00128openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00036openalex-snapshot
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
inferred← citeshttps://doi.org/10.1109/tst.2014.6867521openalex-snapshot
Counting problems in parameterized complexity
inferred← citeshttps://doi.org/10.1137/1.9781611975994.135openalex-snapshot
Approximately counting and sampling small witnesses using a colourful decision oracle
inferred← citeshttps://doi.org/10.1137/1.9781611977912.74openalex-snapshot
Count on CFI graphs for #P-hardness
inferred← citeshttps://doi.org/10.1137/19m130604xopenalex-snapshot
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
inferred← citeshttps://doi.org/10.1137/20m1365624openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1137/22m1479804openalex-snapshot
Parameterized Counting and Cayley Graph Expanders
inferred← citeshttps://doi.org/10.1137/22m1512211openalex-snapshot
Counting Small Induced Subgraphs with Hereditary Properties
inferred← citeshttps://doi.org/10.1137/22m1535668openalex-snapshot
Counting Subgraphs in Somewhere Dense Graphs
inferred← citeshttps://doi.org/10.1145/2786017openalex-snapshot
Some Hard Families of Parameterized Counting Problems
inferred← citeshttps://doi.org/10.1145/3055399.3055502openalex-snapshot
Homomorphisms are a good basis for counting small subgraphs
inferred← citeshttps://doi.org/10.1145/3519935.3520008openalex-snapshot
Counting small induced subgraphs with hereditary properties
inferred← citeshttps://doi.org/10.1145/3543507.3583332openalex-snapshot
Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes
inferred← citeshttps://doi.org/10.1145/3564246.3585204openalex-snapshot
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
inferred← citeshttps://doi.org/10.1145/3618260.3649644openalex-snapshot
Counting Small Induced Subgraphs with Edge-Monotone Properties
inferred← citeshttps://doi.org/10.1145/3711896.3737170openalex-snapshot
UnG-MoCha: Neural Motif Counting in Uncertain Graphs
inferred← citeshttps://doi.org/10.1145/3802010openalex-snapshot
An Efficient Streaming Algorithm for Approximating Graphlet Distributions
inferred← citeshttps://doi.org/10.1155/ijmm/8677973openalex-snapshot
On the Clean Graph of Commutative Artinian Rings
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.108openalex-snapshot
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders
inferred← citeshttps://doi.org/10.48550/arxiv.1310.6524openalex-snapshot
Some hard families of parameterised counting problems
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3375openalex-snapshot
The parameterised complexity of counting even and odd induced subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1710.08758openalex-snapshot
Two dichotomies for model-checking in multi-layer structures
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.