On the public citation graph

On Parameterized Path and Chordless Path Problems

0 signed · 66 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/jgt.20040openalex-snapshot
Detecting even holes
inferredcites →https://doi.org/10.1002/jgt.v48:2openalex-snapshot
inferredcites →https://doi.org/10.1002/malq.19750210112openalex-snapshot
Monadic generalized spectra
inferredcites →https://doi.org/10.1006/jcss.1996.0058openalex-snapshot
On Limited Nondeterminism and the Complexity of the V-C Dimension
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/11847250_3openalex-snapshot
The Parameterized Complexity of Maximality and Minimality Problems
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-53832-1_28openalex-snapshot
Finding minimally weighted subgraphs
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/bf02523189openalex-snapshot
Finding and counting given length cycles
inferredcites →https://doi.org/10.1007/s00453-006-1225-yopenalex-snapshot
Detecting Holes and Antiholes in Graphs
inferredcites →https://doi.org/10.1007/s00493-005-0012-8openalex-snapshot
Recognizing Berge Graphs
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0168-0072(95)00030-5openalex-snapshot
On winning Ehrenfeucht games and monadic NP
inferredcites →https://doi.org/10.1016/j.apal.2007.09.003openalex-snapshot
The parameterized complexity of maximality and minimality problems
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.003openalex-snapshot
Bounded fixed-parameter tractability and log 2 n nondeterministic bits
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.021openalex-snapshot
Chordless paths through three vertices
inferredcites →https://doi.org/10.1016/s0304-0208(08)73110-4openalex-snapshot
How to Find Long Paths Efficiently
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.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/cbo9780511803888openalex-snapshot
Combinatorics
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferredcites →https://doi.org/10.1109/sct.1993.336544openalex-snapshot
On monadic NP vs. monadic co-NP
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/s0097539703427203openalex-snapshot
The Parameterized Complexity of Counting Problems
inferredcites →https://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferredcites →https://doi.org/10.1137/s089548010444540xopenalex-snapshot
Odd Hole Recognition in Graphs of Bounded Clique Size
inferredcites →https://doi.org/10.1145/210332.210337openalex-snapshot
Color-coding
inferredcites →https://doi.org/10.2307/2274958openalex-snapshot
Reachability is harder for directed than for undirected finite graphs
inferredcites →https://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferredcites →https://doi.org/10.5555/982792.982920openalex-snapshot
Hole and antihole detection in 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-1-4939-2864-4_728openalex-snapshot
Enumeration of Paths, Cycles, and Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_8openalex-snapshot
An Experimental Study of ILP Formulations for the Longest Induced Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_48openalex-snapshot
Understanding the Complexity of Induced Subgraph Isomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_26openalex-snapshot
Parameterized Graph Cleaning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_13openalex-snapshot
Lower Bounds for Kernelizations and Other Preprocessing Procedures
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_728-1openalex-snapshot
Enumeration of Paths, Cycles, and Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_54openalex-snapshot
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_54openalex-snapshot
The Parameterized Complexity of k-Edge Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_4openalex-snapshot
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_16openalex-snapshot
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_35openalex-snapshot
Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/s00224-010-9270-yopenalex-snapshot
Lower Bounds for Kernelizations and Other Preprocessing Procedures
inferred← citeshttps://doi.org/10.1007/s00373-014-1423-3openalex-snapshot
Exhaustive Search for Snake-in-the-Box Codes
inferred← citeshttps://doi.org/10.1007/s00453-014-9871-yopenalex-snapshot
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-023-01096-1openalex-snapshot
A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
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.1016/j.dam.2009.06.022openalex-snapshot
Parameterized graph cleaning problems
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.010openalex-snapshot
On the maximum length of coil-in-the-box codes in dimension 8
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.040openalex-snapshot
Polyhedral properties of the induced cluster subgraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2016.10.004openalex-snapshot
The parameterized complexity of k-edge induced subgraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105227openalex-snapshot
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.11.015openalex-snapshot
The parameterised complexity of counting connected subgraphs and graph motifs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.006openalex-snapshot
Kernel bounds for path and cycle problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.001openalex-snapshot
Induced subgraph isomorphism: Are some patterns substantially easier than others?
inferred← citeshttps://doi.org/10.1145/2786017openalex-snapshot
Some Hard Families of Parameterized Counting Problems
inferred← citeshttps://doi.org/10.1145/3331446openalex-snapshot
Dichotomies for Evaluating Simple Regular Path Queries
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16495openalex-snapshot
Finding Diverse Trees, Paths, and More
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:25)2019openalex-snapshot
On the First-Order Complexity of Induced Subgraph Isomorphism
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2019.21openalex-snapshot
Boolean Tensor Decomposition for Conjunctive Queries with Negation
inferred← citeshttps://doi.org/10.46298/dmtcs.7636openalex-snapshot
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0477openalex-snapshot
The parameterized complexity of k-edge induced subgraphs
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.2109.06561openalex-snapshot
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters
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.