My writing

DOI10.1007/978-3-031-86319-6_1MaRDI QIDQ7236625zbMATH OpenFDO

Authors Johann A. Makowsky

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-86319-6_1

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Combinatorics (05-XX) Computer science (68-XX)

Cites work

• A computational framework for the study of partition functions and graph polynomials
• A graph polynomial arising from community structure (extended abstract)
• A logician's view of graph polynomials
• A Most General Edge Elimination Polynomial
• A proof rule for fair termination of guarded commands
• A representation theorem for (q-)holonomic sequences
• A representation theorem for holonomic sequences based on counting lattice paths
• Algorithmic uses of the Feferman-Vaught theorem
• Almost unimodal and real-rooted graph polynomials
• An extension of the bivariate chromatic polynomial
• Application of logic to combinatorial sequences and their recurrence relations
• Application of logic to integer sequences: a survey
• Arity and alternation in second-order logic
• Axiomatizing origami planes
• BCNF via attribute splitting
• Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
• Capturing complexity classes with Lindström quantifiers
• Capturing relativized complexity classes with Lindström quantifiers
• Characterizing specification languages which admit initial semantics
• Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Completeness Theorems For Modal Model Theory With the Montague‐Chang Semantics I
• Complexity of the Bollobás-Riordan Polynomial
• Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
• Computer science logic. 17th international workshop CSL 2003, 12th annual conference of the EACSL, 8th Kurt Gödel colloquium KGC 2003, Vienna, Austria, August 25--30, 2003. Proceedings
• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• Connection matrices and the definability of graph parameters
• Connection matrices and the definability of graph parameters
• Connection Matrices for MSOL-Definable Structural Invariants
• Contraction-deletion invariants for graphs
• Counting finite topologies
• Counting truth assignments of formulas of bounded tree-width or clique-width
• Decidability of finite probabilistic propositional dynamic logics
• Definability and Complexity of Graph Parameters (Invited Talk).
• Definability of combinatorial functions and their linear recurrence relations
• Dependency preserving refinements and the fundamental problem of database design
• Efficient computation of generalized Ising polynomials on graphs with fixed clique-width
• Evaluations of Graph Polynomials
• Extensions and limits of the Specker-Blatter theorem
• Extensions for open default theories via the domain closure assumption
• Farrell polynomials on graphs of bounded tree width
• Fifty years of the spectrum problem: survey and new results
• Finitary sketches
• Finiteness conditions for graph algebras over tropical semirings
• From a zoo to a zoology: Towards a general theory of graph polynomials
• From Hilbert's program to a logic tool box
• Fusion in relational structures and the verification of monadic second-order properties
• Generalizing Parikh's theorem
• Graph polynomials: from recursive definitions to subset expansion formulas
• Hankel matrices for weighted visibly pushdown automata
• Hankel Matrices: From Words to Graphs (Extended Abstract)
• Harary polynomials
• How I got to like graph polynomials
• scientific article; zbMATH DE number 1670492 (Why is no real title available?)
• scientific article; zbMATH DE number 1678371 (Why is no real title available?)
• scientific article; zbMATH DE number 1819874 (Why is no real title available?)
• scientific article; zbMATH DE number 3881877 (Why is no real title available?)
• scientific article; zbMATH DE number 3852975 (Why is no real title available?)
• scientific article; zbMATH DE number 3815000 (Why is no real title available?)
• scientific article; zbMATH DE number 3827186 (Why is no real title available?)
• scientific article; zbMATH DE number 3898209 (Why is no real title available?)
• scientific article; zbMATH DE number 3914328 (Why is no real title available?)
• scientific article; zbMATH DE number 3942990 (Why is no real title available?)
• scientific article; zbMATH DE number 3976395 (Why is no real title available?)
• scientific article; zbMATH DE number 4049167 (Why is no real title available?)
• scientific article; zbMATH DE number 4080897 (Why is no real title available?)
• scientific article; zbMATH DE number 4108154 (Why is no real title available?)
• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• scientific article; zbMATH DE number 3729439 (Why is no real title available?)
• scientific article; zbMATH DE number 3735785 (Why is no real title available?)
• scientific article; zbMATH DE number 3776840 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 3485741 (Why is no real title available?)
• scientific article; zbMATH DE number 3623539 (Why is no real title available?)
• scientific article; zbMATH DE number 408785 (Why is no real title available?)
• scientific article; zbMATH DE number 1262783 (Why is no real title available?)
• scientific article; zbMATH DE number 1342210 (Why is no real title available?)
• scientific article; zbMATH DE number 733393 (Why is no real title available?)
• scientific article; zbMATH DE number 1081433 (Why is no real title available?)
• scientific article; zbMATH DE number 1088200 (Why is no real title available?)
• scientific article; zbMATH DE number 1130213 (Why is no real title available?)
• scientific article; zbMATH DE number 1163938 (Why is no real title available?)
• scientific article; zbMATH DE number 1504634 (Why is no real title available?)
• scientific article; zbMATH DE number 1555186 (Why is no real title available?)
• scientific article; zbMATH DE number 1554144 (Why is no real title available?)
• scientific article; zbMATH DE number 1859215 (Why is no real title available?)
• scientific article; zbMATH DE number 3428889 (Why is no real title available?)
• scientific article; zbMATH DE number 272725 (Why is no real title available?)
• scientific article; zbMATH DE number 3420735 (Why is no real title available?)
• Incremental model checking for decomposable structures
• Keeping logic in the trivium of computer science: a teaching perspective
• Linear Recurrence Relations for Graph Polynomials
• Linear time solvable optimization problems on graphs of bounded clique-width
• Logical Approaches to Computational Barriers
• Logics capturing relativized complexity classes uniformly
• Logics of finite Hankel rank
• MC-finiteness of restricted set partition functions
• Model Theoretic Methods in Finite Combinatorics
• Model theory
• Model theory in computer science: my own recurrent themes
• NCE graph grammars and clique-width.
• Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning
• On P-unique hypergraphs
• On Average Case Complexity of SAT for Symmetric Distribution
• On counting generalized colorings
• On Counting Generalized Colorings
• On Extensions of Elementary Logic
• On sequences of polynomials arising from graph invariants
• On some conjectures connected with complete sentences
• On spectra of sentences of monadic second order logic with counting
• On the algebraic complexity of some families of coloured Tutte polynomials
• On the clique-width of graph with few \(P_{4}\)'s
• On the complexity of generalized chromatic polynomials
• On the exact learnability of graph parameters: the case of partition functions
• On the existence of polynomial time algorithms for interpolation problems in propositional logic
• On the expressive power of data dependencies
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• On the location of roots of graph polynomials
• On the Tutte and Matching Polynomials for Complete Graphs
• On weakly distinguishing graph polynomials
• Positive results in abstract model theory: a theory of compact logics
• Problemi di decidibilita in logica topologica
• Propositional dynamic logic with local assignments
• Query languages for hierarchic databases
• Recurrence relations for graph polynomials on bi-iterative families of graphs
• Remembering Ernst Specker (1920--2011)
• Restrictions of minimum spanner problems
• Semantic equivalence of graph polynomials definable in second order logic
• Some model theory for monotone quantifiers
• Some observations on Uniform Reduction for properties invariant on the range of definable relations
• Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
• The enumeration of vertex induced subgraphs with respect to the number of components
• The exact complexity of the Tutte polynomial
• The expressive power of side effects in prolog
• The parametrized complexity of knot polynomials
• The theorems of beth and Craig in abstract model theory II. Compact logics
• The undecidability of orthogonal and origami geometries
• The universal edge elimination polynomial and the dichromatic polynomial
• Theorems of Beth and Craig in Abstract Model Theory. I The Abstract Settin
• To Yuri at 80 and More than 40 Years of Friendship
• Topological model theory with an interior operator: Consistency properties and back — and forth arguments
• Tree-width and the monadic quantifier hierarchy.
• Unification as a complexity measure for logic programming
• Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
• Vopěnka's principle and compact logics
• Weak second order characterizations of various program verification systems
• Weakly distinguishing graph polynomials on addable properties
• Weighted automata and monadic second order logic
• Why Horn formulas matter in computer science: initial structures and generic examples
• δ-Logics and generalized quantifiers

This page was built for publication: My writing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236625)