On the public citation graph

Branching and Treewidth Based Exact Algorithms

0 signed · 27 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/11604686_34openalex-snapshot
Algorithms Based on the Treewidth of Sparse Graphs
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/bf02760024openalex-snapshot
On cliques in graphs
inferredcites →https://doi.org/10.1007/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferredcites →https://doi.org/10.1016/0020-0190(88)90065-8openalex-snapshot
On generating all maximal independent sets
inferredcites →https://doi.org/10.1016/j.ipl.2005.10.012openalex-snapshot
Pathwidth of cubic graphs and exact algorithms
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.037openalex-snapshot
Counting models for 2SAT and 3SAT formulae
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/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.5555/545381.545420openalex-snapshot
An algorithm for counting maximum weighted independent sets and its applications

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-89543-3_51openalex-snapshot
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-031-55601-2_12openalex-snapshot
Parameterized Approximation Algorithms for Weighted Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_18openalex-snapshot
Counting Minimum Weighted Dominating Sets
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-02270-8_25openalex-snapshot
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_49openalex-snapshot
Maximum Minimal Vertex Cover Parameterized by Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_80openalex-snapshot
A Multivariate Approach for Weighted FPT Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-007-9133-3openalex-snapshot
On Two Techniques of Combining Branching and Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-011-9546-xopenalex-snapshot
Exact Algorithms for Edge Domination
inferred← citeshttps://doi.org/10.1007/s00453-023-01197-xopenalex-snapshot
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114870openalex-snapshot
Parameterized approximation algorithms for weighted vertex cover
inferred← citeshttps://doi.org/10.1109/tnet.2011.2111462openalex-snapshot
Practical Computation of Optimal Schedules in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1137/16m109017xopenalex-snapshot
Maximum Minimal Vertex Cover Parameterized by Vertex Cover
inferred← citeshttps://doi.org/10.1155/2016/9790629openalex-snapshot
A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1810.12982openalex-snapshot
Weighted vertex cover on graphs with maximum degree 3
inferred← citeshttps://doi.org/10.48550/arxiv.2008.01961openalex-snapshot
An Algorithm Framework for the Exact Solution and Improved Approximation of the Maximum Weighted Independent Set Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2108.12840openalex-snapshot
Exact algorithms for maximum weighted independent set on sparse 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.