On the public citation graph
Interval Deletion Is Fixed-Parameter Tractable
0 signed · 77 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/jagm.1998.0936openalex-snapshot
Minimum Fill-in on Circle and Circular-Arc Graphs
inferredcites →https://doi.org/10.1007/3-540-56939-1_60openalex-snapshot
The approximation of maximum subgraph problems
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-03898-8_25openalex-snapshot
FPT Algorithms for Consecutive Ones Submatrix Problems
inferredcites →https://doi.org/10.1007/978-3-642-13731-0_10openalex-snapshot
On Feedback Vertex Set New Measure and New Structures
inferredcites →https://doi.org/10.1007/s00453-008-9233-8openalex-snapshot
Chordal Deletion is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1007/s00453-010-9484-zopenalex-snapshot
Obtaining a Planar Graph by Vertex Deletion
inferredcites →https://doi.org/10.1007/s00453-012-9661-3openalex-snapshot
Proper Interval Vertex Deletion
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0020-0190(96)00050-6openalex-snapshot
Fixed-parameter tractability of graph modification problems for hereditary properties
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/j.dam.2005.09.010openalex-snapshot
On the interval completion of chordal graphs
inferredcites →https://doi.org/10.1016/j.orl.2003.10.009openalex-snapshot
Finding odd cycle transversals
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1073/pnas.45.11.1607openalex-snapshot
ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE
inferredcites →https://doi.org/10.1089/cmb.1995.2.139openalex-snapshot
Four Strikes Against Physical Mapping of DNA
inferredcites →https://doi.org/10.1093/bioinformatics/11.1.49openalex-snapshot
Parameterized complexity analysis in computational biology
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/focs.2009.45openalex-snapshot
Planarity Allowing Few Error Vertices in Linear Time
inferredcites →https://doi.org/10.1109/focs.2012.62openalex-snapshot
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
inferredcites →https://doi.org/10.1137/070710913openalex-snapshot
Interval Completion Is Fixed Parameter Tractable
inferredcites →https://doi.org/10.1137/s0097539796303044openalex-snapshot
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
inferredcites →https://doi.org/10.1145/1411509.1411511openalex-snapshot
A fixed-parameter algorithm for the directed feedback vertex set problem
inferredcites →https://doi.org/10.1145/502102.502107openalex-snapshot
A unified approach to approximating resource allocation and scheduling
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.2140/pjm.1969.28.565openalex-snapshot
Incidence matrices, interval graphs and seriation in archeology
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line
inferredcites →https://doi.org/10.48550/arxiv.1303.1643openalex-snapshot
$d$-COS-R is FPT via Interval Deletion
inferredcites →https://doi.org/10.48550/arxiv.1306.3181openalex-snapshot
An Efficient Branching Algorithm for Interval Completion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22895openalex-snapshot
Erdős–Pósa property of obstructions to interval graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_12openalex-snapshot
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_22openalex-snapshot
Faster FPT Algorithms for Deletion to Pairs of Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_1openalex-snapshot
Distance from Triviality 2.0: Hybrid Parameterizations
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_52openalex-snapshot
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_17openalex-snapshot
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_46openalex-snapshot
Rank Reduction of Directed Graphs by Vertex and Edge Deletions
inferred← citeshttps://doi.org/10.1007/s00224-019-09964-6openalex-snapshot
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
inferred← citeshttps://doi.org/10.1007/s00224-023-10136-wopenalex-snapshot
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
inferred← citeshttps://doi.org/10.1007/s00453-014-9925-1openalex-snapshot
Obtaining Matrices with the Consecutive Ones Property by Row Deletions
inferred← citeshttps://doi.org/10.1007/s00453-016-0230-zopenalex-snapshot
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-017-0317-1openalex-snapshot
Quick but Odd Growth of Cacti
inferred← citeshttps://doi.org/10.1007/s00453-017-0340-2openalex-snapshot
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions
inferred← citeshttps://doi.org/10.1007/s00453-019-00599-0openalex-snapshot
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
inferred← citeshttps://doi.org/10.1007/s00453-021-00822-xopenalex-snapshot
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00963-7openalex-snapshot
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-025-01293-0openalex-snapshot
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105211openalex-snapshot
Modification problems toward proper (Helly) circular-arc graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.09.004openalex-snapshot
A faster FPT algorithm for Bipartite Contraction
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.03.004openalex-snapshot
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.05.005openalex-snapshot
Deletion to scattered graph classes I - Case of finite number of graph classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.056openalex-snapshot
Obtaining split graphs by edge contraction
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.020openalex-snapshot
Reducing rank of the adjacency matrix by graph modification
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.039openalex-snapshot
Vertex deletion problems on chordal graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113861openalex-snapshot
Parameterized complexity of perfectly matched sets
inferred← citeshttps://doi.org/10.1109/tst.2014.6867517openalex-snapshot
An overview of kernelization algorithms for graph modification problems
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/17m112035xopenalex-snapshot
Approximation and Kernelization for Chordal Vertex Deletion
inferred← citeshttps://doi.org/10.1145/2797140openalex-snapshot
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
inferred← citeshttps://doi.org/10.1145/3284356openalex-snapshot
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
inferred← citeshttps://doi.org/10.1145/3357713.3384318openalex-snapshot
Hitting topological minors is FPT
inferred← citeshttps://doi.org/10.1145/3406325.3451068openalex-snapshot
Vertex deletion parameterized by elimination distance and even less
inferred← citeshttps://doi.org/10.1145/3470869openalex-snapshot
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
inferred← citeshttps://doi.org/10.1145/3571075openalex-snapshot
Polynomial Kernel for Interval Vertex Deletion
inferred← citeshttps://doi.org/10.4230/lipics.esa.2023.31openalex-snapshot
Designing Output Sensitive Algorithms for Subgraph Enumeration
inferred← citeshttps://doi.org/10.48550/arxiv.1906.05458openalex-snapshot
Structural Parameterization for Graph Deletion Problems over Data Streams
inferred← citeshttps://doi.org/10.48550/arxiv.2007.03859openalex-snapshot
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14005openalex-snapshot
A polynomial kernel for vertex deletion into bipartite permutation 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.