Similar Items: Connection Matrices and the Definability of Graph Parameters
- Defining Recursive Predicates in Graph Orders
- Monadic second-order definable graph orderings
- Definable decompositions for graphs of bounded linear cliquewidth
- Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
- Universality of Kernel Random Matrices and Kernel Regression in the Quadratic Regime
- conmat: generate synthetic contact matrices for a given age-stratified population