On the public citation graph
A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width
0 signed · 59 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.1007/11604686_5openalex-snapshot
Approximating Rank-Width and Clique-Width Quickly
inferredcites →https://doi.org/10.1007/11780342_35openalex-snapshot
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
inferredcites →https://doi.org/10.1007/11874683_11openalex-snapshot
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
inferredcites →https://doi.org/10.1007/11917496_18openalex-snapshot
Computing Graph Polynomials on Graphs of Bounded Clique-Width
inferredcites →https://doi.org/10.1007/3-540-55121-2_2openalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferredcites →https://doi.org/10.1007/978-3-540-75520-3_16openalex-snapshot
Finding Branch-Decompositions and Rank-Decompositions
inferredcites →https://doi.org/10.1007/s00493-004-0035-6openalex-snapshot
A Two-Variable Interlace Polynomial
inferredcites →https://doi.org/10.1016/0304-3975(93)90064-zopenalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferredcites →https://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferredcites →https://doi.org/10.1016/j.dam.2004.01.016openalex-snapshot
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
inferredcites →https://doi.org/10.1016/j.dam.2008.08.021openalex-snapshot
Linear delay enumeration and monadic second-order logic
inferredcites →https://doi.org/10.1016/j.disc.2004.07.028openalex-snapshot
Graph polynomials derived from Tutte–Martin polynomials
inferredcites →https://doi.org/10.1016/j.jctb.2006.04.003openalex-snapshot
Vertex-minors, monadic second-order logic, and a conjecture by Seese
inferredcites →https://doi.org/10.1016/s0166-218x(00)00221-3openalex-snapshot
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/cbo9780511734885.009openalex-snapshot
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
inferredcites →https://doi.org/10.1017/s0963548306007656openalex-snapshot
Parametrized Tutte Polynomials of Graphs and Matroids
inferredcites →https://doi.org/10.1017/s0963548307008723openalex-snapshot
Distance Hereditary Graphs and the Interlace Polynomial
inferredcites →https://doi.org/10.1017/s0963548398003447openalex-snapshot
A Tutte Polynomial for Coloured Graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1989-0955462-3openalex-snapshot
A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
inferredcites →https://doi.org/10.1090/s0002-9947-1992-1080738-6openalex-snapshot
Strong Tutte Functions of Matroids and Graphs
inferredcites →https://doi.org/10.1142/s0129054100000260openalex-snapshot
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
inferredcites →https://doi.org/10.1145/1132516.1132568openalex-snapshot
Clique-width minimization is NP-hard
inferredcites →https://doi.org/10.1145/1435375.1435385openalex-snapshot
Approximating rank-width and clique-width quickly
inferredcites →https://doi.org/10.1145/602220.602222openalex-snapshot
Query evaluation via tree-decompositions
inferredcites →https://doi.org/10.4230/lipics.stacs.2008.1337openalex-snapshot
On the Complexity of the Interlace Polynomial
inferredcites →https://doi.org/10.5555/338219.338258openalex-snapshot
The interlace polynomial: a new graph polynomial
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-0-8176-4789-6_10openalex-snapshot
Graph Polynomials and Their Applications II: Interrelations and Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-031-76738-8_21openalex-snapshot
Meta-theorems for Graph Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_30openalex-snapshot
Graph Polynomials and Local Graph Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_25openalex-snapshot
On Counting Generalized Colorings
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_17openalex-snapshot
Evaluations of Graph Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_56openalex-snapshot
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_18openalex-snapshot
Exponential Time Complexity of Weighted Counting of Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_45openalex-snapshot
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/s00453-010-9439-4openalex-snapshot
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/s10479-017-2712-zopenalex-snapshot
Neighborhood covering and independence on $$P_4$$P4-tidy graphs and tree-cographs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.02.004openalex-snapshot
Binary nullity, Euler circuits and interlace polynomials
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.03.005openalex-snapshot
Interlace polynomials for multimatroids and delta-matroids
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.03.012openalex-snapshot
Recurrence relations for graph polynomials on bi-iterative families of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.10.001openalex-snapshot
Binary matroids and local complementation
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.016openalex-snapshot
The transition matroid of a 4-regular graph: An introduction
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.09.006openalex-snapshot
On the interlace polynomials
inferred← citeshttps://doi.org/10.1017/s0963548309990381openalex-snapshot
Weighted Interlace Polynomials
inferred← citeshttps://doi.org/10.1017/s0963548312000296openalex-snapshot
A Graph Polynomial for Independent Sets of Bipartite Graphs
inferred← citeshttps://doi.org/10.1080/00207160.2014.881994openalex-snapshot
Clique-perfectness and balancedness of some graph classes
inferred← citeshttps://doi.org/10.1109/synasc.2012.36openalex-snapshot
A Computational Framework for the Study of Partition Functions and Graph Polynomials
inferred← citeshttps://doi.org/10.1142/s0218216510007978openalex-snapshot
A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
inferred← citeshttps://doi.org/10.22028/d291-26046openalex-snapshot
Computational complexity of graph polynomials
inferred← citeshttps://doi.org/10.37236/4195openalex-snapshot
Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3635openalex-snapshot
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
inferred← citeshttps://doi.org/10.48550/arxiv.1107.5493openalex-snapshot
The adjacency matroid of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0293openalex-snapshot
Interlace polynomials and Tutte polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1307.8097openalex-snapshot
The transition matroid of a 4-regular graph: an introduction
inferred← citeshttps://doi.org/10.48550/arxiv.1601.00032openalex-snapshot
Neighborhood covering and independence on two superclasses of cographs
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.