• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 149 matches

• 2024
• 
  Eldar Fischer, Johann A. Makowsky:
  Extensions and Limits of the Specker-Blatter Theorem. CSL 2024: 26:1-26:20
• 2023
• 
  Johann A. Makowsky, Vsevolod Rakita:
  Almost unimodal and real-rooted graph polynomials. Eur. J. Comb. 108: 103637 (2023)
• 2022
• 
  Tomer Kotek, Johann A. Makowsky:
  On the Tutte and Matching Polynomials for Complete Graphs. Fundam. Informaticae 186(1-4): 155-173 (2022)
• 2021
• 
  Johann A. Makowsky:
  Some Thoughts on Computational Models: From Massive Human Computing to Abstract State Machines, and Beyond. Logic, Computation and Rigorous Methods 2021: 173-186
• 2020
• 
  Johann A. Makowsky:
  To Yuri at 80 and More than 40 Years of Friendship. Fields of Logic and Computation III 2020: 3-6
• 
  Orli Herscovici, Johann A. Makowsky, Vsevolod Rakita:
  Harary polynomials. CoRR abs/2003.06250 (2020)
• 2019
• 
  Johann A. Makowsky, R. X. Zhang:
  On P-unique hypergraphs. Australas. J Comb. 73: 456-465 (2019)
• 
  Johann A. Makowsky:
  Can one design a geometry engine? - On the (un)decidability of certain affine Euclidean geometries. Ann. Math. Artif. Intell. 85(2-4): 259-291 (2019)
• 
  Johann A. Makowsky, Elena V. Ravve, Tomer Kotek:
  A logician's view of graph polynomials. Ann. Pure Appl. Log. 170(9): 1030-1069 (2019)
• 
  Johann A. Makowsky, Vsevolod Rakita:
  On Weakly Distinguishing Graph Polynomials. Discret. Math. Theor. Comput. Sci. 21(1) (2019)
• 
  Tomer Kotek, Johann A. Makowsky:
  The exact complexity of the Tutte polynomial. CoRR abs/1910.08915 (2019)
• 2018
• 
  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)
• 
  Tomer Kotek, Johann A. Makowsky, Elena V. Ravve:
  On sequences of polynomials arising from graph invariants. Eur. J. Comb. 67: 181-198 (2018)
• 
  Johann A. Makowsky:
  The Undecidability of Orthogonal and Origami Geometries. WoLLIC 2018: 250-270
• 2017
• 
  Johann A. Makowsky, Anna Zamansky:
  Keeping logic in the trivium of computer science: a teaching perspective. Formal Methods Syst. Des. 51(2): 419-430 (2017)
• 
  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)
• 
  Johann A. Makowsky:
  Can one design a geometry engine? On the (un)decidability of affine Euclidean geometries. CoRR abs/1712.07474 (2017)
• 2016
• 
  Nadia Labai, Johann A. Makowsky:
  Hankel Matrices for Weighted Visibly Pushdown Automata. LATA 2016: 464-477
• 
  Nadia Labai, Johann A. Makowsky:
  On the Exact Learnability of Graph Parameters: The Case of Partition Functions. MFCS 2016: 63:1-63:13
• 
  Johann A. Makowsky, Elena V. Ravve:
  Semantic Equivalence of Graph Polynomials Definable in Second Order Logic. WoLLIC 2016: 279-296
• 
  Nadia Labai, Johann A. Makowsky:
  On the exact learnability of graph parameters: The case of partition functions. CoRR abs/1606.04056 (2016)
• 
  Joanna A. Ellis-Monaghan, Andrew J. Goodall, Johann A. Makowsky, Iain Moffatt:
  Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241). Dagstuhl Reports 6(6): 26-48 (2016)
• 2015
• 
  Nadia Labai, Johann A. Makowsky:
  Logics of Finite Hankel Rank. Fields of Logic and Computation II 2015: 237-252
• 
  Johann A. Makowsky, Nadia Labai:
  Hankel Matrices: From Words to Graphs (Extended Abstract). LATA 2015: 47-55
• 
  Tomer Kotek, Johann A. Makowsky:
  Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. TTCS 2015: 135-146
• 
  Tomer Kotek, Johann A. Makowsky:
  Efficient computation of generalized Ising polynomials on graphs with fixed clique-width. CoRR abs/1505.06617 (2015)
• 
  Nadia Labai, Johann A. Makowsky:
  Hankel Matrices for Weighted Visibly Pushdown Automata. CoRR abs/1512.02430 (2015)
• 
  Johann A. Makowsky:
  Teaching Logic for Computer Science: Are We Teaching the Wrong Narrative? CoRR abs/1507.03672 (2015)
• 2014
• 
  Tomer Kotek, Johann A. Makowsky:
  Connection Matrices and the Definability of Graph Parameters. Log. Methods Comput. Sci. 10(4) (2014)
• 
  Tomer Kotek, Johann A. Makowsky:
  Recurrence relations for graph polynomials on bi-iterative families of graphs. Eur. J. Comb. 41: 47-67 (2014)

skipping 119 more matches