Tomer Kotek

From MaRDI portal
Person:456392

Available identifiers

zbMath Open kotek.tomerMaRDI QIDQ456392

List of research outcomes





PublicationDate of PublicationType
The exact complexity of the Tutte polynomial2023-04-28Paper
On the Tutte and Matching Polynomials for Complete Graphs2022-10-07Paper
On the Tutte and matching polynomials for complete graphs2021-12-13Paper
Pebble-intervals automata and \(\text{FO}^2\) with two orders2020-07-27Paper
A logician's view of graph polynomials2019-09-18Paper
On the Automated Verification of Web Applications with Embedded SQL2018-07-18Paper
Parameterized model checking of rendezvous systems2018-06-01Paper
Extending ALCQIO with Trees2018-04-23Paper
On the complexity of generalized chromatic polynomials2018-01-11Paper
On sequences of polynomials arising from graph invariants2017-10-10Paper
Domination Polynomials of Graph Products2017-08-16Paper
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width2017-07-19Paper
A Computational Framework for the Study of Partition Functions and Graph Polynomials2017-05-31Paper
Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width2016-04-01Paper
Bipartition polynomials, the Ising model, and domination in graphs2015-05-11Paper
Connection matrices and the definability of graph parameters2014-11-13Paper
Parameterized Model Checking of Rendezvous Systems2014-09-15Paper
Recurrence relations for graph polynomials on bi-iterative families of graphs2014-09-02Paper
Subset-sum representations of domination polynomials2014-06-16Paper
A representation theorem for (\(q\)-)holonomic sequences2013-12-13Paper
The universal edge elimination polynomial and the dichromatic polynomial2013-11-01Paper
On the reconstruction of graph invariants2013-10-10Paper
https://portal.mardi4nfdi.de/entity/Q46495622012-11-22Paper
Recurrence relations and splitting formulas for the domination polynomial2012-10-24Paper
Complexity of Ising polynomials2012-09-12Paper
A representation theorem for holonomic sequences based on counting lattice paths2012-07-11Paper
https://portal.mardi4nfdi.de/entity/Q31183852012-03-02Paper
https://portal.mardi4nfdi.de/entity/Q31183802012-03-02Paper
Definability of Combinatorial Functions and Their Linear Recurrence Relations2010-09-03Paper
Evaluations of Graph Polynomials2009-01-20Paper
On Counting Generalized Colorings2008-11-20Paper

Research outcomes over time

This page was built for person: Tomer Kotek