On the public citation graph
Parameterized Algorithms for Hitting Set: The Weighted Case
0 signed · 33 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.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
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/11590156_37openalex-snapshot
Comparing Trees Via Crossing Minimization
inferredcites →https://doi.org/10.1007/3-540-45848-4_1openalex-snapshot
A Fixed-Parameter Approach to Two-Layer Planarization
inferredcites →https://doi.org/10.1007/s00453-005-1181-yopenalex-snapshot
A Fixed-Parameter Approach to 2-Layer Planarization
inferredcites →https://doi.org/10.1016/0004-3702(87)90062-2openalex-snapshot
A theory of diagnosis from first principles
inferredcites →https://doi.org/10.1016/0004-3702(92)90027-uopenalex-snapshot
Characterizing diagnoses and systems
inferredcites →https://doi.org/10.1016/j.dam.2008.05.008openalex-snapshot
Parameterized algorithmics for linear arrangement problems
inferredcites →https://doi.org/10.1016/j.jalgor.2004.01.001openalex-snapshot
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
inferredcites →https://doi.org/10.1016/s0196-6774(03)00005-1openalex-snapshot
On efficient fixed-parameter algorithms for weighted vertex cover
inferredcites →https://doi.org/10.1016/s1570-8667(03)00009-1openalex-snapshot
An efficient fixed-parameter algorithm for 3-Hitting Set
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.48550/arxiv.cs/0304018openalex-snapshot
Quasiconvex Analysis of Backtracking Algorithms
inferredcites →https://doi.org/10.7155/jgaa.00106openalex-snapshot
Two-Layer Planarization: Improving on Parameterized Algorithmics
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-540-70918-3_29openalex-snapshot
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_14openalex-snapshot
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_61openalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_4openalex-snapshot
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_27openalex-snapshot
Iterative Compression and Exact Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_9openalex-snapshot
Searching Trees: An Essay
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_9openalex-snapshot
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
inferred← citeshttps://doi.org/10.1007/s00224-008-9150-xopenalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-008-9199-6openalex-snapshot
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.02.006openalex-snapshot
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.014openalex-snapshot
Improved FPT algorithm for feedback vertex set problem in bipartite tournament
inferred← citeshttps://doi.org/10.1016/j.jda.2009.01.003openalex-snapshot
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.012openalex-snapshot
Iterative compression and exact algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.001openalex-snapshot
Parameterized algorithms for d -Hitting Set: The weighted case
inferred← citeshttps://doi.org/10.1137/1.9781611977042.17openalex-snapshot
An Efficient Branch-and-Bound Solver for Hitting Set
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.6openalex-snapshot
Exact Elimination of Cycles in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10523openalex-snapshot
l-path vertex cover is easier than l-hitting set for small l
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.