PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kotek, Tomer"

Author of the publication

copydeleteadd this publication to your clipboard
Monadic second order finite satisfiability and unbounded tree-width.

, , and . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Kotek, Tomer
add a person with the name Kotek, Tomer
 

Other publications of authors with the same name

Recurrence relations for graph polynomials on bi-iterative families of graphs., and . Eur. J. Comb., (2014)A Computational Framework for the Study of Partition Functions and Graph Polynomials., , and . SYNASC, page 365-368. IEEE Computer Society, (2012)On Counting Generalized Colorings., , and . CSL, volume 5213 of Lecture Notes in Computer Science, page 339-353. Springer, (2008)Shape and Content: Incorporating Domain Knowledge into Shape Analysis., , , , and . Description Logics, volume 1193 of CEUR Workshop Proceedings, page 124-127. CEUR-WS.org, (2014)On the complexity of generalized chromatic polynomials., , , , and . Adv. Appl. Math., (2018)Connection Matrices and the Definability of Graph Parameters., and . Logical Methods in Computer Science, (2014)Complexity of Ising Polynomials. CoRR, (2011)Parameterized Systems in BIP: Design and Model Checking., , , , , and . CONCUR, volume 59 of LIPIcs, page 30:1-30:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width., and . TTCS, volume 9541 of Lecture Notes in Computer Science, page 135-146. Springer, (2015)Definability of Combinatorial Functions and Their Linear Recurrence Relations., and . Fields of Logic and Computation, volume 6300 of Lecture Notes in Computer Science, page 444-462. Springer, (2010)