Johann A. Makowsky

ORCID

Publication Activity (10 Years)

Years Active: 1977-2024
Publications (10 Years): 22

Top Venues

Publications

Eldar Fischer, Johann A. Makowsky
Extensions and Limits of the Specker-Blatter Theorem. CSL (2024)
Johann A. Makowsky, Vsevolod Rakita
Almost unimodal and real-rooted graph polynomials. Eur. J. Comb. 108 (2023)
Tomer Kotek, Johann A. Makowsky
On the Tutte and Matching Polynomials for Complete Graphs. Fundam. Informaticae 186 (1-4) (2022)
Johann A. Makowsky
Some Thoughts on Computational Models: From Massive Human Computing to Abstract State Machines, and Beyond. Logic, Computation and Rigorous Methods (2021)
Orli Herscovici, Johann A. Makowsky, Vsevolod Rakita
Harary polynomials. CoRR (2020)
Johann A. Makowsky
To Yuri at 80 and More than 40 Years of Friendship. Fields of Logic and Computation III (2020)
Tomer Kotek, Johann A. Makowsky
The exact complexity of the Tutte polynomial. CoRR (2019)
Johann A. Makowsky, Elena V. Ravve, Tomer Kotek
A logician's view of graph polynomials. Ann. Pure Appl. Log. 170 (9) (2019)
Johann A. Makowsky, R. X. Zhang
-unique hypergraphs. Australas. J Comb. 73 (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) (2019)
Johann A. Makowsky, Vsevolod Rakita
On Weakly Distinguishing Graph Polynomials. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Johann A. Makowsky
The Undecidability of Orthogonal and Origami Geometries. WoLLIC (2018)
Tomer Kotek, Johann A. Makowsky, Elena V. Ravve
On sequences of polynomials arising from graph invariants. Eur. J. Comb. 67 (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 (2018)
Johann A. Makowsky, Anna Zamansky
Keeping logic in the trivium of computer science: a teaching perspective. Formal Methods Syst. Des. 51 (2) (2017)
Johann A. Makowsky
Can one design a geometry engine? On the (un)decidability of affine Euclidean geometries. CoRR (2017)
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
On the complexity of generalized chromatic polynomials. CoRR (2017)
Nadia Labai, Johann A. Makowsky
On the exact learnability of graph parameters: The case of partition functions. CoRR (2016)
Nadia Labai, Johann A. Makowsky
On the Exact Learnability of Graph Parameters: The Case of Partition Functions. MFCS (2016)
Johann A. Makowsky, Elena V. Ravve
Semantic Equivalence of Graph Polynomials Definable in Second Order Logic. WoLLIC (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) (2016)
Nadia Labai, Johann A. Makowsky
Hankel Matrices for Weighted Visibly Pushdown Automata. LATA (2016)
Johann A. Makowsky, Nadia Labai
Hankel Matrices: From Words to Graphs (Extended Abstract). LATA (2015)
Nadia Labai, Johann A. Makowsky
Hankel Matrices for Weighted Visibly Pushdown Automata. CoRR (2015)
Nadia Labai, Johann A. Makowsky
Logics of Finite Hankel Rank. Fields of Logic and Computation II (2015)
Tomer Kotek, Johann A. Makowsky
Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. TTCS (2015)
Johann A. Makowsky
Teaching Logic for Computer Science: Are We Teaching the Wrong Narrative? CoRR (2015)
Tomer Kotek, Johann A. Makowsky
Efficient computation of generalized Ising polynomials on graphs with fixed clique-width. CoRR (2015)
Tomer Kotek, Johann A. Makowsky
Recurrence relations for graph polynomials on bi-iterative families of graphs. Eur. J. Comb. 41 (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
A representation theorem for (q-)holonomic sequences. J. Comput. Syst. Sci. 80 (2) (2014)
Johann A. Makowsky, Elena V. Ravve, N. K. Blanchard
On the location of roots of graph polynomials. Eur. J. Comb. 41 (2014)
Nadia Labai, Johann A. Makowsky
Weighted Automata and Monadic Second Order Logic. GandALF (2013)
Johann A. Makowsky, Elena V. Ravve
On the Location of Roots of Graph Polynomials. Electron. Notes Discret. Math. 43 (2013)
Johann A. Makowsky
Definability and Complexity of Graph Parameters (Invited Talk). CSL (2012)
Tomer Kotek, Johann A. Makowsky, Elena V. Ravve
A Computational Framework for the Study of Partition Functions and Graph Polynomials. SYNASC (2012)
Johann A. Makowsky, Elena V. Ravve
BCNF via Attribute Splitting. Conceptual Modelling and Its Theoretical Foundations (2012)
Tomer Kotek, Johann A. Makowsky
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths. Fundam. Informaticae 117 (1-4) (2012)
Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More
Fifty years of the spectrum problem: survey and new results. Bull. Symb. Log. 18 (4) (2012)
Benny Godlin, Emilia Katz, Johann A. Makowsky
Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas. J. Log. Comput. 22 (2) (2012)
Tomer Kotek, Johann A. Makowsky
Connection Matrices and the Definability of Graph Parameters. CSL (2012)
Sri Gopal Mohanty, Simone Rinaldi, Johann A. Makowsky
Foreword. Fundam. Informaticae 117 (1-4) (2012)
Ilya Averbouch, Tomer Kotek, Johann A. Makowsky, Elena V. Ravve
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. Electron. Notes Discret. Math. 38 (2011)
Peter Tittmann, Ilya Averbouch, Johann A. Makowsky
The enumeration of vertex induced subgraphs with respect to the number of components. Eur. J. Comb. 32 (7) (2011)
Johann A. Makowsky
Model Theory in Computer Science: My Own Recurrent Themes. CSL (2011)
Johann A. Makowsky, Damian Niwinski
The Ackermann Award 2010. CSL (2010)
Tomer Kotek, Johann A. Makowsky
Definability of Combinatorial Functions and Their Linear Recurrence Relations. Fields of Logic and Computation (2010)
Johann A. Makowsky
Application of Logic to Integer Sequences: A Survey. WoLLIC (2010)
Ilya Averbouch, Benny Godlin, Johann A. Makowsky
An extension of the bivariate chromatic polynomial. Eur. J. Comb. 31 (1) (2010)
Markus Bläser, Holger Dell, Johann A. Makowsky
Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions. Theory Comput. Syst. 46 (4) (2010)
Tomer Kotek, Johann A. Makowsky, Boris Zilber
On Counting Generalized Colorings. AMS-ASL Joint Special Session (2009)
Eldar Fischer, Tomer Kotek, Johann A. Makowsky
Application of logic to combinatorial sequences and their recurrence relations. AMS-ASL Joint Special Session (2009)
Johann A. Makowsky, Alexander A. Razborov
The Ackermann Award 2009. CSL (2009)
Ilya Averbouch, Johann A. Makowsky, Peter Tittmann
A Graph Polynomial Arising from Community Structure (Extended Abstract). WG (2009)
Johann A. Makowsky
Connection Matrices for MSOL-Definable Structural Invariants. ICLA (2009)
Johann A. Makowsky, Damian Niwinski
The Ackermann Award 2008. CSL (2008)
Johann A. Makowsky
From Hilbert's Program to a Logic Toolbox. ISAIM (2008)
Tomer Kotek, Johann A. Makowsky, Boris Zilber
On Counting Generalized Colorings. CSL (2008)
Johann A. Makowsky
From Hilbert's program to a logic tool box. Ann. Math. Artif. Intell. 53 (1-4) (2008)
Ariel Cohen, Michael Kaminski, Johann A. Makowsky
Notions of Sameness by Default and their Application to Anaphora, Vagueness, and Uncertain Reasoning. J. Log. Lang. Inf. 17 (3) (2008)
Ilya Averbouch, Benny Godlin, Johann A. Makowsky
A Most General Edge Elimination Polynomial. WG (2008)
Johann A. Makowsky
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. CiE (2008)
Markus Bläser, Holger Dell, Johann A. Makowsky
Complexity of the Bollobás-Riordan Polynomial. CSR (2008)
Eldar Fischer, Johann A. Makowsky
Linear Recurrence Relations for Graph Polynomials. Pillars of Computer Science (2008)
Eldar Fischer, Johann A. Makowsky, Elena V. Ravve
Counting truth assignments of formulas of bounded tree-width or clique-width. Discret. Appl. Math. 156 (4) (2008)
Benny Godlin, Tomer Kotek, Johann A. Makowsky
Evaluations of Graph Polynomials. WG (2008)
Benny Godlin, Emilia Katz, Johann A. Makowsky
Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas CoRR (2008)
Johann A. Makowsky
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. Theory Comput. Syst. 43 (3-4) (2008)
Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski
The Ackermann Award 2007. CSL (2007)
Johann A. Makowsky
From Hilbert's Program to a Logic Toolbox. LPAR (2007)
Johann A. Makowsky
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. CiE (2006)
Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin
Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG (2006)
Samson Abramsky, Erich Grädel, Johann A. Makowsky
The Ackermann Award 2006. CSL (2006)
Johann A. Makowsky
. CSL (2005)
Johann A. Makowsky
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. Discret. Appl. Math. 145 (2) (2005)
Ariel Cohen, Michael Kaminski, Johann A. Makowsky
Indistinguishability by Default. We Will Show Them! (1) (2005)
Eldar Fischer, Johann A. Makowsky
On spectra of sentences of monadic second order logic with counting. J. Symb. Log. 69 (3) (2004)
Johann A. Makowsky
Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Log. 126 (1-3) (2004)
Martin Lotz, Johann A. Makowsky
On the algebraic complexity of some families of coloured Tutte polynomials. Adv. Appl. Math. 32 (1-2) (2004)
Alexander Glikson, Johann A. Makowsky
NCE Graph Grammars and Clique-Width. WG (2003)
Johann A. Makowsky, Julian Mariño
Tree-width and the monadic quantifier hierarchy. Theor. Comput. Sci. 303 (1) (2003)
Eldar Fischer, Johann A. Makowsky
The Specker-Blatter Theorem Revisited. COCOON (2003)
Johann A. Makowsky, Julian Mariño
Farrell polynomials on graphs of bounded tree width. Adv. Appl. Math. 30 (1-2) (2003)
Johann A. Makowsky, Julian Mariño
The parametrized complexity of knot polynomials. J. Comput. Syst. Sci. 67 (4) (2003)
Bruno Courcelle, Johann A. Makowsky
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. Math. Struct. Comput. Sci. 12 (2) (2002)
Johann A. Makowsky
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. SODA (2001)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discret. Appl. Math. 108 (1-2) (2001)
Johann A. Makowsky, Klaus Meer
On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. CSL (2000)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Syst. 33 (2) (2000)
Johann A. Makowsky, Udi Rotics
's. Int. J. Found. Comput. Sci. 10 (3) (1999)
Johann A. Makowsky, Elena V. Ravve
Dependency Preserving Refinements and the Fundamental Problem of Database Design. Data Knowl. Eng. 24 (3) (1998)
Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin
Extensions for Open Default Theories via the Domain Closure Assumption. J. Log. Comput. 8 (2) (1998)
Johann A. Makowsky, Y. B. Pnueli
Erratum to "Arity and Alternation in Second-Order Logic". Ann. Pure Appl. Log. 92 (2) (1998)
Johann A. Makowsky
. CSL (1998)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. WG (1998)
G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan
Restrictions of Minimum Spanner Problems. Inf. Comput. 136 (2) (1997)
Johann A. Makowsky, Elena V. Ravve
The Fundamental Problem of Database Design. SOFSEM (1997)
Johann A. Makowsky
Invariant Definability (Extended Abstract). Kurt Gödel Colloquium (1997)
Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický
Finitary Sketches. J. Symb. Log. 62 (3) (1997)
Johann A. Makowsky, Y. B. Pnueli
Arity and Alternation in Second-Order Logic. Ann. Pure Appl. Log. 78 (1-3) (1996)

Johann A. Makowsky.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Johann A. Makowsky