On the public citation graph

Exact Computation of Maximum Induced Forest

0 signed · 72 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.1007/11523468_16openalex-snapshot
Measure and Conquer: Domination – A Case Study
inferredcites →https://doi.org/10.1007/11560586_30openalex-snapshot
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
inferredcites →https://doi.org/10.1007/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
inferredcites →https://doi.org/10.1016/j.orl.2004.03.002openalex-snapshot
Enumerating maximal independent sets with applications to graph colouring
inferredcites →https://doi.org/10.1016/s0304-3975(01)00174-8openalex-snapshot
A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search
inferredcites →https://doi.org/10.48550/arxiv.cs/0009006openalex-snapshot
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11847250_12openalex-snapshot
An Exact Algorithm for the Minimum Dominating Clique Problem
inferred← citeshttps://doi.org/10.1007/11847250_17openalex-snapshot
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
inferred← citeshttps://doi.org/10.1007/11889205_2openalex-snapshot
Algorithms and Constraint Programming
inferred← citeshttps://doi.org/10.1007/11944836_15openalex-snapshot
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
inferred← citeshttps://doi.org/10.1007/11944836_16openalex-snapshot
Solving Connected Dominating Set Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_14openalex-snapshot
An Improved Exact Algorithm for Undirected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_14openalex-snapshot
Faster Exact Algorithms for Some Terminal Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_26openalex-snapshot
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_28openalex-snapshot
A Cubic Kernel for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_37openalex-snapshot
Improved Algorithms for the Feedback Vertex Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_42openalex-snapshot
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_16openalex-snapshot
A Linear Kernel for Planar Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_20openalex-snapshot
Exact Algorithms for Edge Domination
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_10openalex-snapshot
On Feedback Vertex Set New Measure and New Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-16533-7_6openalex-snapshot
Measure & Conquer
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_31openalex-snapshot
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_66openalex-snapshot
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_34openalex-snapshot
Enumerating Minimal Subset Feedback Vertex Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_25openalex-snapshot
Exact Algorithm for the Maximum Induced Planar Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_3openalex-snapshot
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_20openalex-snapshot
Spotting Trees with Few Leaves
inferred← citeshttps://doi.org/10.1007/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferred← citeshttps://doi.org/10.1007/s00224-009-9234-2openalex-snapshot
A Cubic Kernel for Feedback Vertex Set and Loop Cutset
inferred← citeshttps://doi.org/10.1007/s00453-007-9145-zopenalex-snapshot
Solving Connected Dominating Set Faster than 2 n
inferred← citeshttps://doi.org/10.1007/s00453-007-9152-0openalex-snapshot
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-011-9546-xopenalex-snapshot
Exact Algorithms for Edge Domination
inferred← citeshttps://doi.org/10.1007/s00453-011-9555-9openalex-snapshot
Sharp Separation and Applications to Exact and Parameterized Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-012-9731-6openalex-snapshot
Enumerating Minimal Subset Feedback Vertex Sets
inferred← citeshttps://doi.org/10.1007/s10878-014-9737-xopenalex-snapshot
An improved exact algorithm for undirected feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.015openalex-snapshot
Semidefinite programming bounds and a Branch-and-bound algorithm for the Chordless Cycle Problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.05.002openalex-snapshot
Improved algorithms for feedback vertex set problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.04.003openalex-snapshot
Faster exact algorithms for some terminal set problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.014openalex-snapshot
An exact algorithm for the minimum dominating clique problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.031openalex-snapshot
An improved parameterized algorithm for the independent feedback vertex set problem
inferred← citeshttps://doi.org/10.1109/focs.2006.41openalex-snapshot
Inclusion--Exclusion Algorithms for Counting Set Partitions
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.339openalex-snapshot
Applying Graph theory to the Internet of Things
inferred← citeshttps://doi.org/10.1109/tpwrs.2014.2322051openalex-snapshot
Convex Relaxation for Optimal Power Flow Problem: Mesh Networks
inferred← citeshttps://doi.org/10.1111/itor.13299openalex-snapshot
MIP formulations for induced graph optimization problems: a tutorial
inferred← citeshttps://doi.org/10.1137/070683933openalex-snapshot
Set Partitioning via Inclusion-Exclusion
inferred← citeshttps://doi.org/10.1137/140964801openalex-snapshot
Large Induced Subgraphs via Triangulations and CMSO
inferred← citeshttps://doi.org/10.1137/15m1048975openalex-snapshot
Spotting Trees with Few Leaves
inferred← citeshttps://doi.org/10.1140/epjb/e2014-50289-7openalex-snapshot
Solving the undirected feedback vertex set problem by local search
inferred← citeshttps://doi.org/10.1142/9789812770998_0010openalex-snapshot
COMPUTING MINIMUM DIRECTED FEEDBACK VERTEX SET IN O*(1.9977n)
inferred← citeshttps://doi.org/10.1145/1514274.1514303openalex-snapshot
Towards a theory for securing time synchronization in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1552285.1552286openalex-snapshot
A measure & conquer approach for the analysis of exact algorithms
inferred← citeshttps://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferred← citeshttps://doi.org/10.1145/2897518.2897551openalex-snapshot
Exact Algorithms via Monotone Local Search
inferred← citeshttps://doi.org/10.11591/ij-ai.v2i4.3481openalex-snapshot
Memetic Algorithm for the Minimum Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.408openalex-snapshot
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3
inferred← citeshttps://doi.org/10.3390/math13182992openalex-snapshot
Theoretical Analysis and Verification of Loop Cutsets in Bayesian Network Inference
inferred← citeshttps://doi.org/10.3390/math8071079openalex-snapshot
The Study of the Theoretical Size and Node Probability of the Loop Cutset in Bayesian Networks
inferred← citeshttps://doi.org/10.3390/math8091625openalex-snapshot
Shared Node and Its Improvement to the Theory Analysis and Solving Algorithm for the Loop Cutset
inferred← citeshttps://doi.org/10.3390/math9050462openalex-snapshot
An Algorithm Based on Loop-Cutting Contribution Function for Loop Cutset Problem in Bayesian Network
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.5openalex-snapshot
Directed Feedback Vertex Set Problem is FPT
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2470openalex-snapshot
Finding Induced Subgraphs via Minimal Triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.1208.4449openalex-snapshot
Finding a maximum induced degenerate subgraph faster than 2^n
inferred← citeshttps://doi.org/10.48550/arxiv.1501.00563openalex-snapshot
Spotting Trees with Few Leaves
inferred← citeshttps://doi.org/10.5555/1496770.1496783openalex-snapshot
A quadratic kernel for feedback vertex set
inferred← citeshttps://doi.org/10.7287/peerj-cs.1245v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Dynamic thresholding search for the feedback vertex set problem (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.1245v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Dynamic thresholding search for the feedback vertex set problem (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.1245v0.2/reviews/2openalex-snapshot
Peer Review #2 of "Dynamic thresholding search for the feedback vertex set problem (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.1245openalex-snapshot
Dynamic thresholding search for the feedback vertex set problem
inferred← citeshttps://doi.org/10.7916/d88s4pdmopenalex-snapshot
Computational Methods for Nonlinear Optimization Problems: Theory and Applications
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.