T. Kotek

Most-cited papers

Parameterized model checking of rendezvous systems
Benjamin Aminof, T. Kotek, Sasha Rubin, Francesco Spegni +1 more
2014Distributed computing72 citations Open access
Semantic Scholar
Recurrence Relations and Splitting Formulas for the Domination Polynomial
T. Kotek, J. Preen, F. Simon, Peter Tittmann +1 more
2012Electronic Journal of Combinatorics71 citations Open access
Semantic Scholar
On Counting Generalized Colorings
T. Kotek, J. Makowsky, B. Zilber
2008Annual Conference for Computer Science Logic34 citations
Semantic Scholar
Parameterized Systems in BIP: Design and Model Checking
I. Konnov, T. Kotek, Qiang Wang, H. Veith +2 more
2016International Conference on Concurrency Theory28 citations
Semantic Scholar
Evaluations of Graph Polynomials
Benny Godlin, T. Kotek, J. Makowsky
2008International Workshop on Graph-Theoretic Concepts in Computer Science27 citations
Semantic Scholar
Connection Matrices and the Definability of Graph Parameters
T. Kotek, J. Makowsky
2013Log. Methods Comput. Sci.25 citations Open access
Semantic Scholar
On the automated verification of web applications with embedded SQL
Shachar Itzhaky, T. Kotek, N. Rinetzky, S. Sagiv +3 more
2016International Conference on Database Theory22 citations
Semantic Scholar
Subset-Sum Representations of Domination Polynomials
T. Kotek, J. Preen, Peter Tittmann
2012Graphs Comb.22 citations Open access
Semantic Scholar
Domination Polynomials of Graph Products
T. Kotek, J. Preen, Peter Tittmann
201317 citations
Semantic Scholar
Application of logic to combinatorial sequences and their recurrence relations
Eldar Fischer, T. Kotek, J. Makowsky
2009AMS-ASL Joint Special Session17 citations Open access
Semantic Scholar
A Computational Framework for the Study of Partition Functions and Graph Polynomials
T. Kotek, J. Makowsky, E. Ravve
20122012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing13 citations
Semantic Scholar
A logician's view of graph polynomials
J. Makowsky, E. Ravve, T. Kotek
2017Annals of Pure and Applied Logic12 citations Open access
Semantic Scholar
Bipartition Polynomials, the Ising Model, and Domination in Graphs
Markus Dod, T. Kotek, J. Preen, Peter Tittmann
2015Discussiones Mathematicae Graph Theory11 citations Open access
Semantic Scholar
Recurrence relations for graph polynomials on bi-iterative families of graphs
T. Kotek, J. Makowsky
2013European journal of combinatorics (Print)11 citations Open access
Semantic Scholar
Complexity of Ising Polynomials
T. Kotek
2011Combinatorics, probability & computing10 citations Open access
Semantic Scholar
Definability of combinatorial functions
T. Kotek
20129 citations
Semantic Scholar
Definability of Combinatorial Functions and Their Linear Recurrence Relations
T. Kotek, J. Makowsky
2009Fields of Logic and Computation9 citations Open access
Semantic Scholar
Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures
Diego Calvanese, T. Kotek, Mantas Šimkus, H. Veith +1 more
2014International Conference on Integrated Formal Methods8 citations
Semantic Scholar
On the complexity of generalized chromatic polynomials
A. Goodall, M. Hermann, T. Kotek, J. Makowsky +1 more
2017Advances in Applied Mathematics7 citations Open access
Semantic Scholar
On sequences of polynomials arising from graph invariants
T. Kotek, J. Makowsky, E. Ravve
2017European journal of combinatorics (Print)6 citations Open access
Semantic Scholar
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial
Ilya Averbouch, T. Kotek, J. Makowsky, E. Ravve
2011Electron. Notes Discret. Math.6 citations
Semantic Scholar
Extending ALCQIO with Trees
T. Kotek, Mantas Imkus, H. Veith, Florian Zuleger
20152015 30th Annual ACM/IEEE Symposium on Logic in Computer Science5 citations
Semantic Scholar
On the reconstruction of graph invariants
T. Kotek
2009Electron. Notes Discret. Math.5 citations Open access
Semantic Scholar
Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
T. Kotek, Mantas Šimkus, H. Veith, Florian Zuleger
2014Description Logics4 citations
Semantic Scholar
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths
T. Kotek, J. Makowsky
2012Fundamenta Informaticae4 citations
Semantic Scholar
Hyperosmolar therapy
T. Kotek, A. Zlotnik, I. Rozet
2022Essentials of Evidence-Based Practice of Neuroanesthesia and Neurocritical Care3 citations
Semantic Scholar
Shape and Content: Incorporating Domain Knowledge into Shape Analysis
Diego Calvanese, T. Kotek, Mantas Šimkus, H. Veith +1 more
2013Description Logics3 citations
Semantic Scholar
On the Tutte and Matching Polynomials for Complete Graphs
T. Kotek, J. Makowsky
2021Fundamenta Informaticae2 citations Open access
Semantic Scholar
The exact complexity of the Tutte polynomial
T. Kotek, J. Makowsky
2019arXiv.org2 citations
Semantic Scholar
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width
T. Kotek, H. Veith, Florian Zuleger
2015Annual Conference for Computer Science Logic2 citations
Semantic Scholar
Logic-Based Computation of Graph Polynomials
T. Kotek
20161 citations
Semantic Scholar
Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width
T. Kotek, J. Makowsky
2015International Conference on Topics in Theoretical Computer Science1 citations Open access
Semantic Scholar
Extending ALCQIO with reachability
T. Kotek, Mantas Šimkus, H. Veith, Florian Zuleger
2014arXiv.org1 citations
Semantic Scholar
From Graph Polynomials to the Software Industry: Lessons from Janos
T. Kotek
2025Festschrift in Honor of Johann A. Makowsky0 citations
Semantic Scholar
Pebble-Intervals Automata and FO\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^2$$\end{document} with Two Orders
Nadia Labai, T. Kotek, Magdalena Ortiz, H. Veith
2020Language and Automata Theory and Applications0 citations Open access
Semantic Scholar
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)
Nadia Labai, T. Kotek, Magdalena Ortiz, H. Veith
2019arXiv.org0 citations
Semantic Scholar
How many delta-matroids are there ?
A. Goodall, M. Hermann, T. Kotek, J. Makowsky +1 more
20170 citations
Semantic Scholar
A representation theorem for (q-)holonomic sequences
T. Kotek, J. Makowsky
2014Journal of computer and system sciences (Print)0 citations Open access
Semantic Scholar
Subset-Sum Representations of Domination Polynomials
T. Kotek, J. Preen, Peter Tittmann
2013Graphs and Combinatorics0 citations Open access
Semantic Scholar
E(cid:30)cient computation of generalized Ising polynomials on graphs with (cid:28)xed clique-width (cid:63)
T. Kotek, J. Makowsky
0 citations
Semantic Scholar