Tomer Kotek

According to our database, Tomer Kotek authored at least 33 papers between 2008 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

On the Tutte and Matching Polynomials for Complete Graphs.

Tomer Kotek, Johann A. Makowsky

Fundam. Informaticae, 2022

2020

Pebble-Intervals Automata and FO² with Two Orders.

Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith

Proceedings of the Language and Automata Theory and Applications, 2020

2019

Pebble-Intervals Automata and FO2 with Two Orders (Extended Version).

Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith

CoRR, 2019

The exact complexity of the Tutte polynomial.

Tomer Kotek, Johann A. Makowsky

CoRR, 2019

A logician's view of graph polynomials.

Johann A. Makowsky, Elena V. Ravve, Tomer Kotek

Ann. Pure Appl. Log., 2019

2018

On sequences of polynomials arising from graph invariants.

Tomer Kotek, Johann A. Makowsky, Elena V. Ravve

Eur. J. Comb., 2018

Parameterized model checking of rendezvous systems.

Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith

Distributed Comput., 2018

On the complexity of generalized chromatic polynomials.

Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble

Adv. Appl. Math., 2018

2017

On the Automated Verification of Web Applications with Embedded SQL.

Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger

Proceedings of the 20th International Conference on Database Theory, 2017

2016

Monadic Second Order Finite Satisfiability and Unbounded Tree-Width.

Tomer Kotek, Helmut Veith, Florian Zuleger

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Parameterized Systems in BIP: Design and Model Checking.

Igor V. Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, Joseph Sifakis

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015

Bipartition polynomials, the Ising model and domination in graphs.

Markus Dod, Tomer Kotek, James Preen, Peter Tittmann

Discuss. Math. Graph Theory, 2015

Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width.

Tomer Kotek, Johann A. Makowsky

Proceedings of the Topics in Theoretical Computer Science, 2015

Extending ALCQIO with Trees.

Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

A representation theorem for (q-)holonomic sequences.

Tomer Kotek, Johann A. Makowsky

J. Comput. Syst. Sci., 2014

Subset-Sum Representations of Domination Polynomials.

Tomer Kotek, James Preen, Peter Tittmann

Graphs Comb., 2014

Recurrence relations for graph polynomials on bi-iterative families of graphs.

Tomer Kotek, Johann A. Makowsky

Eur. J. Comb., 2014

Extending ALCQIO with reachability.

Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger

CoRR, 2014

Connection Matrices and the Definability of Graph Parameters.

Tomer Kotek, Johann A. Makowsky

Log. Methods Comput. Sci., 2014

Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures.

Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger

Proceedings of the Integrated Formal Methods - 11th International Conference, 2014

Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability.

Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger

Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

Shape and Content: Incorporating Domain Knowledge into Shape Analysis.

Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger

Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

2012

Definability of combinatorial functions.

Tomer Kotek

PhD thesis, 2012

A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths.

Tomer Kotek, Johann A. Makowsky

Fundam. Informaticae, 2012

Complexity of Ising Polynomials.

Tomer Kotek

Comb. Probab. Comput., 2012

Recurrence Relations and Splitting Formulas for the Domination Polynomial.

Tomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks

Electron. J. Comb., 2012

A Computational Framework for the Study of Partition Functions and Graph Polynomials.

Tomer Kotek, Johann A. Makowsky, Elena V. Ravve

Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

2011

The Universal Edge Elimination Polynomial and the Dichromatic Polynomial.

Ilya Averbouch, Tomer Kotek, Johann A. Makowsky, Elena V. Ravve

Electron. Notes Discret. Math., 2011

2010

Definability of Combinatorial Functions and Their Linear Recurrence Relations.

Tomer Kotek, Johann A. Makowsky

Proceedings of the Fields of Logic and Computation, 2010

2009

On the reconstruction of graph invariants.

Tomer Kotek

Electron. Notes Discret. Math., 2009

On Counting Generalized Colorings.

Tomer Kotek, Johann A. Makowsky, Boris Zilber

Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

Application of logic to combinatorial sequences and their recurrence relations.

Eldar Fischer, Tomer Kotek, Johann A. Makowsky

Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

2008

Evaluations of Graph Polynomials.

Benny Godlin, Tomer Kotek, Johann A. Makowsky

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008