default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomer Kotek
Person information
- affiliation: TU Wien, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Tomer Kotek, Johann A. Makowsky:
On the Tutte and Matching Polynomials for Complete Graphs. Fundam. Informaticae 186(1-4): 155-173 (2022)- 2020
- [c17]Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith:
Pebble-Intervals Automata and FO2 with Two Orders. LATA 2020: 208-221
2010 – 2019
- 2019
- [j14]Johann A. Makowsky, Elena V. Ravve, Tomer Kotek:
A logician's view of graph polynomials. Ann. Pure Appl. Log. 170(9): 1030-1069 (2019) - [i9]Tomer Kotek, Johann A. Makowsky:
The exact complexity of the Tutte polynomial. CoRR abs/1910.08915 (2019) - [i8]Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith:
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version). CoRR abs/1912.00171 (2019) - 2018
- [j13]Andrew J. Goodall
, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble:
On the complexity of generalized chromatic polynomials. Adv. Appl. Math. 94: 71-102 (2018) - [j12]Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized model checking of rendezvous systems. Distributed Comput. 31(3): 187-222 (2018) - [j11]Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
On sequences of polynomials arising from graph invariants. Eur. J. Comb. 67: 181-198 (2018) - 2017
- [c16]Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger:
On the Automated Verification of Web Applications with Embedded SQL. ICDT 2017: 16:1-16:18 - [i7]Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble:
On the complexity of generalized chromatic polynomials. CoRR abs/1701.06639 (2017) - 2016
- [c15]Igor V. Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, Joseph Sifakis:
Parameterized Systems in BIP: Design and Model Checking. CONCUR 2016: 30:1-30:16 - [c14]Tomer Kotek, Helmut Veith, Florian Zuleger:
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. CSL 2016: 13:1-13:20 - [i6]Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger:
On the automated verification of web applications with embedded SQL. CoRR abs/1610.02101 (2016) - 2015
- [j10]Markus Dod, Tomer Kotek, James Preen, Peter Tittmann:
Bipartition polynomials, the Ising model and domination in graphs. Discuss. Math. Graph Theory 35(2): 335-353 (2015) - [c13]Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Extending ALCQIO with Trees. LICS 2015: 511-522 - [c12]Tomer Kotek, Johann A. Makowsky:
Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. TTCS 2015: 135-146 - [i5]Tomer Kotek, Johann A. Makowsky:
Efficient computation of generalized Ising polynomials on graphs with fixed clique-width. CoRR abs/1505.06617 (2015) - [i4]Tomer Kotek, Helmut Veith, Florian Zuleger:
Monadic second order finite satisfiability and unbounded tree-width. CoRR abs/1505.06622 (2015) - 2014
- [j9]Tomer Kotek, Johann A. Makowsky:
Connection Matrices and the Definability of Graph Parameters. Log. Methods Comput. Sci. 10(4) (2014) - [j8]Tomer Kotek, Johann A. Makowsky:
Recurrence relations for graph polynomials on bi-iterative families of graphs. Eur. J. Comb. 41: 47-67 (2014) - [j7]Tomer Kotek, James Preen, Peter Tittmann:
Subset-Sum Representations of Domination Polynomials. Graphs Comb. 30(3): 647-660 (2014) - [j6]Tomer Kotek, Johann A. Makowsky:
A representation theorem for (q-)holonomic sequences. J. Comput. Syst. Sci. 80(2): 363-374 (2014) - [c11]Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized Model Checking of Rendezvous Systems. CONCUR 2014: 109-124 - [c10]Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. Description Logics 2014: 124-127 - [c9]Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. Description Logics 2014: 591-594 - [c8]Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures. IFM 2014: 3-17 - [i3]Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Extending ALCQIO with reachability. CoRR abs/1402.6804 (2014) - 2013
- [i2]Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger:
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. CoRR abs/1312.6624 (2013) - 2012
- [b1]Tomer Kotek:
Definability of combinatorial functions. Technion - Israel Institute of Technology, Israel, 2012 - [j5]Tomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks:
Recurrence Relations and Splitting Formulas for the Domination Polynomial. Electron. J. Comb. 19(3): 47 (2012) - [j4]Tomer Kotek:
Complexity of Ising Polynomials. Comb. Probab. Comput. 21(5): 743-772 (2012) - [j3]Tomer Kotek, Johann A. Makowsky:
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths. Fundam. Informaticae 117(1-4): 199-213 (2012) - [c7]Tomer Kotek, Johann A. Makowsky:
Connection Matrices and the Definability of Graph Parameters. CSL 2012: 411-425 - [c6]Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
A Computational Framework for the Study of Partition Functions and Graph Polynomials. SYNASC 2012: 365-368 - 2011
- [j2]Ilya Averbouch, Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. Electron. Notes Discret. Math. 38: 77-82 (2011) - [i1]Tomer Kotek:
Complexity of Ising Polynomials. CoRR abs/1110.3639 (2011) - 2010
- [c5]Tomer Kotek, Johann A. Makowsky:
Definability of Combinatorial Functions and Their Linear Recurrence Relations. Fields of Logic and Computation 2010: 444-462
2000 – 2009
- 2009
- [j1]Tomer Kotek:
On the reconstruction of graph invariants. Electron. Notes Discret. Math. 34: 375-379 (2009) - [c4]Eldar Fischer, Tomer Kotek, Johann A. Makowsky:
Application of logic to combinatorial sequences and their recurrence relations. AMS-ASL Joint Special Session 2009: 1-42 - [c3]Tomer Kotek, Johann A. Makowsky, Boris Zilber:
On Counting Generalized Colorings. AMS-ASL Joint Special Session 2009: 207-242 - 2008
- [c2]Tomer Kotek, Johann A. Makowsky, Boris Zilber:
On Counting Generalized Colorings. CSL 2008: 339-353 - [c1]Benny Godlin, Tomer Kotek, Johann A. Makowsky:
Evaluations of Graph Polynomials. WG 2008: 183-194
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
