Evaluations of Graph Polynomials. - Benny Godlin; Tomer Kotek; Johann A. Makowsky (WG, 2008)

Application of logic to combinatorial sequences and their recurrence relations. - Eldar Fischer; Tomer Kotek; Johann A. Makowsky (AMS-ASL Joint Special Session, 2009)

On Counting Generalized Colorings. - Tomer Kotek; Johann A. Makowsky; Boris Zilber (AMS-ASL Joint Special Session, 2009)

On the reconstruction of graph invariants. - Tomer Kotek (Electron. Notes Discret. Math., 2009)

Definability of Combinatorial Functions and Their Linear Recurrence Relations. - Tomer Kotek; Johann A. Makowsky (Fields of Logic and Computation, 2010)

The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. - Ilya Averbouch; Tomer Kotek; Johann A. Makowsky; Elena V. Ravve (Electron. Notes Discret. Math., 2011)

A Computational Framework for the Study of Partition Functions and Graph Polynomials. - Tomer Kotek; Johann A. Makowsky; Elena V. Ravve (SYNASC, 2012)

Recurrence Relations and Splitting Formulas for the Domination Polynomial. - Tomer Kotek; James Preen; Frank Simon; Peter Tittmann 001; Martin Trinks (Electron. J. Comb., 2012)

Complexity of Ising Polynomials. - Tomer Kotek (Comb. Probab. Comput., 2012)

A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths. - Tomer Kotek; Johann A. Makowsky (Fundam. Informaticae, 2012)

Definability of combinatorial functions. - Tomer Kotek (2012)

Shape and Content: Incorporating Domain Knowledge into Shape Analysis. - Diego Calvanese; Tomer Kotek; Mantas Simkus; Helmut Veith; Florian Zuleger (Description Logics, 2014)

Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. - Tomer Kotek; Mantas Simkus; Helmut Veith; Florian Zuleger (Description Logics, 2014)

Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures. - Diego Calvanese; Tomer Kotek; Mantas Simkus; Helmut Veith; Florian Zuleger (IFM, 2014)

Connection Matrices and the Definability of Graph Parameters. - Tomer Kotek; Johann A. Makowsky (Log. Methods Comput. Sci., 2014)

Extending ALCQIO with reachability. - Tomer Kotek; Mantas Simkus; Helmut Veith; Florian Zuleger (CoRR, 2014)

Recurrence relations for graph polynomials on bi-iterative families of graphs. - Tomer Kotek; Johann A. Makowsky (Eur. J. Comb., 2014)

Subset-Sum Representations of Domination Polynomials. - Tomer Kotek; James Preen; Peter Tittmann 001 (Graphs Comb., 2014)

A representation theorem for (q-)holonomic sequences. - Tomer Kotek; Johann A. Makowsky (J. Comput. Syst. Sci., 2014)

Extending ALCQIO with Trees. - Tomer Kotek; Mantas Simkus; Helmut Veith; Florian Zuleger (LICS, 2015)

Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. - Tomer Kotek; Johann A. Makowsky (TTCS, 2015)

Bipartition polynomials, the Ising model and domination in graphs. - Markus Dod; Tomer Kotek; James Preen; Peter Tittmann 001 (Discuss. Math. Graph Theory, 2015)

Parameterized Systems in BIP: Design and Model Checking. - Igor V. Konnov 001; Tomer Kotek; Qiang Wang 020; Helmut Veith; Simon Bliudze; Joseph Sifakis (CONCUR, 2016)

Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. - Tomer Kotek; Helmut Veith; Florian Zuleger (CSL, 2016)

On the Automated Verification of Web Applications with Embedded SQL. - Shachar Itzhaky; Tomer Kotek; Noam Rinetzky; Mooly Sagiv; Orr Tamir; Helmut Veith; Florian Zuleger (ICDT, 2017)

On the complexity of generalized chromatic polynomials. - Andrew J. Goodall; Miki Hermann; Tomer Kotek; Johann A. Makowsky; Steven D. Noble (Adv. Appl. Math., 2018)

Parameterized model checking of rendezvous systems. - Benjamin Aminof; Tomer Kotek; Sasha Rubin; Francesco Spegni; Helmut Veith (Distributed Comput., 2018)

On sequences of polynomials arising from graph invariants. - Tomer Kotek; Johann A. Makowsky; Elena V. Ravve (Eur. J. Comb., 2018)

A logician's view of graph polynomials. - Johann A. Makowsky; Elena V. Ravve; Tomer Kotek (Ann. Pure Appl. Log., 2019)

The exact complexity of the Tutte polynomial. - Tomer Kotek; Johann A. Makowsky (CoRR, 2019)

Pebble-Intervals Automata and FO2 with Two Orders (Extended Version). - Nadia Labai; Tomer Kotek; Magdalena Ortiz 001; Helmut Veith (CoRR, 2019)

Pebble-Intervals Automata and FO2 with Two Orders. - Nadia Labai; Tomer Kotek; Magdalena Ortiz 001; Helmut Veith (LATA, 2020)

On the Tutte and Matching Polynomials for Complete Graphs. - Tomer Kotek; Johann A. Makowsky (Fundam. Informaticae, 2022)