| Publication | Date of Publication | Type |
|---|
The exact complexity of the Tutte polynomial
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
On the Tutte and Matching Polynomials for Complete Graphs
Fundamenta Informaticae | 2022-10-07 | Paper |
On the Tutte and matching polynomials for complete graphs
(available as arXiv preprint) | 2021-12-13 | Paper |
Pebble-intervals automata and \(\text{FO}^2\) with two orders
(available as arXiv preprint) | 2020-07-27 | Paper |
A logician's view of graph polynomials
Annals of Pure and Applied Logic | 2019-09-18 | Paper |
On the automated verification of web applications with embedded SQL
(available as arXiv preprint) | 2018-07-18 | Paper |
Parameterized model checking of rendezvous systems
Distributed Computing | 2018-06-01 | Paper |
Extending \(\mathcal{ALCQIO}\) with trees
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
On sequences of polynomials arising from graph invariants
European Journal of Combinatorics | 2017-10-10 | Paper |
Domination polynomials of graph products
(available as arXiv preprint) | 2017-08-16 | Paper |
Monadic second order finite satisfiability and unbounded tree-width
(available as arXiv preprint) | 2017-07-19 | Paper |
A computational framework for the study of partition functions and graph polynomials
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
Efficient computation of generalized Ising polynomials on graphs with fixed clique-width
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Bipartition polynomials, the Ising model, and domination in graphs
Discussiones Mathematicae Graph Theory | 2015-05-11 | Paper |
Connection matrices and the definability of graph parameters
Logical Methods in Computer Science | 2014-11-13 | Paper |
Parameterized model checking of rendezvous systems
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Recurrence relations for graph polynomials on bi-iterative families of graphs
European Journal of Combinatorics | 2014-09-02 | Paper |
Subset-sum representations of domination polynomials
Graphs and Combinatorics | 2014-06-16 | Paper |
A representation theorem for (\(q\)-)holonomic sequences
Journal of Computer and System Sciences | 2013-12-13 | Paper |
| The universal edge elimination polynomial and the dichromatic polynomial | 2013-11-01 | Paper |
On the reconstruction of graph invariants
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
| Connection matrices and the definability of graph parameters | 2012-11-22 | Paper |
Recurrence relations and splitting formulas for the domination polynomial
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Recurrence relations and splitting formulas for the domination polynomial
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Complexity of Ising polynomials
Combinatorics, Probability and Computing | 2012-09-12 | Paper |
A representation theorem for holonomic sequences based on counting lattice paths
Fundamenta Informaticae | 2012-07-11 | Paper |
| On counting generalized colorings | 2012-03-02 | Paper |
| Application of logic to combinatorial sequences and their recurrence relations | 2012-03-02 | Paper |
Definability of combinatorial functions and their linear recurrence relations
Fields of Logic and Computation | 2010-09-03 | Paper |
Evaluations of Graph Polynomials
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
On Counting Generalized Colorings
Computer Science Logic | 2008-11-20 | Paper |
