On the public citation graph

New Upper Bound Heuristics for Treewidth

0 signed · 39 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/3-540-44867-5openalex-snapshot
Experimental and Efficient Algorithms
inferredcites →https://doi.org/10.1007/3-540-44867-5_6openalex-snapshot
New Lower and Upper Bounds for Graph Treewidth
inferredcites →https://doi.org/10.1007/978-3-540-30577-4_1openalex-snapshot
Discovering Treewidth
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_6openalex-snapshot
The Minimum Degree Heuristic and the Minimal Triangulation Process
inferredcites →https://doi.org/10.1007/b105088openalex-snapshot
SOFSEM 2005: Theory and Practice of Computer Science
inferredcites →https://doi.org/10.1016/0166-218x(92)90208-ropenalex-snapshot
Narrowness, pathwidth, and their application in natural language processing
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
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.1016/s1571-0653(05)00746-8openalex-snapshot
Solving Frequency Assignment Problems via Tree-Decomposition
inferredcites →https://doi.org/10.1016/s1571-0653(05)80078-2openalex-snapshot
Treewidth: Computational Experiments
inferredcites →https://doi.org/10.1111/j.2517-6161.1988.tb01721.xopenalex-snapshot
Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1137/s0895480194275825openalex-snapshot
Algorithms for Vertex Partitioning Problems on Partial k-Trees
inferredcites →https://doi.org/10.1287/ijoc.15.3.233.16078openalex-snapshot
Tour Merging via Branch-Decomposition
inferredcites →https://doi.org/10.26481/dis.19991104akopenalex-snapshot
Frequency assignment : models and algorithms
inferredcites →https://doi.org/10.48550/arxiv.1301.2253openalex-snapshot
Efficient Approximation for Triangulation of Minimum Treewidth
inferredcites →https://doi.org/10.48550/arxiv.1301.2256openalex-snapshot
Pre-processing for Triangulation of Probabilistic Networks

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11775096_24openalex-snapshot
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
inferred← citeshttps://doi.org/10.1007/11841036_60openalex-snapshot
On Exact Algorithms for Treewidth
inferred← citeshttps://doi.org/10.1007/11917496_1openalex-snapshot
Treewidth: Characterizations, Applications, and Computations
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0openalex-snapshot
Treewidth, Kernels, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_5openalex-snapshot
Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_1openalex-snapshot
Discovering Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_77openalex-snapshot
Weighted Treewidth Algorithmic Techniques and Results
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_6openalex-snapshot
Encoding Treewidth into SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7openalex-snapshot
Mathematical Foundations of Computer Science 2009
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_20openalex-snapshot
Constructing Brambles
inferred← citeshttps://doi.org/10.1007/s00453-006-1226-xopenalex-snapshot
Safe Reduction Rules for Weighted Treewidth
inferred← citeshttps://doi.org/10.1007/s10559-007-0080-4openalex-snapshot
Tree decomposition and discrete optimization problems: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2007.02.004openalex-snapshot
On the maximum cardinality search lower bound for treewidth
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.008openalex-snapshot
Treewidth computations I. Upper bounds
inferred← citeshttps://doi.org/10.1093/comjnl/bxm037openalex-snapshot
Combinatorial Optimization on Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1109/ssp.2011.5967830openalex-snapshot
Multivariate approach for brain decomposable connectivity networks
inferred← citeshttps://doi.org/10.1145/2390176.2390188openalex-snapshot
On exact algorithms for treewidth
inferred← citeshttps://doi.org/10.1145/2851494openalex-snapshot
Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
inferred← citeshttps://doi.org/10.1287/educ.1053.0017openalex-snapshot
Branch and Tree Decomposition Techniques for Discrete Optimization
inferred← citeshttps://doi.org/10.1504/ejie.2007.014690openalex-snapshot
Genetic algorithms for generalised hypertree decompositions
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.