On the Tutte and Matching Polynomials for Complete Graphs.

Tomer Kotek https://simons.berkeley.edu/people/tomer-kotek http://forsyte.at/people/kotek/ https://scholar.google.com/citations?user=9CcWzZQAAAAJ TU Wien, Austria

Tomer Kotek Johann A. Makowsky On the Tutte and Matching Polynomials for Complete Graphs. 155-173 2022 186 Fundam. Informaticae 1-4 https://fi.episciences.org/8839 https://doi.org/10.3233/FI-222124 db/journals/fuin/fuin186.html#KotekM22

Nadia Labai Tomer Kotek Magdalena Ortiz 0001 Helmut Veith Pebble-Intervals Automata and FO<sup>2</sup> with Two Orders. 208-221 2020 LATA https://doi.org/10.1007/978-3-030-40608-0_14 conf/lata/2020 db/conf/lata/lata2020.html#LabaiKOV20

Johann A. Makowsky Elena V. Ravve Tomer Kotek A logician's view of graph polynomials. 1030-1069 2019 170 Ann. Pure Appl. Log. 9 https://doi.org/10.1016/j.apal.2019.04.007 https://www.wikidata.org/entity/Q128116912 db/journals/apal/apal170.html#MakowskyRK19

Tomer Kotek Johann A. Makowsky The exact complexity of the Tutte polynomial. 2019 abs/1910.08915 CoRR http://arxiv.org/abs/1910.08915 db/journals/corr/corr1910.html#abs-1910-08915

Nadia Labai Tomer Kotek Magdalena Ortiz 0001 Helmut Veith Pebble-Intervals Automata and FO2 with Two Orders (Extended Version). 2019 abs/1912.00171 CoRR http://arxiv.org/abs/1912.00171 db/journals/corr/corr1912.html#abs-1912-00171

Andrew J. Goodall Miki Hermann Tomer Kotek Johann A. Makowsky Steven D. Noble On the complexity of generalized chromatic polynomials. 71-102 2018 94 Adv. Appl. Math. https://doi.org/10.1016/j.aam.2017.04.005 db/journals/aam/aam94.html#GoodallHKMN18

Benjamin Aminof Tomer Kotek Sasha Rubin Francesco Spegni Helmut Veith Parameterized model checking of rendezvous systems. 187-222 2018 31 Distributed Comput. 3 https://doi.org/10.1007/s00446-017-0302-6 https://www.wikidata.org/entity/Q59605462 db/journals/dc/dc31.html#AminofKRSV18

Tomer Kotek Johann A. Makowsky Elena V. Ravve On sequences of polynomials arising from graph invariants. 181-198 2018 67 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2017.08.002 db/journals/ejc/ejc67.html#KotekMR18

Shachar Itzhaky Tomer Kotek Noam Rinetzky Mooly Sagiv Orr Tamir Helmut Veith Florian Zuleger On the Automated Verification of Web Applications with Embedded SQL. 16:1-16:18 2017 ICDT https://doi.org/10.4230/LIPIcs.ICDT.2017.16 conf/icdt/2017 db/conf/icdt/icdt2017.html#ItzhakyKRSTVZ17

Andrew J. Goodall Miki Hermann Tomer Kotek Johann A. Makowsky Steven D. Noble On the complexity of generalized chromatic polynomials. 2017 abs/1701.06639 CoRR http://arxiv.org/abs/1701.06639 db/journals/corr/corr1701.html#GoodallHKMN17

Igor V. Konnov 0001 Tomer Kotek Qiang Wang 0020 Helmut Veith Simon Bliudze Joseph Sifakis Parameterized Systems in BIP: Design and Model Checking. 30:1-30:16 2016 CONCUR https://doi.org/10.4230/LIPIcs.CONCUR.2016.30 conf/concur/2016 db/conf/concur/concur2016.html#KonnovKWVBS16 Tomer Kotek Helmut Veith Florian Zuleger Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. 13:1-13:20 2016 CSL https://doi.org/10.4230/LIPIcs.CSL.2016.13 conf/csl/2016 db/conf/csl/csl2016.html#KotekVZ16

Shachar Itzhaky Tomer Kotek Noam Rinetzky Mooly Sagiv Orr Tamir Helmut Veith Florian Zuleger On the automated verification of web applications with embedded SQL. 2016 abs/1610.02101 CoRR http://arxiv.org/abs/1610.02101 db/journals/corr/corr1610.html#ItzhakyKRSTVZ16

Markus Dod Tomer Kotek James Preen Peter Tittmann 0001 Bipartition polynomials, the Ising model and domination in graphs. 335-353 2015 35 Discuss. Math. Graph Theory 2 https://doi.org/10.7151/dmgt.1808 db/journals/dmgt/dmgt35.html#DodKPT15

Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger Extending ALCQIO with Trees. 511-522 2015 LICS https://doi.org/10.1109/LICS.2015.54 https://doi.ieeecomputersociety.org/10.1109/LICS.2015.54 http://dl.acm.org/citation.cfm?id=2876560 conf/lics/2015 db/conf/lics/lics2015.html#KotekSVZ15 Tomer Kotek Johann A. Makowsky Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. 135-146 2015 TTCS https://doi.org/10.1007/978-3-319-28678-5_10 conf/ttcs/2015 db/conf/ttcs/ttcs2015.html#KotekM15

Tomer Kotek Johann A. Makowsky Efficient computation of generalized Ising polynomials on graphs with fixed clique-width. 2015 abs/1505.06617 CoRR http://arxiv.org/abs/1505.06617 db/journals/corr/corr1505.html#KotekM15

Tomer Kotek Helmut Veith Florian Zuleger Monadic second order finite satisfiability and unbounded tree-width. 2015 abs/1505.06622 CoRR http://arxiv.org/abs/1505.06622 db/journals/corr/corr1505.html#KotekVZ15

Tomer Kotek Johann A. Makowsky Connection Matrices and the Definability of Graph Parameters. 2014 Log. Methods Comput. Sci. https://doi.org/10.2168/LMCS-10(4:1)2014 http://arxiv.org/abs/1308.3654 10 4 db/journals/lmcs/lmcs10.html#KotekM13

Tomer Kotek Johann A. Makowsky Recurrence relations for graph polynomials on bi-iterative families of graphs. 47-67 2014 41 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2014.03.012 db/journals/ejc/ejc41.html#KotekM14

Tomer Kotek James Preen Peter Tittmann 0001 Subset-Sum Representations of Domination Polynomials. 647-660 2014 30 Graphs Comb. 3 https://doi.org/10.1007/s00373-013-1286-z db/journals/gc/gc30.html#KotekPT14

Tomer Kotek Johann A. Makowsky A representation theorem for (q-)holonomic sequences. 363-374 2014 80 J. Comput. Syst. Sci. 2 https://doi.org/10.1016/j.jcss.2013.05.004 db/journals/jcss/jcss80.html#KotekM14

Benjamin Aminof Tomer Kotek Sasha Rubin Francesco Spegni Helmut Veith Parameterized Model Checking of Rendezvous Systems. 109-124 2014 CONCUR https://doi.org/10.1007/978-3-662-44584-6_9 conf/concur/2014 db/conf/concur/concur2014.html#AminofKRSV14 Diego Calvanese Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger Shape and Content: Incorporating Domain Knowledge into Shape Analysis. 124-127 2014 Description Logics https://ceur-ws.org/Vol-1193/paper_34.pdf conf/dlog/2014 db/conf/dlog/dlog2014.html#CalvaneseKSVZ14 Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. 591-594 2014 Description Logics https://ceur-ws.org/Vol-1193/paper_35.pdf conf/dlog/2014 db/conf/dlog/dlog2014.html#KotekSVZ14 Diego Calvanese Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures. 3-17 2014 IFM https://doi.org/10.1007/978-3-319-10181-1_1 https://www.wikidata.org/entity/Q64360037 conf/ifm/2014 db/conf/ifm/ifm2014.html#CalvaneseKSVZ14

Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger Extending ALCQIO with reachability. 2014 abs/1402.6804 CoRR http://arxiv.org/abs/1402.6804 db/journals/corr/corr1402.html#KotekSVZ14

Diego Calvanese Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger Shape and Content: Incorporating Domain Knowledge into Shape Analysis. 2013 abs/1312.6624 CoRR http://arxiv.org/abs/1312.6624 db/journals/corr/corr1312.html#CalvaneseKSVZ13

Tomer Kotek Definability of combinatorial functions. Technion - Israel Institute of Technology, Israel 2012 https://technion.primo.exlibrisgroup.com/permalink/972TEC_INST/q1jq5o/alma990023315360203971

Tomer Kotek James Preen Frank Simon Peter Tittmann 0001 Martin Trinks Recurrence Relations and Splitting Formulas for the Domination Polynomial. 47 2012 19 Electron. J. Comb. 3 https://doi.org/10.37236/2475 db/journals/combinatorics/combinatorics19.html#KotekPSTT12

Tomer Kotek Complexity of Ising Polynomials. 743-772 2012 21 Comb. Probab. Comput. 5 https://doi.org/10.1017/S0963548312000259 db/journals/cpc/cpc21.html#Kotek12

Tomer Kotek Johann A. Makowsky A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths. 199-213 2012 117 Fundam. Informaticae 1-4 https://doi.org/10.3233/FI-2012-696 db/journals/fuin/fuin117.html#KotekM12

Tomer Kotek Johann A. Makowsky Connection Matrices and the Definability of Graph Parameters. 411-425 2012 CSL https://doi.org/10.4230/LIPIcs.CSL.2012.411 conf/csl/2012 db/conf/csl/csl2012.html#KotekM12 Tomer Kotek Johann A. Makowsky Elena V. Ravve A Computational Framework for the Study of Partition Functions and Graph Polynomials. 365-368 2012 SYNASC https://doi.org/10.1109/SYNASC.2012.36 https://doi.ieeecomputersociety.org/10.1109/SYNASC.2012.36 conf/synasc/2012 db/conf/synasc/synasc2012.html#KotekMR12

Ilya Averbouch Tomer Kotek Johann A. Makowsky Elena V. Ravve The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. 77-82 2011 38 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2011.09.013 db/journals/endm/endm38.html#AverbouchKMR11

Tomer Kotek Complexity of Ising Polynomials http://arxiv.org/abs/1110.3639 2011 CoRR abs/1110.3639 db/journals/corr/corr1110.html#abs-1110-3639

Tomer Kotek Johann A. Makowsky Definability of Combinatorial Functions and Their Linear Recurrence Relations. 444-462 2010 Fields of Logic and Computation https://doi.org/10.1007/978-3-642-15025-8_21 conf/birthday/2010gurevich db/conf/birthday/gurevich2010.html#KotekM10

Tomer Kotek On the reconstruction of graph invariants. 375-379 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.062 db/journals/endm/endm34.html#Kotek09

Eldar Fischer Tomer Kotek Johann A. Makowsky Application of logic to combinatorial sequences and their recurrence relations. 1-42 2009 AMS-ASL Joint Special Session conf/asl/2009s db/conf/asl/asl2009s.html#FischerKM09 Tomer Kotek Johann A. Makowsky Boris Zilber On Counting Generalized Colorings. 207-242 2009 AMS-ASL Joint Special Session conf/asl/2009s db/conf/asl/asl2009s.html#KotekMZ09 Tomer Kotek Johann A. Makowsky Boris Zilber On Counting Generalized Colorings. 339-353 2008 CSL https://doi.org/10.1007/978-3-540-87531-4_25 conf/csl/2008 db/conf/csl/csl2008.html#KotekMZ08 Benny Godlin Tomer Kotek Johann A. Makowsky Evaluations of Graph Polynomials. 183-194 2008 WG https://doi.org/10.1007/978-3-540-92248-3_17 conf/wg/2008 db/conf/wg/wg2008.html#GodlinKM08 Benjamin Aminof Ilya Averbouch Simon Bliudze Diego Calvanese Markus Dod Eldar Fischer Benny Godlin Andrew J. Goodall Miki Hermann Shachar Itzhaky Igor Konnov 0001Igor V. Konnov 0001 Nadia Labai Johann A. Makowsky Steven D. Noble Magdalena Ortiz 0001 James Preen Elena V. Ravve Noam Rinetzky Sasha Rubin Shmuel SagivMooly Sagiv Joseph Sifakis Mantas Simkus Frank Simon Francesco Spegni Orr Tamir Peter Tittmann 0001 Martin Trinks Helmut Veith Qiang Wang 0020 Boris Zilber Florian Zuleger